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.r135-tall-171631131300529.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 DoubleExponent-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 33K 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 DoubleExponent-PT-002-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716375329073

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 10:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:55:30] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-22 10:55:30] [INFO ] Transformed 110 places.
[2024-05-22 10:55:30] [INFO ] Transformed 98 transitions.
[2024-05-22 10:55:30] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 75 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 30 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 108 cols
[2024-05-22 10:55:30] [INFO ] Computed 12 invariants in 18 ms
[2024-05-22 10:55:30] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-22 10:55:30] [INFO ] Invariant cache hit.
[2024-05-22 10:55:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 10:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 10:55:31] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 15 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2024-05-22 10:55:32] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 10:55:33] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:55:33] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:55:33] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 2 ms to minimize.
[2024-05-22 10:55:33] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:55:34] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/205 variables, 107/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 10:55:35] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:55:35] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:55:35] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 138 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/107 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 98/205 variables, 107/137 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 10:55:40] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 236 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7223 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 19/19 constraints]
After SMT, in 13182ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 13206ms
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13650 ms. Remains : 108/110 places, 98/98 transitions.
Support contains 75 out of 108 places after structural reductions.
[2024-05-22 10:55:44] [INFO ] Flatten gal took : 30 ms
[2024-05-22 10:55:44] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:55:44] [INFO ] Input system was already deterministic with 98 transitions.
RANDOM walk for 40000 steps (1321 resets) in 1550 ms. (25 steps per ms) remains 39/68 properties
BEST_FIRST walk for 4000 steps (112 resets) in 60 ms. (65 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (109 resets) in 59 ms. (66 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (119 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 59 ms. (66 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (114 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (106 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (114 resets) in 33 ms. (117 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (116 resets) in 45 ms. (86 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (115 resets) in 40 ms. (97 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (108 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (140 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (116 resets) in 22 ms. (173 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (113 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (115 resets) in 28 ms. (137 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (120 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (113 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (110 resets) in 39 ms. (100 steps per ms) remains 18/39 properties
BEST_FIRST walk for 4000 steps (120 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (112 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (104 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (112 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (114 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (105 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
[2024-05-22 10:55:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 1 (OVERLAPS) 78/99 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 10 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 8 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 4 (OVERLAPS) 8/107 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 7 unsolved
[2024-05-22 10:55:45] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2024-05-22 10:55:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 30 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 7/19 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 98/205 variables, 107/126 constraints. Problems are: Problem set: 11 solved, 7 unsolved
[2024-05-22 10:55:46] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/127 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/128 constraints. Problems are: Problem set: 11 solved, 7 unsolved
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 1/129 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 129 constraints, problems are : Problem set: 11 solved, 7 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 11 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 7 unsolved
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/92 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/96 variables, 2/5 constraints. Problems are: Problem set: 12 solved, 6 unsolved
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/6 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 7/13 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 9/22 constraints. Problems are: Problem set: 12 solved, 6 unsolved
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/23 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/23 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 98/205 variables, 107/130 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 6/136 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/206 variables, 1/137 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/206 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 137 constraints, problems are : Problem set: 12 solved, 6 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 6/18 constraints, Known Traps: 11/11 constraints]
After SMT, in 2735ms problems are : Problem set: 12 solved, 6 unsolved
Parikh walk visited 0 properties in 2001 ms.
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 107 transition count 79
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 88 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 86 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 86 transition count 74
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 83 transition count 74
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 87 place count 64 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 62 transition count 55
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 62 transition count 51
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 58 transition count 51
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 105 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 57 transition count 50
Applied a total of 106 rules in 57 ms. Remains 57 /108 variables (removed 51) and now considering 50/98 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 57/108 places, 50/98 transitions.
RANDOM walk for 40000 steps (5078 resets) in 581 ms. (68 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (3335 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3430 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3423 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3333 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3398 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
// Phase 1: matrix 50 rows 57 cols
[2024-05-22 10:55:50] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 10:55:50] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 10:55:50] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-22 10:55:51] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:55:51] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-22 10:55:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 50/103 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/107 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/107 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 76 constraints, problems are : Problem set: 0 solved, 5 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 10:55:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 4 ms to minimize.
[2024-05-22 10:55:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/53 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 50/103 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/107 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/107 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/107 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 83 constraints, problems are : Problem set: 0 solved, 5 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 50/50 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 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 49
Applied a total of 2 rules in 14 ms. Remains 56 /57 variables (removed 1) and now considering 49/50 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 56/57 places, 49/50 transitions.
RANDOM walk for 40000 steps (5156 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3425 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3372 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3389 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3384 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 2434 steps, run visited all 5 properties in 39 ms. (steps per millisecond=62 )
Probabilistic random walk after 2434 steps, saw 1246 distinct states, run finished after 42 ms. (steps per millisecond=57 ) properties seen :5
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 10:55:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 66 out of 108 places (down from 71) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 176 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 9 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 22 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 3 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 82 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 21 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 3 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 83 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 11 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 45 place count 83 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 79 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 64 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 63 transition count 55
Applied a total of 84 rules in 24 ms. Remains 63 /108 variables (removed 45) and now considering 55/98 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 63/108 places, 55/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 90 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 87 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 87 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 83 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 63 place count 74 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 73 transition count 65
Applied a total of 64 rules in 20 ms. Remains 73 /108 variables (removed 35) and now considering 65/98 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 73/108 places, 65/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Graph (complete) has 176 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 62 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 61 transition count 53
Applied a total of 90 rules in 17 ms. Remains 61 /108 variables (removed 47) and now considering 53/98 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 61/108 places, 53/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 98
Applied a total of 2 rules in 2 ms. Remains 106 /108 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 106/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 98/98 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 98
Applied a total of 1 rules in 2 ms. Remains 107 /108 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 107/108 places, 98/98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:52] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:52] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:55:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 10:55:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 98 transitions and 274 arcs took 2 ms.
Total runtime 22423 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-002

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 666
MODEL NAME: /home/mcc/execution/412/model
108 places, 98 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 574 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1 steps.
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-002-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375401070

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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="DoubleExponent-PT-002"
export BK_EXAMINATION="CTLCardinality"
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 DoubleExponent-PT-002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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