About the Execution of GreatSPN+red for Parking-PT-208
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
370.764 | 20983.00 | 56626.00 | 172.40 | FFTTTFFTTFTTTFFF | 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.r267-smll-171654405600065.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 Parking-PT-208, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405600065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-CTLCardinality-2024-00
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-01
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-02
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-03
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-04
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-05
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-06
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-07
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-08
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-09
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-10
FORMULA_NAME Parking-PT-208-CTLCardinality-2024-11
FORMULA_NAME Parking-PT-208-CTLCardinality-2023-12
FORMULA_NAME Parking-PT-208-CTLCardinality-2023-13
FORMULA_NAME Parking-PT-208-CTLCardinality-2023-14
FORMULA_NAME Parking-PT-208-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716652602567
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:56:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:56:45] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-25 15:56:45] [INFO ] Transformed 137 places.
[2024-05-25 15:56:45] [INFO ] Transformed 201 transitions.
[2024-05-25 15:56:45] [INFO ] Found NUPN structural information;
[2024-05-25 15:56:45] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-208-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Applied a total of 0 rules in 27 ms. Remains 137 /137 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 137 cols
[2024-05-25 15:56:45] [INFO ] Computed 34 invariants in 20 ms
[2024-05-25 15:56:46] [INFO ] Implicit Places using invariants in 546 ms returned [28, 44, 52, 94, 102, 110, 118, 130]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 615 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/137 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 114
Applied a total of 6 rules in 37 ms. Remains 126 /129 variables (removed 3) and now considering 114/117 (removed 3) transitions.
// Phase 1: matrix 114 rows 126 cols
[2024-05-25 15:56:46] [INFO ] Computed 26 invariants in 16 ms
[2024-05-25 15:56:46] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-25 15:56:46] [INFO ] Invariant cache hit.
[2024-05-25 15:56:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-25 15:56:46] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 126/137 places, 114/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1171 ms. Remains : 126/137 places, 114/117 transitions.
Support contains 86 out of 126 places after structural reductions.
[2024-05-25 15:56:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-25 15:56:47] [INFO ] Flatten gal took : 78 ms
FORMULA Parking-PT-208-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:56:47] [INFO ] Flatten gal took : 28 ms
[2024-05-25 15:56:47] [INFO ] Input system was already deterministic with 114 transitions.
Support contains 81 out of 126 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (1157 resets) in 2525 ms. (15 steps per ms) remains 10/63 properties
BEST_FIRST walk for 40004 steps (101 resets) in 288 ms. (138 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (99 resets) in 139 ms. (285 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 85 ms. (465 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (103 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
[2024-05-25 15:56:48] [INFO ] Invariant cache hit.
[2024-05-25 15:56:48] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 72/87 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/126 variables, 19/26 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 114/240 variables, 126/152 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 26/178 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 178 constraints, problems are : Problem set: 1 solved, 7 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 126/126 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/87 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 15:56:49] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 39/126 variables, 19/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 114/240 variables, 126/153 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 26/179 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 7/186 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-25 15:56:49] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 4 ms to minimize.
[2024-05-25 15:56:50] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/188 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 188 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 126/126 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1670ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 2 properties in 1350 ms.
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 114/114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 122 transition count 110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 122 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 118 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 115 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 32 place count 110 transition count 98
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 110 transition count 78
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 72 place count 90 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 90 transition count 77
Applied a total of 73 rules in 56 ms. Remains 90 /126 variables (removed 36) and now considering 77/114 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 90/126 places, 77/114 transitions.
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
// Phase 1: matrix 77 rows 90 cols
[2024-05-25 15:56:52] [INFO ] Computed 26 invariants in 1 ms
[2024-05-25 15:56:52] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/90 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/167 variables, 90/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 53/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 169 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/90 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 15:56:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 77/167 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 53/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 172 constraints, problems are : Problem set: 0 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-25 15:56:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 14 ms
FORMULA Parking-PT-208-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 114 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 109
Applied a total of 10 rules in 15 ms. Remains 121 /126 variables (removed 5) and now considering 109/114 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 121/126 places, 109/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 109
Applied a total of 10 rules in 10 ms. Remains 121 /126 variables (removed 5) and now considering 109/114 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 121/126 places, 109/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 111
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 111
Applied a total of 6 rules in 7 ms. Remains 123 /126 variables (removed 3) and now considering 111/114 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 123/126 places, 111/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 12 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 110
Applied a total of 8 rules in 5 ms. Remains 122 /126 variables (removed 4) and now considering 110/114 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 122/126 places, 110/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 110
Applied a total of 8 rules in 5 ms. Remains 122 /126 variables (removed 4) and now considering 110/114 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 122/126 places, 110/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 11 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 112
Applied a total of 4 rules in 5 ms. Remains 124 /126 variables (removed 2) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 124/126 places, 112/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 122 transition count 110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 122 transition count 106
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 118 transition count 106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 113 transition count 101
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 113 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 111 transition count 99
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 111 transition count 99
Applied a total of 31 rules in 27 ms. Remains 111 /126 variables (removed 15) and now considering 99/114 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 111/126 places, 99/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 109
Applied a total of 10 rules in 10 ms. Remains 121 /126 variables (removed 5) and now considering 109/114 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 121/126 places, 109/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 109
Applied a total of 10 rules in 4 ms. Remains 121 /126 variables (removed 5) and now considering 109/114 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/126 places, 109/114 transitions.
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:52] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:52] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 111
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 123 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 122 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 122 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 119 transition count 107
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 114 transition count 102
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 114 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 112 transition count 100
Applied a total of 28 rules in 17 ms. Remains 112 /126 variables (removed 14) and now considering 100/114 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 112/126 places, 100/114 transitions.
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 6 ms
[2024-05-25 15:56:53] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 114/114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 112
Applied a total of 4 rules in 3 ms. Remains 124 /126 variables (removed 2) and now considering 112/114 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/126 places, 112/114 transitions.
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:56:53] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:56:53] [INFO ] Flatten gal took : 8 ms
[2024-05-25 15:56:53] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-25 15:56:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 114 transitions and 384 arcs took 2 ms.
Total runtime 8259 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Parking-PT-208
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: 126
TRANSITIONS: 114
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]
----------------------------------------------------------------------
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: 564
MODEL NAME: /home/mcc/execution/414/model
126 places, 114 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.
Building monolithic NSF...
FORMULA Parking-PT-208-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716652623550
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-208"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Parking-PT-208, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;