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.r488-tall-171631132600425.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 ltsminxred
Input is DiscoveryGPU-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132600425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 02:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717192679165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:58:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:58:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:58:00] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-31 21:58:00] [INFO ] Transformed 103 places.
[2024-05-31 21:58:00] [INFO ] Transformed 141 transitions.
[2024-05-31 21:58:00] [INFO ] Found NUPN structural information;
[2024-05-31 21:58:00] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 69 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 100 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 100 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 16 place count 100 transition count 128
Applied a total of 16 rules in 32 ms. Remains 100 /103 variables (removed 3) and now considering 128/141 (removed 13) transitions.
// Phase 1: matrix 128 rows 100 cols
[2024-05-31 21:58:00] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:58:00] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-31 21:58:00] [INFO ] Invariant cache hit.
[2024-05-31 21:58:00] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-31 21:58:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [98, 99]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 438 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/103 places, 128/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 98/103 places, 128/141 transitions.
Support contains 69 out of 98 places after structural reductions.
[2024-05-31 21:58:01] [INFO ] Flatten gal took : 30 ms
[2024-05-31 21:58:01] [INFO ] Flatten gal took : 13 ms
[2024-05-31 21:58:01] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 63 out of 98 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (378 resets) in 1001 ms. (39 steps per ms) remains 2/52 properties
BEST_FIRST walk for 40003 steps (35 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
// Phase 1: matrix 128 rows 98 cols
[2024-05-31 21:58:01] [INFO ] Computed 0 invariants in 1 ms
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/33 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/46 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/60 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/86 variables, 14/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 32/118 variables, 11/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/136 variables, 10/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/148 variables, 6/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/166 variables, 6/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/166 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 18/184 variables, 6/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 12/196 variables, 6/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/196 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 12/208 variables, 6/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/208 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/220 variables, 6/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/220 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/226 variables, 3/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/226 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/226 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 98 constraints, problems are : Problem set: 1 solved, 1 unsolved in 237 ms.
Refiners :[State Equation: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/28 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/39 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/50 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp42 is UNSAT
After SMT solving in domain Int declared 74/226 variables, and 34 constraints, problems are : Problem set: 2 solved, 0 unsolved in 85 ms.
Refiners :[State Equation: 33/98 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 120 edges and 98 vertex of which 71 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 121
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 84 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 84 transition count 114
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 79 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 79 transition count 109
Applied a total of 38 rules in 10 ms. Remains 79 /98 variables (removed 19) and now considering 109/128 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 79/98 places, 109/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 82 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 82 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 77 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 77 transition count 107
Applied a total of 42 rules in 9 ms. Remains 77 /98 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 77/98 places, 107/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 103 edges and 98 vertex of which 38 / 98 are part of one of the 19 SCC in 2 ms
Free SCC test removed 19 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 101 edges and 79 vertex of which 55 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 54 transition count 74
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 44 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 37 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 37 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 31 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 31 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 25 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 25 transition count 36
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 19 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 19 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 19 transition count 28
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 14 transition count 23
Applied a total of 80 rules in 49 ms. Remains 14 /98 variables (removed 84) and now considering 23/128 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 14/98 places, 23/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 84 edges and 98 vertex of which 26 / 98 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 107 edges and 85 vertex of which 61 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 61 transition count 81
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 51 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 46 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 46 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 41 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 41 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 39 transition count 57
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 39 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 38 transition count 56
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 38 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 56 place count 34 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 34 transition count 51
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 2 with 2 rules applied. Total rules applied 59 place count 33 transition count 50
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 33 transition count 50
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 29 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 29 transition count 46
Applied a total of 71 rules in 20 ms. Remains 29 /98 variables (removed 69) and now considering 46/128 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 29/98 places, 46/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 82 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 82 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 77 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 77 transition count 107
Applied a total of 42 rules in 8 ms. Remains 77 /98 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/98 places, 107/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 119
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 80 transition count 110
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 80 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 74 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 74 transition count 104
Applied a total of 48 rules in 6 ms. Remains 74 /98 variables (removed 24) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 74/98 places, 104/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 103 edges and 98 vertex of which 38 / 98 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 101 edges and 79 vertex of which 56 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 56 transition count 75
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 24 place count 45 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 39 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 39 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 33 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 33 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 27 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 27 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 21 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 21 transition count 33
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 2 with 6 rules applied. Total rules applied 78 place count 18 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 18 transition count 29
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 18 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 17 transition count 28
Applied a total of 81 rules in 8 ms. Remains 17 /98 variables (removed 81) and now considering 28/128 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 17/98 places, 28/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 106 edges and 98 vertex of which 40 / 98 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 100 edges and 78 vertex of which 52 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 51 transition count 72
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 28 place count 34 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 34 transition count 56
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 27 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 27 transition count 42
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 20 transition count 28
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 20 transition count 28
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 13 transition count 21
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 13 transition count 19
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 9 transition count 15
Applied a total of 85 rules in 8 ms. Remains 9 /98 variables (removed 89) and now considering 15/128 (removed 113) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 9/98 places, 15/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 92 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 92 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 86 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 86 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 84 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 84 transition count 114
Applied a total of 28 rules in 5 ms. Remains 84 /98 variables (removed 14) and now considering 114/128 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 84/98 places, 114/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 81 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 81 transition count 111
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 75 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 75 transition count 105
Applied a total of 46 rules in 4 ms. Remains 75 /98 variables (removed 23) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/98 places, 105/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 89 transition count 119
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 89 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 81 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 81 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 77 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 77 transition count 107
Applied a total of 42 rules in 3 ms. Remains 77 /98 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 77/98 places, 107/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 108 edges and 98 vertex of which 40 / 98 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 100 edges and 78 vertex of which 51 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 51 transition count 71
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 41 transition count 71
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 32 transition count 53
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 32 transition count 53
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 49 place count 23 transition count 35
Iterating global reduction 2 with 9 rules applied. Total rules applied 58 place count 23 transition count 35
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 14 transition count 17
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 14 transition count 17
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 83 place count 7 transition count 10
Iterating global reduction 2 with 7 rules applied. Total rules applied 90 place count 7 transition count 10
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 2 with 2 rules applied. Total rules applied 92 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 6 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 5 transition count 7
Applied a total of 95 rules in 14 ms. Remains 5 /98 variables (removed 93) and now considering 7/128 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 5/98 places, 7/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Graph (trivial) has 102 edges and 98 vertex of which 36 / 98 are part of one of the 18 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 102 edges and 80 vertex of which 54 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 53 transition count 74
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 44 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 43 transition count 73
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 35 transition count 57
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 35 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 45 place count 28 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 52 place count 28 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 58 place count 22 transition count 31
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 16 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 16 transition count 25
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 77 place count 16 transition count 24
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 79 place count 15 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 11 transition count 19
Applied a total of 83 rules in 11 ms. Remains 11 /98 variables (removed 87) and now considering 19/128 (removed 109) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 11/98 places, 19/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 82 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 82 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 77 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 77 transition count 107
Applied a total of 42 rules in 15 ms. Remains 77 /98 variables (removed 21) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 77/98 places, 107/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 128/128 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 90 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 90 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 82 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 82 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 76 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 76 transition count 106
Applied a total of 44 rules in 23 ms. Remains 76 /98 variables (removed 22) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 76/98 places, 106/128 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:58:02] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:58:02] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:58:02] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2024-05-31 21:58:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 128 transitions and 248 arcs took 12 ms.
Total runtime 2510 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-00
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-04
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2023-14
Could not compute solution for formula : DiscoveryGPU-PT-10a-CTLCardinality-2023-15

BK_STOP 1717192683234

--------------------
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
mcc2024
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/498/ctl_0_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/498/ctl_1_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/498/ctl_2_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/498/ctl_3_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/498/ctl_4_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/498/ctl_5_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/498/ctl_6_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/498/ctl_7_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/498/ctl_8_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/498/ctl_9_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/498/ctl_10_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/498/ctl_11_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/498/ctl_12_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/498/ctl_13_
ctl formula name DiscoveryGPU-PT-10a-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/498/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-10a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-10a, 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 r488-tall-171631132600425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;