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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 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 50K 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-003-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-003-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716375615110

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:00:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:00:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:00:16] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-22 11:00:16] [INFO ] Transformed 163 places.
[2024-05-22 11:00:16] [INFO ] Transformed 148 transitions.
[2024-05-22 11:00:16] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 89 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 28 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2024-05-22 11:00:16] [INFO ] Computed 16 invariants in 21 ms
[2024-05-22 11:00:16] [INFO ] Implicit Places using invariants in 219 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/163 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 158/163 places, 148/148 transitions.
Support contains 89 out of 158 places after structural reductions.
[2024-05-22 11:00:16] [INFO ] Flatten gal took : 37 ms
[2024-05-22 11:00:17] [INFO ] Flatten gal took : 18 ms
[2024-05-22 11:00:17] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1347 resets) in 2284 ms. (17 steps per ms) remains 42/56 properties
BEST_FIRST walk for 4000 steps (118 resets) in 56 ms. (70 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (115 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 84 ms. (47 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (109 resets) in 90 ms. (43 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (106 resets) in 80 ms. (49 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (120 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (105 resets) in 45 ms. (87 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (107 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (106 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (109 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (110 resets) in 53 ms. (74 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (111 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 24 ms. (160 steps per ms) remains 36/42 properties
BEST_FIRST walk for 4001 steps (115 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (113 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (110 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (111 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (109 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (112 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (108 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (110 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (108 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (109 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (116 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (113 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (111 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (107 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (120 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (115 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (116 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (118 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (148 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (111 resets) in 23 ms. (166 steps per ms) remains 31/36 properties
BEST_FIRST walk for 4000 steps (110 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:00:18] [INFO ] Computed 15 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 13/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 64/135 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 140/276 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 25/301 variables, 19/170 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 4/305 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 13 (OVERLAPS) 1/306 variables, 1/173 constraints. Problems are: Problem set: 9 solved, 22 unsolved
[2024-05-22 11:00:20] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 1/174 constraints. Problems are: Problem set: 9 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/174 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 0/306 variables, 0/174 constraints. Problems are: Problem set: 9 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 174 constraints, problems are : Problem set: 9 solved, 22 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 9/42 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 7/49 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 84/133 variables, 12/14 constraints. Problems are: Problem set: 9 solved, 22 unsolved
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/15 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/16 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 138/272 variables, 134/150 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 14/164 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/164 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 27/299 variables, 20/184 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 8/192 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 1/193 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/193 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 4/303 variables, 2/195 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/195 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 3/306 variables, 2/197 constraints. Problems are: Problem set: 9 solved, 22 unsolved
[2024-05-22 11:00:22] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 1/198 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 0/198 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 0/306 variables, 0/198 constraints. Problems are: Problem set: 9 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 198 constraints, problems are : Problem set: 9 solved, 22 unsolved in 2723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 22/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 5230ms problems are : Problem set: 9 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 1718 ms.
Support contains 33 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 148/148 transitions.
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 155 transition count 129
Reduce places removed 17 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 138 transition count 124
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 133 transition count 124
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 48 place count 133 transition count 116
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 64 place count 125 transition count 116
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 104 place count 105 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 102 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 102 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 101 transition count 95
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 101 transition count 87
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 128 place count 93 transition count 87
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 93 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 92 transition count 86
Applied a total of 135 rules in 43 ms. Remains 92 /158 variables (removed 66) and now considering 86/148 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 92/158 places, 86/148 transitions.
RANDOM walk for 40000 steps (4180 resets) in 855 ms. (46 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4001 steps (295 resets) in 22 ms. (173 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (293 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (298 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (303 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (277 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (278 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (297 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (289 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (285 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (302 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (286 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (301 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (284 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (290 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (299 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (274 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (286 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (287 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (272 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
// Phase 1: matrix 86 rows 92 cols
[2024-05-22 11:00:25] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 11:00:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 49/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 15/89 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 86/175 variables, 89/113 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 3/178 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 120 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 92/92 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 49/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 15/89 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:27] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:00:27] [INFO ] Deduced a trap composed of 46 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 86/175 variables, 89/115 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 17/135 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:27] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-22 11:00:27] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:00:27] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:28] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 3/178 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/178 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/178 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:28] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/178 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-22 11:00:28] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/178 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/178 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/178 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 147 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 92/92 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 19/19 constraints]
After SMT, in 2931ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1230 ms.
Support contains 25 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 86/86 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 91 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 87 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 87 transition count 81
Applied a total of 13 rules in 12 ms. Remains 87 /92 variables (removed 5) and now considering 81/86 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 87/92 places, 81/86 transitions.
RANDOM walk for 40000 steps (4465 resets) in 270 ms. (147 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (300 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (314 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (298 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (316 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (308 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (304 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (325 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (312 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (312 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (315 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (325 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (283 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (311 resets) in 18 ms. (210 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (313 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (307 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (314 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (304 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (306 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 116236 steps, run visited all 18 properties in 751 ms. (steps per millisecond=154 )
Probabilistic random walk after 116236 steps, saw 58160 distinct states, run finished after 756 ms. (steps per millisecond=153 ) properties seen :18
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-003-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:00:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 11 ms
FORMULA DoubleExponent-PT-003-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 64 out of 158 places (down from 67) after GAL structural reductions.
FORMULA DoubleExponent-PT-003-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 109
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 119 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 113 transition count 103
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 128 place count 93 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 92 transition count 82
Applied a total of 129 rules in 19 ms. Remains 92 /158 variables (removed 66) and now considering 82/148 (removed 66) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 92/158 places, 82/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 121 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 74 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 130 place count 92 transition count 82
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 92 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 91 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 91 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 90 transition count 80
Applied a total of 135 rules in 27 ms. Remains 90 /158 variables (removed 68) and now considering 80/148 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 90/158 places, 80/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 157 transition count 113
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 123 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 121 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 72 place count 121 transition count 105
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 115 transition count 105
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 124 place count 95 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 95 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 94 transition count 84
Applied a total of 126 rules in 21 ms. Remains 94 /158 variables (removed 64) and now considering 84/148 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 94/158 places, 84/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 158 transition count 120
Reduce places removed 28 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 32 rules applied. Total rules applied 60 place count 130 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 126 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 64 place count 126 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 74 place count 121 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
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 106 place count 105 transition count 95
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 105 transition count 95
Applied a total of 109 rules in 27 ms. Remains 105 /158 variables (removed 53) and now considering 95/148 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 105/158 places, 95/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 109
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 119 transition count 103
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 113 transition count 103
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 132 place count 91 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 90 transition count 80
Applied a total of 133 rules in 15 ms. Remains 90 /158 variables (removed 68) and now considering 80/148 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 90/158 places, 80/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-22 11:00:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 148 transitions and 410 arcs took 3 ms.
Total runtime 15638 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-003

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: 158
TRANSITIONS: 148
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


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: 611
MODEL NAME: /home/mcc/execution/412/model
158 places, 148 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
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.
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..
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 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2107 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 1 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375686513

--------------------
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

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-003"
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 DoubleExponent-PT-003, 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 r135-tall-171631131300538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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