About the Execution of GreatSPN+red for ShieldIIPt-PT-001B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
313.779 | 12331.00 | 30362.00 | 42.60 | TTFFTFFFFFFFFTFT | normal |
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.r355-tall-171683758200186.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 ShieldIIPt-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758200186
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 20:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-001B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716925295090
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 19:41:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 19:41:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:41:36] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-28 19:41:36] [INFO ] Transformed 73 places.
[2024-05-28 19:41:36] [INFO ] Transformed 68 transitions.
[2024-05-28 19:41:36] [INFO ] Found NUPN structural information;
[2024-05-28 19:41:36] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 61 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 17 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 73 cols
[2024-05-28 19:41:36] [INFO ] Computed 10 invariants in 6 ms
[2024-05-28 19:41:36] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-28 19:41:36] [INFO ] Invariant cache hit.
[2024-05-28 19:41:36] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-28 19:41:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 11 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:41:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:41:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:41:38] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:38] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:41:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/176 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:39] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:41:39] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:41:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/141 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 180 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2927 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 68/141 variables, 73/181 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 67/248 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-28 19:41:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 250 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2299 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 27/27 constraints]
After SMT, in 5263ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5274ms
Finished structural reductions in LTL mode , in 1 iterations and 5631 ms. Remains : 73/73 places, 68/68 transitions.
Support contains 61 out of 73 places after structural reductions.
[2024-05-28 19:41:42] [INFO ] Flatten gal took : 22 ms
[2024-05-28 19:41:42] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:41:42] [INFO ] Input system was already deterministic with 68 transitions.
Reduction of identical properties reduced properties to check from 62 to 58
RANDOM walk for 40000 steps (8 resets) in 1756 ms. (22 steps per ms) remains 5/58 properties
BEST_FIRST walk for 40003 steps (10 resets) in 172 ms. (231 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2024-05-28 19:41:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (OVERLAPS) 56/70 variables, 9/23 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 56/79 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:41:43] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:41:43] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/73 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 3/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 68/141 variables, 73/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 158 constraints, problems are : Problem set: 2 solved, 1 unsolved in 122 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 46/50 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 46/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/73 variables, 5/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 23/83 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 2/85 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-28 19:41:43] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:41:43] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 68/141 variables, 73/160 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 1/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/141 variables, 0/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 161 constraints, problems are : Problem set: 2 solved, 1 unsolved in 107 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 238ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 73 transition count 52
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 18 rules applied. Total rules applied 34 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 55 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 37 place count 55 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 47 place count 50 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 52 place count 45 transition count 39
Iterating global reduction 4 with 5 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 57 place count 45 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 42 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 93 place count 27 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 25 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 25 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 24 transition count 20
Applied a total of 99 rules in 27 ms. Remains 24 /73 variables (removed 49) and now considering 20/68 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 24/73 places, 20/68 transitions.
RANDOM walk for 40000 steps (28 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Probably explored full state space saw : 995 states, properties seen :0
Probabilistic random walk after 4727 steps, saw 995 distinct states, run finished after 14 ms. (steps per millisecond=337 ) properties seen :0
Explored full state space saw : 995 states, properties seen :0
Exhaustive walk after 4727 steps, saw 995 distinct states, run finished after 7 ms. (steps per millisecond=675 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-28 19:41:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 6 ms
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 53 out of 73 places (down from 60) after GAL structural reductions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 8 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 72 transition count 48
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 21 rules applied. Total rules applied 40 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 52 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 41 place count 52 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 51 place count 47 transition count 41
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 41 transition count 35
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 41 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 63 place count 41 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 39 transition count 33
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 24 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 21 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 21 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 20 transition count 16
Applied a total of 102 rules in 11 ms. Remains 20 /73 variables (removed 53) and now considering 16/68 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 20/73 places, 16/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 7 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Applied a total of 16 rules in 4 ms. Remains 65 /73 variables (removed 8) and now considering 60/68 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/73 places, 60/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 72 transition count 50
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 55 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 55 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 50 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 44 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 44 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 44 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 41 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 26 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 25 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 24 transition count 20
Applied a total of 94 rules in 10 ms. Remains 24 /73 variables (removed 49) and now considering 20/68 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 24/73 places, 20/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 60 transition count 55
Applied a total of 26 rules in 5 ms. Remains 60 /73 variables (removed 13) and now considering 55/68 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/73 places, 55/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Applied a total of 22 rules in 3 ms. Remains 62 /73 variables (removed 11) and now considering 57/68 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/73 places, 57/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 73 transition count 57
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 27 place count 62 transition count 52
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 57 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 33 place count 57 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 51 transition count 45
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 51 place count 45 transition count 39
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 45 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 45 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 44 transition count 38
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 81 place count 33 transition count 27
Applied a total of 81 rules in 8 ms. Remains 33 /73 variables (removed 40) and now considering 27/68 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 33/73 places, 27/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 63 transition count 58
Applied a total of 20 rules in 2 ms. Remains 63 /73 variables (removed 10) and now considering 58/68 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/73 places, 58/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 64 transition count 59
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 1 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 64/73 places, 59/68 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:41:43] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:41:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:41:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-28 19:41:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 68 transitions and 168 arcs took 1 ms.
Total runtime 7595 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPt-PT-001B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 73
TRANSITIONS: 68
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 636
MODEL NAME: /home/mcc/execution/414/model
73 places, 68 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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPt-PT-001B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716925307421
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldIIPt-PT-001B"
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 ShieldIIPt-PT-001B, 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 r355-tall-171683758200186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-001B.tgz
mv ShieldIIPt-PT-001B 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 '
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 ;