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-171631131200490.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-14a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131200490
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 02:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:40 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 50K 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-14a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-14a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716371231035

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 09:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:47:12] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-22 09:47:12] [INFO ] Transformed 143 places.
[2024-05-22 09:47:12] [INFO ] Transformed 197 transitions.
[2024-05-22 09:47:12] [INFO ] Found NUPN structural information;
[2024-05-22 09:47:12] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 75 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 136 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 136 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 136 transition count 176
Applied a total of 28 rules in 33 ms. Remains 136 /143 variables (removed 7) and now considering 176/197 (removed 21) transitions.
// Phase 1: matrix 176 rows 136 cols
[2024-05-22 09:47:12] [INFO ] Computed 2 invariants in 17 ms
[2024-05-22 09:47:12] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 09:47:12] [INFO ] Invariant cache hit.
[2024-05-22 09:47:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-22 09:47:12] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 09:47:12] [INFO ] Invariant cache hit.
[2024-05-22 09:47:12] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/312 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 248 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/312 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 110/248 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 175/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/312 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 423 constraints, problems are : Problem set: 0 solved, 175 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 9669ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 9683ms
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 176/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10148 ms. Remains : 136/143 places, 176/197 transitions.
Support contains 75 out of 136 places after structural reductions.
[2024-05-22 09:47:22] [INFO ] Flatten gal took : 33 ms
[2024-05-22 09:47:22] [INFO ] Flatten gal took : 15 ms
[2024-05-22 09:47:22] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 74 to 73
RANDOM walk for 40000 steps (263 resets) in 1388 ms. (28 steps per ms) remains 1/73 properties
BEST_FIRST walk for 40003 steps (17 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
[2024-05-22 09:47:23] [INFO ] Invariant cache hit.
[2024-05-22 09:47:23] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/55 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 55/110 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/151 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/151 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 34/185 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/185 variables, 15/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 38/223 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/223 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 25/248 variables, 9/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/248 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/248 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 16/264 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/264 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/264 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 16/280 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/280 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 16/296 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/296 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/296 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 16/312 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 136/136 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem AtomicPropp71 is UNSAT
After SMT solving in domain Int declared 5/312 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/136 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 28 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 127 transition count 155
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 115 transition count 155
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 38 place count 102 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 51 place count 102 transition count 142
Applied a total of 51 rules in 16 ms. Remains 102 /136 variables (removed 34) and now considering 142/176 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 102/136 places, 142/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 124 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 124 transition count 164
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 115 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 115 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 108 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 108 transition count 148
Applied a total of 56 rules in 12 ms. Remains 108 /136 variables (removed 28) and now considering 148/176 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 108/136 places, 148/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 104 transition count 144
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 104 transition count 144
Applied a total of 64 rules in 11 ms. Remains 104 /136 variables (removed 32) and now considering 144/176 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 104/136 places, 144/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 13 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 140 edges and 124 vertex of which 99 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Graph (trivial) has 112 edges and 99 vertex of which 56 / 99 are part of one of the 28 SCC in 2 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 71 transition count 127
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 61 place count 57 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 45 transition count 75
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 45 transition count 75
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 97 place count 33 transition count 51
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 33 transition count 51
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 21 transition count 27
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 21 transition count 27
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 145 place count 9 transition count 15
Iterating global reduction 2 with 12 rules applied. Total rules applied 157 place count 9 transition count 15
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 158 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 6 transition count 11
Applied a total of 162 rules in 17 ms. Remains 6 /136 variables (removed 130) and now considering 11/176 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 6/136 places, 11/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 119 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 119 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 115 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 115 transition count 155
Applied a total of 42 rules in 5 ms. Remains 115 /136 variables (removed 21) and now considering 155/176 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 115/136 places, 155/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 124 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 124 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 114 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 114 transition count 154
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 107 transition count 147
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 107 transition count 147
Applied a total of 58 rules in 5 ms. Remains 107 /136 variables (removed 29) and now considering 147/176 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 107/136 places, 147/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 113 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 113 transition count 153
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 106 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 106 transition count 146
Applied a total of 60 rules in 6 ms. Remains 106 /136 variables (removed 30) and now considering 146/176 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/136 places, 146/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 120 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 120 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 116 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 116 transition count 156
Applied a total of 40 rules in 4 ms. Remains 116 /136 variables (removed 20) and now considering 156/176 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 116/136 places, 156/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 127 transition count 158
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 30 place count 107 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 41 place count 107 transition count 147
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 0 with 2 rules applied. Total rules applied 43 place count 106 transition count 146
Applied a total of 43 rules in 14 ms. Remains 106 /136 variables (removed 30) and now considering 146/176 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 106/136 places, 146/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:23] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 117 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 117 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 110 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 110 transition count 150
Applied a total of 52 rules in 4 ms. Remains 110 /136 variables (removed 26) and now considering 150/176 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/136 places, 150/176 transitions.
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:24] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 105 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 105 transition count 145
Applied a total of 62 rules in 4 ms. Remains 105 /136 variables (removed 31) and now considering 145/176 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 105/136 places, 145/176 transitions.
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:24] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 163
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 112 transition count 152
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 112 transition count 152
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 105 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 105 transition count 145
Applied a total of 62 rules in 4 ms. Remains 105 /136 variables (removed 31) and now considering 145/176 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/136 places, 145/176 transitions.
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:47:24] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 129 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
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 129 transition count 159
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 119 transition count 159
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 31 place count 109 transition count 149
Iterating global reduction 0 with 10 rules applied. Total rules applied 41 place count 109 transition count 149
Applied a total of 41 rules in 11 ms. Remains 109 /136 variables (removed 27) and now considering 149/176 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 109/136 places, 149/176 transitions.
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 09:47:24] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 176/176 transitions.
Graph (complete) has 387 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 127 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 156
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 36 place count 103 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 49 place count 103 transition count 143
Applied a total of 49 rules in 11 ms. Remains 103 /136 variables (removed 33) and now considering 143/176 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 103/136 places, 143/176 transitions.
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 09:47:24] [INFO ] Input system was already deterministic with 143 transitions.
RANDOM walk for 688 steps (2 resets) in 11 ms. (57 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:47:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2024-05-22 09:47:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 176 transitions and 564 arcs took 9 ms.
Total runtime 12087 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-14a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 547
MODEL NAME: /home/mcc/execution/412/model
136 places, 176 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-14a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLFireability -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-14a"
export BK_EXAMINATION="CTLFireability"
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-14a, examination is CTLFireability"
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-171631131200490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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