About the Execution of LTSMin+red for DiscoveryGPU-PT-11a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1959.415 | 31388.00 | 110607.00 | 447.60 | FFTTTTTTFTFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418200362.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DiscoveryGPU-PT-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418200362
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39K Mar 5 18:22 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-11a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678804820158
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 14:40:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:40:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:40:23] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-14 14:40:23] [INFO ] Transformed 113 places.
[2023-03-14 14:40:23] [INFO ] Transformed 155 transitions.
[2023-03-14 14:40:23] [INFO ] Found NUPN structural information;
[2023-03-14 14:40:23] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 59 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 102 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 102 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 142
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 34 place count 101 transition count 132
Applied a total of 34 rules in 36 ms. Remains 101 /113 variables (removed 12) and now considering 132/155 (removed 23) transitions.
// Phase 1: matrix 132 rows 101 cols
[2023-03-14 14:40:23] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-14 14:40:23] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-14 14:40:23] [INFO ] Invariant cache hit.
[2023-03-14 14:40:23] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-14 14:40:23] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-14 14:40:23] [INFO ] Invariant cache hit.
[2023-03-14 14:40:23] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/113 places, 132/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 101/113 places, 132/155 transitions.
Support contains 59 out of 101 places after structural reductions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 46 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 18 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 54 out of 101 places (down from 59) after GAL structural reductions.
Finished random walk after 2347 steps, including 19 resets, run visited all 55 properties in 152 ms. (steps per millisecond=15 )
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 10 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 11 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 132 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 295 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 98 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 86 transition count 117
Applied a total of 25 rules in 36 ms. Remains 86 /101 variables (removed 15) and now considering 117/132 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 86/101 places, 117/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 9 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 97 transition count 123
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 92 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 19 place count 84 transition count 115
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 84 transition count 115
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 29 place count 83 transition count 114
Applied a total of 29 rules in 23 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 97 transition count 121
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 90 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 24 place count 81 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 33 place count 81 transition count 112
Applied a total of 33 rules in 17 ms. Remains 81 /101 variables (removed 20) and now considering 112/132 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 81/101 places, 112/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 93 transition count 124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 88 transition count 119
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 88 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 86 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 86 transition count 117
Applied a total of 30 rules in 16 ms. Remains 86 /101 variables (removed 15) and now considering 117/132 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 86/101 places, 117/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 11 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 84 transition count 115
Applied a total of 34 rules in 10 ms. Remains 84 /101 variables (removed 17) and now considering 115/132 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 84/101 places, 115/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 8 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 9 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 98 transition count 123
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 92 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 84 transition count 115
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 84 transition count 115
Applied a total of 29 rules in 14 ms. Remains 84 /101 variables (removed 17) and now considering 115/132 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 84/101 places, 115/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 97 transition count 123
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 92 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 18 place count 85 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 25 place count 85 transition count 116
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 27 place count 84 transition count 115
Applied a total of 27 rules in 15 ms. Remains 84 /101 variables (removed 17) and now considering 115/132 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 84/101 places, 115/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 5 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 93 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 89 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 86 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 86 transition count 117
Applied a total of 30 rules in 4 ms. Remains 86 /101 variables (removed 15) and now considering 117/132 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 86/101 places, 117/132 transitions.
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:24] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 5 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 5 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 83 transition count 114
Applied a total of 36 rules in 5 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Graph (complete) has 295 edges and 101 vertex of which 97 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 97 transition count 122
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 83 transition count 114
Applied a total of 29 rules in 12 ms. Remains 83 /101 variables (removed 18) and now considering 114/132 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 83/101 places, 114/132 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 114 transitions.
Finished random walk after 292 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=73 )
FORMULA DiscoveryGPU-PT-11a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 132/132 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 125
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 89 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 87 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 87 transition count 118
Applied a total of 28 rules in 4 ms. Remains 87 /101 variables (removed 14) and now considering 118/132 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 87/101 places, 118/132 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 14:40:25] [INFO ] Input system was already deterministic with 118 transitions.
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 14:40:25] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-14 14:40:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 132 transitions and 429 arcs took 1 ms.
Total runtime 2349 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/463/ctl_0_ --ctl=/tmp/463/ctl_1_ --ctl=/tmp/463/ctl_2_ --ctl=/tmp/463/ctl_3_ --ctl=/tmp/463/ctl_4_ --ctl=/tmp/463/ctl_5_ --ctl=/tmp/463/ctl_6_ --ctl=/tmp/463/ctl_7_ --ctl=/tmp/463/ctl_8_ --ctl=/tmp/463/ctl_9_ --ctl=/tmp/463/ctl_10_ --ctl=/tmp/463/ctl_11_ --ctl=/tmp/463/ctl_12_ --ctl=/tmp/463/ctl_13_ --ctl=/tmp/463/ctl_14_ --mu-par --mu-opt
FORMULA DiscoveryGPU-PT-11a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DiscoveryGPU-PT-11a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678804851546
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-00
ctl formula formula --ctl=/tmp/463/ctl_0_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-01
ctl formula formula --ctl=/tmp/463/ctl_1_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-02
ctl formula formula --ctl=/tmp/463/ctl_2_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-03
ctl formula formula --ctl=/tmp/463/ctl_3_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-04
ctl formula formula --ctl=/tmp/463/ctl_4_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-05
ctl formula formula --ctl=/tmp/463/ctl_5_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-06
ctl formula formula --ctl=/tmp/463/ctl_6_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-07
ctl formula formula --ctl=/tmp/463/ctl_7_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-08
ctl formula formula --ctl=/tmp/463/ctl_8_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-09
ctl formula formula --ctl=/tmp/463/ctl_9_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-10
ctl formula formula --ctl=/tmp/463/ctl_10_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-11
ctl formula formula --ctl=/tmp/463/ctl_11_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-12
ctl formula formula --ctl=/tmp/463/ctl_12_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-13
ctl formula formula --ctl=/tmp/463/ctl_13_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-15
ctl formula formula --ctl=/tmp/463/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 101 places, 132 transitions and 429 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 132->95 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 101; there are 95 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 6518 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.150 real 0.570 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 207705078901 states, 3516 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/463/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/463/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_1_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/463/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/463/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_13_ holds for the initial state
pnml2lts-sym: Formula /tmp/463/ctl_4_ holds for the initial state
pnml2lts-sym: group_next: 1057 nodes total
pnml2lts-sym: group_explored: 781 nodes, 2533 short vectors total
pnml2lts-sym: max token count: 8
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-11a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-11a, 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 r137-smll-167819418200362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a 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 ;