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.r091-tall-171624188200666.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 DES-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 43K 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 DES-PT-10a-CTLFireability-2024-00
FORMULA_NAME DES-PT-10a-CTLFireability-2024-01
FORMULA_NAME DES-PT-10a-CTLFireability-2024-02
FORMULA_NAME DES-PT-10a-CTLFireability-2024-03
FORMULA_NAME DES-PT-10a-CTLFireability-2024-04
FORMULA_NAME DES-PT-10a-CTLFireability-2024-05
FORMULA_NAME DES-PT-10a-CTLFireability-2024-06
FORMULA_NAME DES-PT-10a-CTLFireability-2024-07
FORMULA_NAME DES-PT-10a-CTLFireability-2024-08
FORMULA_NAME DES-PT-10a-CTLFireability-2024-09
FORMULA_NAME DES-PT-10a-CTLFireability-2024-10
FORMULA_NAME DES-PT-10a-CTLFireability-2024-11
FORMULA_NAME DES-PT-10a-CTLFireability-2023-12
FORMULA_NAME DES-PT-10a-CTLFireability-2023-13
FORMULA_NAME DES-PT-10a-CTLFireability-2023-14
FORMULA_NAME DES-PT-10a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716314832111

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 18:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:07:13] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-21 18:07:13] [INFO ] Transformed 155 places.
[2024-05-21 18:07:13] [INFO ] Transformed 112 transitions.
[2024-05-21 18:07:13] [INFO ] Found NUPN structural information;
[2024-05-21 18:07:13] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 121 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 20 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 154 cols
[2024-05-21 18:07:13] [INFO ] Computed 59 invariants in 17 ms
[2024-05-21 18:07:13] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 18:07:13] [INFO ] Invariant cache hit.
[2024-05-21 18:07:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:07:14] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 18:07:14] [INFO ] Invariant cache hit.
[2024-05-21 18:07:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:14] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/251 variables, 154/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:17] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:07:17] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/251 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 218 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4366 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/251 variables, 154/217 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 96/314 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:23] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:07:23] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 317 constraints, problems are : Problem set: 0 solved, 96 unsolved in 16908 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 21355ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 21376ms
Starting structural reductions in LTL mode, iteration 1 : 154/155 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21854 ms. Remains : 154/155 places, 97/98 transitions.
Support contains 121 out of 154 places after structural reductions.
[2024-05-21 18:07:35] [INFO ] Flatten gal took : 36 ms
[2024-05-21 18:07:35] [INFO ] Flatten gal took : 16 ms
[2024-05-21 18:07:35] [INFO ] Input system was already deterministic with 97 transitions.
Reduction of identical properties reduced properties to check from 84 to 82
RANDOM walk for 40000 steps (888 resets) in 1940 ms. (20 steps per ms) remains 27/82 properties
BEST_FIRST walk for 4004 steps (24 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (20 resets) in 92 ms. (43 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (18 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (17 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (24 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
[2024-05-21 18:07:36] [INFO ] Invariant cache hit.
[2024-05-21 18:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 49/105 variables, 33/34 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 40/145 variables, 24/59 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp73 is UNSAT
At refinement iteration 7 (OVERLAPS) 97/242 variables, 145/204 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 9/251 variables, 9/214 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 214 constraints, problems are : Problem set: 2 solved, 24 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/101 variables, 34/34 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/35 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 44/145 variables, 24/59 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-21 18:07:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/60 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-21 18:07:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 97/242 variables, 145/206 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 3/210 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 9/251 variables, 9/219 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 20/239 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-21 18:07:39] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:07:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 2/241 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-21 18:07:39] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 1/242 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/242 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 0/251 variables, 0/242 constraints. Problems are: Problem set: 3 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 242 constraints, problems are : Problem set: 3 solved, 23 unsolved in 4388 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/26 constraints, Known Traps: 5/5 constraints]
After SMT, in 5407ms problems are : Problem set: 3 solved, 23 unsolved
Parikh walk visited 1 properties in 3141 ms.
Support contains 46 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 97/97 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 154 transition count 96
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 154 transition count 96
Applied a total of 5 rules in 20 ms. Remains 154 /154 variables (removed 0) and now considering 96/97 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 154/154 places, 96/97 transitions.
RANDOM walk for 40000 steps (895 resets) in 621 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (31 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (27 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (23 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (29 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 575682 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 22
Probabilistic random walk after 575682 steps, saw 80852 distinct states, run finished after 3010 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 96 rows 154 cols
[2024-05-21 18:07:48] [INFO ] Computed 60 invariants in 11 ms
[2024-05-21 18:07:48] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 37/83 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 21/104 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 41/145 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 96/241 variables, 145/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:07:49] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 9/250 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:49] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:07:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:49] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/250 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 223 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 37/83 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 21/104 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 41/145 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 96/241 variables, 145/210 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 9/250 variables, 9/224 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:52] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
[2024-05-21 18:07:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 18:07:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/250 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 248 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4538 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 9/9 constraints]
After SMT, in 6530ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 1 properties in 2963 ms.
Support contains 45 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 14 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 154/154 places, 96/96 transitions.
RANDOM walk for 40000 steps (845 resets) in 237 ms. (168 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (11 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 555652 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 20
Probabilistic random walk after 555652 steps, saw 78383 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
[2024-05-21 18:08:01] [INFO ] Invariant cache hit.
[2024-05-21 18:08:01] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/102 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/144 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 96/240 variables, 144/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 10/250 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:02] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:08:02] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/250 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:02] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:08:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:02] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 0/250 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 222 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/102 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/144 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:03] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:03] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 96/240 variables, 144/210 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 10/250 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 18/243 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 0/250 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 244 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2806 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 4518ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2092 ms.
Support contains 44 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 154/154 places, 96/96 transitions.
RANDOM walk for 40000 steps (898 resets) in 237 ms. (168 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (21 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (31 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 644298 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :0 out of 20
Probabilistic random walk after 644298 steps, saw 89813 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
[2024-05-21 18:08:11] [INFO ] Invariant cache hit.
[2024-05-21 18:08:11] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/102 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/144 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 96/240 variables, 144/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 10/250 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:11] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-21 18:08:11] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/250 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-21 18:08:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 0/250 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 222 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/102 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/144 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 96/240 variables, 144/210 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 10/250 variables, 10/225 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 18/243 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 0/250 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 244 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 154/154 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 4526ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1938 ms.
Support contains 44 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 154/154 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 18:08:17] [INFO ] Invariant cache hit.
[2024-05-21 18:08:17] [INFO ] Implicit Places using invariants in 82 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 153/154 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 93 ms. Remains : 153/154 places, 96/96 transitions.
RANDOM walk for 40000 steps (886 resets) in 306 ms. (130 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (27 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 619763 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 20
Probabilistic random walk after 619763 steps, saw 86724 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 96 rows 153 cols
[2024-05-21 18:08:20] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 18:08:20] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 20/101 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/143 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 96/239 variables, 143/202 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 10/249 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:21] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 215 constraints, problems are : Problem set: 0 solved, 20 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 20/101 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 42/143 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:08:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 96/239 variables, 143/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 18:08:22] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:08:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:08:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 10/249 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 18/239 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/249 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 240 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3367 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 4373ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 1 properties in 2136 ms.
Support contains 31 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 153/153 places, 96/96 transitions.
RANDOM walk for 40000 steps (889 resets) in 466 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (26 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (17 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (29 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (28 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 578610 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 19
Probabilistic random walk after 578610 steps, saw 81251 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-21 18:08:30] [INFO ] Invariant cache hit.
[2024-05-21 18:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/58 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 42/100 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 43/143 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 96/239 variables, 143/202 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 10/249 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/249 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 18:08:31] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/249 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 218 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 27/58 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 42/100 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 43/143 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 96/239 variables, 143/205 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 18:08:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 10/249 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 17/240 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/249 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 241 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2762 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 4152ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2028 ms.
Support contains 31 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 96/96 transitions.
Applied a total of 0 rules in 11 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-21 18:08:36] [INFO ] Invariant cache hit.
[2024-05-21 18:08:36] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 18:08:36] [INFO ] Invariant cache hit.
[2024-05-21 18:08:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:08:37] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-21 18:08:37] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-21 18:08:37] [INFO ] Invariant cache hit.
[2024-05-21 18:08:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/249 variables, 153/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:08:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/249 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:08:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 222 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3986 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 96/249 variables, 153/221 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 95/318 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:43] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:08:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:08:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-21 18:08:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:08:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:08:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 0/249 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 325 constraints, problems are : Problem set: 0 solved, 95 unsolved in 21957 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 16/16 constraints]
After SMT, in 25982ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 25983ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26216 ms. Remains : 153/153 places, 96/96 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Running SMT prover for 19 properties.
[2024-05-21 18:09:03] [INFO ] Invariant cache hit.
[2024-05-21 18:09:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:09:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-21 18:09:03] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-21 18:09:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:09:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 18:09:03] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
TRAPS : Iteration 0
[2024-05-21 18:09:03] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-21 18:09:04] [INFO ] After 969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
[2024-05-21 18:09:04] [INFO ] After 1348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Over-approximation ignoring read arcs solved 0 properties in 1493 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-10a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Computed a total of 57 stabilizing places and 51 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
RANDOM walk for 444 steps (7 resets) in 7 ms. (55 steps per ms) remains 0/1 properties
FORMULA DES-PT-10a-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:05] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:09:05] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:09:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-21 18:09:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 97 transitions and 484 arcs took 3 ms.
Total runtime 111804 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-10a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/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: 818
MODEL NAME: /home/mcc/execution/408/model
154 places, 97 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-10a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-10a-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA DES-PT-10a-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716316843567

--------------------
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
Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10a"
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 DES-PT-10a, 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 r091-tall-171624188200666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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