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.r549-tall-171734897700066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CO4-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897700066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 152K Jun 2 16:33 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 CO4-PT-09-CTLFireability-2024-00
FORMULA_NAME CO4-PT-09-CTLFireability-2024-01
FORMULA_NAME CO4-PT-09-CTLFireability-2024-02
FORMULA_NAME CO4-PT-09-CTLFireability-2024-03
FORMULA_NAME CO4-PT-09-CTLFireability-2024-04
FORMULA_NAME CO4-PT-09-CTLFireability-2024-05
FORMULA_NAME CO4-PT-09-CTLFireability-2024-06
FORMULA_NAME CO4-PT-09-CTLFireability-2024-07
FORMULA_NAME CO4-PT-09-CTLFireability-2024-08
FORMULA_NAME CO4-PT-09-CTLFireability-2024-09
FORMULA_NAME CO4-PT-09-CTLFireability-2024-10
FORMULA_NAME CO4-PT-09-CTLFireability-2024-11
FORMULA_NAME CO4-PT-09-CTLFireability-2024-12
FORMULA_NAME CO4-PT-09-CTLFireability-2024-13
FORMULA_NAME CO4-PT-09-CTLFireability-2024-14
FORMULA_NAME CO4-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352621129

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:23:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:23:42] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 18:23:42] [INFO ] Transformed 467 places.
[2024-06-02 18:23:42] [INFO ] Transformed 634 transitions.
[2024-06-02 18:23:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:23:42] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 108 places in 14 ms
Reduce places removed 108 places and 163 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 469
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 91 place count 270 transition count 391
Iterating global reduction 1 with 76 rules applied. Total rules applied 167 place count 270 transition count 391
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 171 place count 270 transition count 387
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 202 place count 239 transition count 346
Iterating global reduction 2 with 31 rules applied. Total rules applied 233 place count 239 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 239 transition count 345
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 234 transition count 338
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 234 transition count 338
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 246 place count 232 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 232 transition count 336
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 249 place count 231 transition count 335
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 231 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 231 transition count 334
Applied a total of 251 rules in 92 ms. Remains 231 /359 variables (removed 128) and now considering 334/471 (removed 137) transitions.
// Phase 1: matrix 334 rows 231 cols
[2024-06-02 18:23:42] [INFO ] Computed 6 invariants in 23 ms
[2024-06-02 18:23:43] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-02 18:23:43] [INFO ] Invariant cache hit.
[2024-06-02 18:23:43] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-02 18:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-02 18:23:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 13 ms to minimize.
[2024-06-02 18:23:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:23:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:23:46] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:23:46] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:23:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
Problem TDEAD268 is UNSAT
[2024-06-02 18:23:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
[2024-06-02 18:23:47] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 8/14 constraints. Problems are: Problem set: 10 solved, 323 unsolved
[2024-06-02 18:23:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:48] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:23:48] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 3/17 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 334/565 variables, 231/248 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 323 unsolved
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/565 variables, 1/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 249 constraints, problems are : Problem set: 10 solved, 323 unsolved in 22516 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 10 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 12/18 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 334/565 variables, 231/249 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 323/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/565 variables, 0/572 constraints. Problems are: Problem set: 10 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 572 constraints, problems are : Problem set: 10 solved, 323 unsolved in 16983 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 323/333 constraints, Known Traps: 12/12 constraints]
After SMT, in 39746ms problems are : Problem set: 10 solved, 323 unsolved
Search for dead transitions found 10 dead transitions in 39784ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 231/359 places, 324/471 transitions.
Applied a total of 0 rules in 3 ms. Remains 231 /231 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40362 ms. Remains : 231/359 places, 324/471 transitions.
Support contains 49 out of 231 places after structural reductions.
[2024-06-02 18:24:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:24:23] [INFO ] Flatten gal took : 90 ms
FORMULA CO4-PT-09-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:24:23] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:24:23] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 48 out of 231 places (down from 49) after GAL structural reductions.
FORMULA CO4-PT-09-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (174 resets) in 1498 ms. (26 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4003 steps (30 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (23 resets) in 31 ms. (125 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4002 steps (32 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (25 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (24 resets) in 14 ms. (266 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
// Phase 1: matrix 324 rows 231 cols
[2024-06-02 18:24:24] [INFO ] Computed 6 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 16/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 11/52 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 138/190 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 210/400 variables, 85/143 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 133/533 variables, 79/222 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 17/550 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (OVERLAPS) 5/555 variables, 3/237 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Problem AtomicPropp16 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 3/240 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/555 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/555 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/555 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 241 constraints, problems are : Problem set: 3 solved, 13 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 18/39 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 11/50 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 134/184 variables, 50/60 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 3/63 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 212/396 variables, 85/148 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 10/158 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 136/532 variables, 80/238 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 0/238 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 18/550 variables, 13/251 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 5/555 variables, 3/254 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/555 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 0/555 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 254 constraints, problems are : Problem set: 3 solved, 13 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 4/4 constraints]
After SMT, in 2440ms problems are : Problem set: 3 solved, 13 unsolved
Finished Parikh walk after 2419 steps, including 60 resets, run visited all 2 properties in 8 ms. (steps per millisecond=302 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 1057 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:24:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-09-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:24:27] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 39 out of 231 places (down from 42) after GAL structural reductions.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 534 edges and 231 vertex of which 228 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 214 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 214 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 210 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 210 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 210 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 207 transition count 291
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 207 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 207 transition count 289
Applied a total of 52 rules in 11 ms. Remains 207 /231 variables (removed 24) and now considering 289/324 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 207/231 places, 289/324 transitions.
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:24:27] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Graph (trivial) has 237 edges and 231 vertex of which 2 / 231 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 533 edges and 230 vertex of which 227 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 226 transition count 239
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 146 transition count 237
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 164 place count 146 transition count 217
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 204 place count 126 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 121 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 121 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 121 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 215 place count 121 transition count 207
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 217 place count 120 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 218 place count 119 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 119 transition count 205
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 251 place count 103 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 8 rules applied. Total rules applied 259 place count 103 transition count 179
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 267 place count 100 transition count 174
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 5 with 5 rules applied. Total rules applied 272 place count 98 transition count 171
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 6 with 3 rules applied. Total rules applied 275 place count 97 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 277 place count 96 transition count 168
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 279 place count 94 transition count 164
Iterating global reduction 8 with 2 rules applied. Total rules applied 281 place count 94 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 283 place count 93 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 289 place count 93 transition count 157
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 8 with 1 rules applied. Total rules applied 290 place count 93 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 291 place count 92 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 291 place count 92 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 293 place count 91 transition count 155
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 10 with 2 rules applied. Total rules applied 295 place count 90 transition count 154
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 297 place count 88 transition count 152
Applied a total of 297 rules in 75 ms. Remains 88 /231 variables (removed 143) and now considering 152/324 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 88/231 places, 152/324 transitions.
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:24:27] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 214 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 214 transition count 301
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 211 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 211 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 211 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 209 transition count 294
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 209 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 209 transition count 293
Applied a total of 47 rules in 17 ms. Remains 209 /231 variables (removed 22) and now considering 293/324 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 209/231 places, 293/324 transitions.
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:24:27] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:24:27] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 223 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 223 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 219 transition count 308
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 219 transition count 308
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 217 transition count 306
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 217 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 217 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 216 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 216 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 216 transition count 303
Applied a total of 32 rules in 16 ms. Remains 216 /231 variables (removed 15) and now considering 303/324 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 216/231 places, 303/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 310
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 309
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 213 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 213 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 209 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 209 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 209 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 206 transition count 291
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 206 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 206 transition count 289
Applied a total of 54 rules in 16 ms. Remains 206 /231 variables (removed 25) and now considering 289/324 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 206/231 places, 289/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 15 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 205/231 places, 287/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 15 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 205/231 places, 287/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 15 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 205/231 places, 287/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 308
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 218 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 212 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 212 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 208 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 208 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 208 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 205 transition count 289
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 205 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 205 transition count 287
Applied a total of 56 rules in 16 ms. Remains 205 /231 variables (removed 26) and now considering 287/324 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 205/231 places, 287/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 219 transition count 309
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 219 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 219 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 213 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 213 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 209 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 209 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 209 transition count 293
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 206 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 206 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 206 transition count 288
Applied a total of 54 rules in 14 ms. Remains 206 /231 variables (removed 25) and now considering 288/324 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 206/231 places, 288/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 324/324 transitions.
Graph (trivial) has 232 edges and 231 vertex of which 2 / 231 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 533 edges and 230 vertex of which 227 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 226 transition count 242
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 149 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 147 transition count 238
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 162 place count 147 transition count 219
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 200 place count 128 transition count 219
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 206 place count 122 transition count 209
Iterating global reduction 3 with 6 rules applied. Total rules applied 212 place count 122 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 122 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 213 place count 122 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 121 transition count 207
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 120 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 120 transition count 205
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 249 place count 104 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 256 place count 104 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 5 with 5 rules applied. Total rules applied 261 place count 102 transition count 177
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 263 place count 101 transition count 176
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 99 transition count 172
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 99 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 271 place count 97 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 7 with 3 rules applied. Total rules applied 274 place count 97 transition count 167
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 8 with 3 rules applied. Total rules applied 277 place count 96 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 278 place count 95 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 284 place count 95 transition count 159
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 10 with 1 rules applied. Total rules applied 285 place count 95 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 286 place count 94 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 286 place count 94 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 288 place count 93 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 290 place count 92 transition count 156
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 294 place count 92 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 296 place count 90 transition count 154
Applied a total of 296 rules in 57 ms. Remains 90 /231 variables (removed 141) and now considering 154/324 (removed 170) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 90/231 places, 154/324 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:24:28] [INFO ] Input system was already deterministic with 154 transitions.
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:28] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-02 18:24:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 324 transitions and 934 arcs took 3 ms.
Total runtime 46207 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CO4-PT-09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 231
TRANSITIONS: 324
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 653
MODEL NAME: /home/mcc/execution/411/model
231 places, 324 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CO4-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-09-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA CO4-PT-09-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA CO4-PT-09-CTLFireability-2024-12 CANNOT_COMPUTE
FORMULA CO4-PT-09-CTLFireability-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717353948324

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="CO4-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CO4-PT-09, 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 r549-tall-171734897700066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-09.tgz
mv CO4-PT-09 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 ;