About the Execution of LTSMin+red for FlexibleBarrier-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
233.312 | 4852.00 | 8869.00 | 436.50 | FTFTTFFTTFTFTTTT | 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.r169-tall-167838855900441.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 FlexibleBarrier-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855900441
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 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 23K 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 FlexibleBarrier-PT-04a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678549855504
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 15:50:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 15:50:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:50:57] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-11 15:50:57] [INFO ] Transformed 51 places.
[2023-03-11 15:50:57] [INFO ] Transformed 88 transitions.
[2023-03-11 15:50:57] [INFO ] Found NUPN structural information;
[2023-03-11 15:50:57] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 12 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2023-03-11 15:50:57] [INFO ] Computed 6 place invariants in 16 ms
[2023-03-11 15:50:57] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 15:50:57] [INFO ] Invariant cache hit.
[2023-03-11 15:50:57] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-11 15:50:57] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-11 15:50:57] [INFO ] Invariant cache hit.
[2023-03-11 15:50:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 51/51 places, 74/78 transitions.
Support contains 47 out of 51 places after structural reductions.
[2023-03-11 15:50:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-11 15:50:57] [INFO ] Flatten gal took : 24 ms
[2023-03-11 15:50:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 15:50:57] [INFO ] Flatten gal took : 13 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Support contains 44 out of 51 places (down from 47) after GAL structural reductions.
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 39) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 15:50:58] [INFO ] Invariant cache hit.
[2023-03-11 15:50:58] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 5 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 37 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 42 transition count 64
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 15 place count 42 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 42 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 41 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 41 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 40 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 40 transition count 54
Applied a total of 20 rules in 21 ms. Remains 40 /51 variables (removed 11) and now considering 54/74 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 40/51 places, 54/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 34 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 47 edges and 42 vertex of which 23 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 64
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 38 place count 21 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 19 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 19 transition count 34
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 42 place count 18 transition count 34
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 3 with 2 rules applied. Total rules applied 44 place count 17 transition count 33
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 53 place count 17 transition count 24
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 17 transition count 22
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 58 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 14 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 59 place count 14 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 61 place count 13 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 62 place count 12 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 12 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 65 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 66 place count 11 transition count 17
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 69 place count 11 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 69 place count 11 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 73 place count 9 transition count 12
Applied a total of 73 rules in 7 ms. Remains 9 /51 variables (removed 42) and now considering 12/74 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 9/51 places, 12/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 1 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 0 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 30 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 47 edges and 44 vertex of which 22 / 44 are part of one of the 6 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 28 transition count 65
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (trivial) has 24 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 36 place count 23 transition count 41
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 21 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 20 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 20 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 20 transition count 36
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 45 place count 19 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 18 transition count 35
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 6 with 2 rules applied. Total rules applied 48 place count 17 transition count 34
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 59 place count 17 transition count 23
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 61 place count 17 transition count 21
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 64 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 65 place count 14 transition count 20
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 67 place count 12 transition count 17
Iterating global reduction 9 with 2 rules applied. Total rules applied 69 place count 12 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 71 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 72 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 73 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 74 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 75 place count 10 transition count 13
Applied a total of 75 rules in 8 ms. Remains 10 /51 variables (removed 41) and now considering 13/74 (removed 61) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 10/51 places, 13/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 0 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 1 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 24 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 0 with 4 rules applied. Total rules applied 5 place count 45 transition count 67
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 45 transition count 62
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 45 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 44 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 44 transition count 61
Applied a total of 15 rules in 9 ms. Remains 44 /51 variables (removed 7) and now considering 61/74 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 44/51 places, 61/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 39 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 54 edges and 40 vertex of which 35 / 40 are part of one of the 5 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 10 transition count 61
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 59 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 5 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 70 place count 2 transition count 3
Applied a total of 70 rules in 3 ms. Remains 2 /51 variables (removed 49) and now considering 3/74 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 2/51 places, 3/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 0 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 0 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 51/51 places, 74/74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Input system was already deterministic with 74 transitions.
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:50:58] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 101 ms.
[2023-03-11 15:50:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 51 places, 74 transitions and 237 arcs took 1 ms.
Total runtime 1624 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/467/ctl_0_ --ctl=/tmp/467/ctl_1_ --ctl=/tmp/467/ctl_2_ --ctl=/tmp/467/ctl_3_ --ctl=/tmp/467/ctl_4_ --ctl=/tmp/467/ctl_5_ --ctl=/tmp/467/ctl_6_ --ctl=/tmp/467/ctl_7_ --ctl=/tmp/467/ctl_8_ --ctl=/tmp/467/ctl_9_ --mu-par --mu-opt
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-04a-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678549860356
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-00
ctl formula formula --ctl=/tmp/467/ctl_0_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-01
ctl formula formula --ctl=/tmp/467/ctl_1_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-03
ctl formula formula --ctl=/tmp/467/ctl_2_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-05
ctl formula formula --ctl=/tmp/467/ctl_3_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-06
ctl formula formula --ctl=/tmp/467/ctl_4_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-09
ctl formula formula --ctl=/tmp/467/ctl_5_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-10
ctl formula formula --ctl=/tmp/467/ctl_6_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-11
ctl formula formula --ctl=/tmp/467/ctl_7_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-14
ctl formula formula --ctl=/tmp/467/ctl_8_
ctl formula name FlexibleBarrier-PT-04a-CTLCardinality-15
ctl formula formula --ctl=/tmp/467/ctl_9_
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 51 places, 74 transitions and 237 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: 74->63 groups
pnml2lts-sym: Regrouping took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 51; there are 63 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: Exploration took 590 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.030 real 0.080 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 20737 states, 255 nodes
pnml2lts-sym: Formula /tmp/467/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/467/ctl_2_ holds for the initial state
pnml2lts-sym: group_next: 530 nodes total
pnml2lts-sym: group_explored: 432 nodes, 269 short vectors total
pnml2lts-sym: max token count: 1
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="FlexibleBarrier-PT-04a"
export BK_EXAMINATION="CTLCardinality"
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 FlexibleBarrier-PT-04a, 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 r169-tall-167838855900441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04a.tgz
mv FlexibleBarrier-PT-04a 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 ;