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-171631132700474.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-13a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132700474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.3K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 13K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 02:42 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 46K 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-13a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-13a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717193071155

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:04:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:04:32] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-31 22:04:32] [INFO ] Transformed 133 places.
[2024-05-31 22:04:32] [INFO ] Transformed 183 transitions.
[2024-05-31 22:04:32] [INFO ] Found NUPN structural information;
[2024-05-31 22:04:32] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 21 place count 129 transition count 166
Applied a total of 21 rules in 32 ms. Remains 129 /133 variables (removed 4) and now considering 166/183 (removed 17) transitions.
// Phase 1: matrix 166 rows 129 cols
[2024-05-31 22:04:32] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:04:32] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-31 22:04:32] [INFO ] Invariant cache hit.
[2024-05-31 22:04:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-31 22:04:32] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-31 22:04:32] [INFO ] Invariant cache hit.
[2024-05-31 22:04:32] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/295 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 102/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 233 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/295 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 102/233 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 165/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 398 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 8451ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 8471ms
Starting structural reductions in LTL mode, iteration 1 : 129/133 places, 166/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8895 ms. Remains : 129/133 places, 166/183 transitions.
Support contains 71 out of 129 places after structural reductions.
[2024-05-31 22:04:41] [INFO ] Flatten gal took : 28 ms
[2024-05-31 22:04:41] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:04:41] [INFO ] Input system was already deterministic with 166 transitions.
Support contains 70 out of 129 places (down from 71) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (288 resets) in 1702 ms. (23 steps per ms) remains 2/68 properties
BEST_FIRST walk for 40004 steps (19 resets) in 199 ms. (200 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (21 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-05-31 22:04:42] [INFO ] Invariant cache hit.
[2024-05-31 22:04:42] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/25 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/35 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/39 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/44 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/44 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Real declared 72/295 variables, and 49 constraints, problems are : Problem set: 1 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 34/129 constraints, ReadFeed: 15/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 166 transitions.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 130 edges and 115 vertex of which 91 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Graph (trivial) has 102 edges and 91 vertex of which 50 / 91 are part of one of the 25 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 66 transition count 117
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 56 place count 53 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 67 place count 42 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 78 place count 42 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 31 transition count 48
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 31 transition count 48
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 20 transition count 26
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 20 transition count 26
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 133 place count 9 transition count 15
Iterating global reduction 2 with 11 rules applied. Total rules applied 144 place count 9 transition count 15
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 145 place count 9 transition count 14
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 146 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 6 transition count 11
Applied a total of 149 rules in 22 ms. Remains 6 /129 variables (removed 123) and now considering 11/166 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 6/129 places, 11/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 1 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 0 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 222 steps (5 resets) in 4 ms. (44 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 114 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 114 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 108 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 108 transition count 145
Applied a total of 42 rules in 12 ms. Remains 108 /129 variables (removed 21) and now considering 145/166 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 108/129 places, 145/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 155
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 109 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 109 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 100 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 100 transition count 137
Applied a total of 58 rules in 13 ms. Remains 100 /129 variables (removed 29) and now considering 137/166 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 100/129 places, 137/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 106 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 106 transition count 143
Applied a total of 46 rules in 8 ms. Remains 106 /129 variables (removed 23) and now considering 143/166 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 106/129 places, 143/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 118 transition count 144
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 107 transition count 144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 35 place count 95 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 47 place count 95 transition count 132
Applied a total of 47 rules in 15 ms. Remains 95 /129 variables (removed 34) and now considering 132/166 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 95/129 places, 132/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 725 steps (3 resets) in 10 ms. (65 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 105 transition count 142
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 105 transition count 142
Applied a total of 48 rules in 5 ms. Remains 105 /129 variables (removed 24) and now considering 142/166 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 105/129 places, 142/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 118 transition count 145
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 108 transition count 145
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 33 place count 96 transition count 133
Iterating global reduction 0 with 12 rules applied. Total rules applied 45 place count 96 transition count 133
Applied a total of 45 rules in 10 ms. Remains 96 /129 variables (removed 33) and now considering 133/166 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 96/129 places, 133/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 107 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 107 transition count 144
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 97 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 97 transition count 134
Applied a total of 64 rules in 7 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 97/129 places, 134/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 118 transition count 144
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 107 transition count 144
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 35 place count 95 transition count 132
Iterating global reduction 0 with 12 rules applied. Total rules applied 47 place count 95 transition count 132
Applied a total of 47 rules in 10 ms. Remains 95 /129 variables (removed 34) and now considering 132/166 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 95/129 places, 132/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 3445 steps (25 resets) in 37 ms. (90 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 145
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 99 transition count 136
Applied a total of 60 rules in 5 ms. Remains 99 /129 variables (removed 30) and now considering 136/166 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/129 places, 136/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 112 transition count 149
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 104 transition count 141
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 104 transition count 141
Applied a total of 50 rules in 4 ms. Remains 104 /129 variables (removed 25) and now considering 141/166 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 104/129 places, 141/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 108 transition count 145
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 99 transition count 136
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 99 transition count 136
Applied a total of 60 rules in 4 ms. Remains 99 /129 variables (removed 30) and now considering 136/166 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/129 places, 136/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 117 transition count 154
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 117 transition count 154
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 107 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 107 transition count 144
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 97 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 97 transition count 134
Applied a total of 64 rules in 3 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/129 places, 134/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Graph (complete) has 362 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 118 transition count 145
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 108 transition count 145
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 32 place count 97 transition count 134
Iterating global reduction 0 with 11 rules applied. Total rules applied 43 place count 97 transition count 134
Applied a total of 43 rules in 10 ms. Remains 97 /129 variables (removed 32) and now considering 134/166 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 97/129 places, 134/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 736 steps (2 resets) in 12 ms. (56 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 166/166 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 155
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 109 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 109 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 100 transition count 137
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 100 transition count 137
Applied a total of 58 rules in 4 ms. Remains 100 /129 variables (removed 29) and now considering 137/166 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/129 places, 137/166 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:04:42] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:04:42] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:04:42] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 22:04:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 166 transitions and 526 arcs took 2 ms.
Total runtime 10674 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-13a-CTLFireability-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-13a-CTLFireability-2023-15

BK_STOP 1717193083286

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/509/ctl_0_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/509/ctl_1_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/509/ctl_2_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/509/ctl_3_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/509/ctl_4_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/509/ctl_5_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/509/ctl_6_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/509/ctl_7_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/509/ctl_8_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/509/ctl_9_
ctl formula name DiscoveryGPU-PT-13a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/509/ctl_10_
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-13a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-13a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132700474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;