Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132900538.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DoubleExponent-PT-003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900538
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:14:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:14:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:14:29] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-31 22:14:29] [INFO ] Transformed 163 places.
[2024-05-31 22:14:29] [INFO ] Transformed 148 transitions.
[2024-05-31 22:14:29] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 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-31 22:14:29] [INFO ] Computed 16 invariants in 24 ms
[2024-05-31 22:14:29] [INFO ] Implicit Places using invariants in 268 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 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 347 ms. Remains : 158/163 places, 148/148 transitions.
Support contains 89 out of 158 places after structural reductions.
[2024-05-31 22:14:30] [INFO ] Flatten gal took : 34 ms
[2024-05-31 22:14:30] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:14:30] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1314 resets) in 1846 ms. (21 steps per ms) remains 42/56 properties
BEST_FIRST walk for 4001 steps (120 resets) in 150 ms. (26 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (115 resets) in 54 ms. (72 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (112 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (112 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (110 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (113 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (118 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (106 resets) in 49 ms. (80 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (118 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (110 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (110 resets) in 33 ms. (117 steps per ms) remains 36/42 properties
BEST_FIRST walk for 4001 steps (106 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (108 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (110 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (114 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (110 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (112 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (112 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (112 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (107 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (115 resets) in 53 ms. (74 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (115 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (105 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (109 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (113 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (114 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (115 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (120 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (115 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (108 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (109 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (148 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (110 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (110 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (107 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
// Phase 1: matrix 148 rows 158 cols
[2024-05-31 22:14:31] [INFO ] Computed 15 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 11/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 59/135 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 1/136 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 140/276 variables, 136/151 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 25/301 variables, 19/170 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 4/305 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 36 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, 27 unsolved
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 1/174 constraints. Problems are: Problem set: 9 solved, 27 unsolved
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 3 ms to minimize.
[2024-05-31 22:14:33] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 2/176 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/176 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 17 (OVERLAPS) 0/306 variables, 0/176 constraints. Problems are: Problem set: 9 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 176 constraints, problems are : Problem set: 9 solved, 27 unsolved in 3047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 14/58 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 75/133 variables, 12/14 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/14 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/15 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 138/272 variables, 134/149 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 16/165 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/165 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 27/299 variables, 20/185 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 11/196 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/198 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/198 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 4/303 variables, 2/200 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 0/200 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 3/306 variables, 2/202 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 1/203 constraints. Problems are: Problem set: 9 solved, 27 unsolved
[2024-05-31 22:14:36] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 1/204 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 0/204 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 0/306 variables, 0/204 constraints. Problems are: Problem set: 9 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 204 constraints, problems are : Problem set: 9 solved, 27 unsolved in 3800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 27/36 constraints, Known Traps: 4/4 constraints]
After SMT, in 6901ms problems are : Problem set: 9 solved, 27 unsolved
Fused 27 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 7115 ms.
Support contains 44 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 157 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 156 transition count 135
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 144 transition count 129
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 138 transition count 129
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 39 place count 138 transition count 122
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 53 place count 131 transition count 122
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 85 place count 115 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 91 place count 112 transition count 106
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 112 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 111 transition count 105
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 100 place count 111 transition count 98
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 107 place count 104 transition count 98
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 111 place count 104 transition count 98
Applied a total of 111 rules in 49 ms. Remains 104 /158 variables (removed 54) and now considering 98/148 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 104/158 places, 98/148 transitions.
RANDOM walk for 40000 steps (3779 resets) in 538 ms. (74 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4001 steps (267 resets) in 28 ms. (137 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (273 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (274 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (260 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (266 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (272 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (290 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (279 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (273 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (280 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (259 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (268 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (265 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (266 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (263 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (280 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (272 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (279 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (273 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (273 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (275 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
// Phase 1: matrix 98 rows 104 cols
[2024-05-31 22:14:45] [INFO ] Computed 14 invariants in 4 ms
[2024-05-31 22:14:45] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 52/90 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 98/189 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 13/202 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 122 constraints, problems are : Problem set: 0 solved, 21 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 104/104 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 3/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 3/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 52/90 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 98/189 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 13/202 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 10/143 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 22:14:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:14:47] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:14:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:14:47] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 0/202 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 147 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 104/104 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 1802ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 2277 ms.
Support contains 32 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Graph (complete) has 229 edges and 104 vertex of which 103 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 102 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 101 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 101 transition count 94
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 100 transition count 94
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 18 place count 95 transition count 89
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 95 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 93 transition count 87
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 25 place count 93 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 92 transition count 86
Applied a total of 26 rules in 30 ms. Remains 92 /104 variables (removed 12) and now considering 86/98 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 92/104 places, 86/98 transitions.
RANDOM walk for 40000 steps (4383 resets) in 341 ms. (116 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (297 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (298 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (292 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (284 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (306 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (300 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (300 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (313 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (303 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (299 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (301 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (313 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (316 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (288 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (301 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (299 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (306 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (303 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (290 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (315 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (302 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
Finished probabilistic random walk after 136679 steps, run visited all 21 properties in 1290 ms. (steps per millisecond=105 )
Probabilistic random walk after 136679 steps, saw 68381 distinct states, run finished after 1294 ms. (steps per millisecond=105 ) properties seen :21
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-31 22:14:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 10 ms
FORMULA DoubleExponent-PT-003-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:14:51] [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.2 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 32 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 32 ms. Remains : 92/158 places, 82/148 transitions.
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:51] [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 1 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 19 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 19 ms. Remains : 90/158 places, 80/148 transitions.
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:51] [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-31 22:14:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:51] [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 23 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 23 ms. Remains : 94/158 places, 84/148 transitions.
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:14:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:51] [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 21 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 21 ms. Remains : 105/158 places, 95/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 20 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [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 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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [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-31 22:14:52] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:14:52] [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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:14:52] [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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:14:52] [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 12 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 12 ms. Remains : 90/158 places, 80/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:14:52] [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 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 2 ms. Remains : 158/158 places, 148/148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:14:52] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 22:14:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 148 transitions and 410 arcs took 1 ms.
Total runtime 23073 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-00
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-01
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-03
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-04
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-05
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-06
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-07
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-08
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-09
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-10
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2024-11
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2023-13
Could not compute solution for formula : DoubleExponent-PT-003-CTLFireability-2023-15

BK_STOP 1717193692728

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/538/ctl_0_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/538/ctl_1_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/538/ctl_2_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/538/ctl_3_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/538/ctl_4_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/538/ctl_5_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/538/ctl_6_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/538/ctl_7_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/538/ctl_8_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/538/ctl_9_
ctl formula name DoubleExponent-PT-003-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/538/ctl_10_
ctl formula name DoubleExponent-PT-003-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/538/ctl_11_
ctl formula name DoubleExponent-PT-003-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/538/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r488-tall-171631132900538"
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 ;