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.r136-tall-171631131900097.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 itstools
Input is Dekker-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 247K 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 Dekker-PT-020-CTLCardinality-2024-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716336037113

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:00:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:00:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:00:38] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-22 00:00:38] [INFO ] Transformed 100 places.
[2024-05-22 00:00:38] [INFO ] Transformed 440 transitions.
[2024-05-22 00:00:38] [INFO ] Found NUPN structural information;
[2024-05-22 00:00:38] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-020-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:38] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-22 00:00:38] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 00:00:38] [INFO ] Implicit Places using invariants in 265 ms returned [40, 58, 67, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 299 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/100 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 96/100 places, 440/440 transitions.
Support contains 67 out of 96 places after structural reductions.
[2024-05-22 00:00:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 00:00:39] [INFO ] Flatten gal took : 74 ms
FORMULA Dekker-PT-020-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:00:39] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:00:39] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 59 out of 96 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (8 resets) in 1884 ms. (21 steps per ms) remains 9/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
[2024-05-22 00:00:40] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2024-05-22 00:00:40] [INFO ] Computed 56 invariants in 6 ms
[2024-05-22 00:00:40] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 35/50 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 35/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/53 variables, 3/77 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 3/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 10/63 variables, 10/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 10/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 52/115 variables, 63/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 14/129 variables, 20/183 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 40/169 variables, 26/209 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 26/235 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/169 variables, 2/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 7/176 variables, 12/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/176 variables, 7/256 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 5/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 7/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/176 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 268 constraints, problems are : Problem set: 1 solved, 6 unsolved in 289 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/41 variables, 19/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 29/60 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 10 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 16/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/44 variables, 3/79 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 5/87 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/53 variables, 9/96 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 9/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 44/97 variables, 53/158 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 18/115 variables, 20/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/115 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 52/167 variables, 34/212 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 34/246 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 2/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 6/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:00:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 9/263 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/167 variables, 0/263 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 9/176 variables, 16/279 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 9/288 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 7/295 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/176 variables, 9/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/176 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/176 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 304 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1306 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 30/30 constraints]
After SMT, in 1643ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 480 ms.
Support contains 8 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 29 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 96/96 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 486927 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 3
Probabilistic random walk after 486927 steps, saw 257150 distinct states, run finished after 3015 ms. (steps per millisecond=161 ) properties seen :0
[2024-05-22 00:00:45] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:45] [INFO ] Invariant cache hit.
[2024-05-22 00:00:45] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 21/29 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/32 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/38 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 32/70 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 24/94 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/94 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 70/164 variables, 46/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 46/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/176 variables, 22/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/176 variables, 12/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/176 variables, 10/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/176 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 268 constraints, problems are : Problem set: 0 solved, 3 unsolved in 135 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 21/29 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 4 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/32 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/38 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 32/70 variables, 38/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 24/94 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/94 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 70/164 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 46/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/164 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/164 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/164 variables, 7/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/164 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 12/176 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 10/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/176 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/176 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/176 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 290 constraints, problems are : Problem set: 0 solved, 3 unsolved in 662 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 8 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 24 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 96/96 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:46] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:46] [INFO ] Invariant cache hit.
[2024-05-22 00:00:46] [INFO ] Implicit Places using invariants in 150 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 78, 81, 84, 87, 93]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 151 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 178 ms. Remains : 82/96 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 527562 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 3
Probabilistic random walk after 527562 steps, saw 276301 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-22 00:00:49] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 82 cols
[2024-05-22 00:00:49] [INFO ] Computed 42 invariants in 2 ms
[2024-05-22 00:00:49] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/32 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 8 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/34 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/34 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 32/66 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 24/90 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 60/150 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/150 variables, 36/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 12/162 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/162 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/162 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/162 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/162 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 506 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/32 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/34 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/34 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 32/66 variables, 34/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 24/90 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/90 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/90 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/90 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 60/150 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/150 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/150 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/150 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 6 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/150 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:00:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/150 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/150 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 12/162 variables, 12/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/162 variables, 12/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/162 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/162 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/162 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 270 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1236 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 41/41 constraints]
After SMT, in 1757ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 178 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 82/82 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 758751 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 758751 steps, saw 391572 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-22 00:00:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:55] [INFO ] Invariant cache hit.
[2024-05-22 00:00:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/16 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/17 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/17 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/33 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/33 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 32/65 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/65 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 81/146 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 49/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 15/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/162 variables, 17/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/162 variables, 16/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/162 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/162 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/16 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/17 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/33 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 32/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 81/146 variables, 49/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 49/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 15/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/146 variables, 15/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/146 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/162 variables, 17/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/162 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/162 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/162 variables, 16/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/162 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/162 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 637 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 82/82 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:55] [INFO ] Invariant cache hit.
[2024-05-22 00:00:56] [INFO ] Implicit Places using invariants in 108 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/82 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 125 ms. Remains : 81/82 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 697956 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 2
Probabilistic random walk after 697956 steps, saw 365067 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2024-05-22 00:00:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2024-05-22 00:00:59] [INFO ] Computed 41 invariants in 1 ms
[2024-05-22 00:00:59] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/16 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/17 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/33 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 32/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 80/145 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 48/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/161 variables, 16/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 16/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/161 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 192 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 9/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/16 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/17 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/17 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/17 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/33 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/33 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 32/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 80/145 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 48/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:00:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 16/161 variables, 16/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/161 variables, 16/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/161 variables, 16/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/161 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/161 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/81 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:00:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:59] [INFO ] Invariant cache hit.
[2024-05-22 00:00:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 00:00:59] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:00:59] [INFO ] Invariant cache hit.
[2024-05-22 00:00:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 00:01:00] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 00:01:00] [INFO ] Redundant transitions in 30 ms returned []
Running 420 sub problems to find dead transitions.
[2024-05-22 00:01:00] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:00] [INFO ] Invariant cache hit.
[2024-05-22 00:01:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 39/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:03] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:01:04] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (OVERLAPS) 80/161 variables, 81/257 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 13 (OVERLAPS) 0/161 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 277 constraints, problems are : Problem set: 0 solved, 420 unsolved in 11908 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 39/119 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 54/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 80/161 variables, 81/257 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 420/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (OVERLAPS) 0/161 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 697 constraints, problems are : Problem set: 0 solved, 420 unsolved in 9287 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 54/54 constraints]
After SMT, in 21405ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 21412ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21705 ms. Remains : 81/81 places, 440/440 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 125 edges and 81 vertex of which 17 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 352 output transitions
Drop transitions (Output transitions of discarded places.) removed 352 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 16 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 12 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 12 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 12 transition count 10
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 90 place count 8 transition count 8
Applied a total of 90 rules in 23 ms. Remains 8 /81 variables (removed 73) and now considering 8/440 (removed 432) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 00:01:21] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 00:01:21] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 00:01:21] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 00:01:21] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-22 00:01:21] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 71 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-22 00:01:21] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:01:21] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:01:21] [INFO ] Input system was already deterministic with 440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 23 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2024-05-22 00:01:21] [INFO ] Computed 56 invariants in 2 ms
[2024-05-22 00:01:21] [INFO ] Implicit Places using invariants in 248 ms returned [42, 48, 51, 54, 59, 62, 67, 72, 78, 81, 84, 87, 90, 93]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 250 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 26 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 301 ms. Remains : 82/96 places, 440/440 transitions.
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 41 ms
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:01:22] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:01:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17334409658623337860.gal : 16 ms
[2024-05-22 00:01:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4363524933735125051.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17334409658623337860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4363524933735125051.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.11916,8400,2,260,5,7757,6,0,771,3255,0


Converting to forward existential form...Done !
original formula: EF((((AF(EG(AG(((flag_0_10==0)||(p1_1==1))))) * AG(AF(((flag_0_16==0)&&(p3_2==1))))) * (EG(((EG(((p3_0==0)||(p3_7==1))) + (p0_2==1)) + ((...217
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * (p0_13==1)) * (!(EG(!(EG(!(E(TRUE U !(((flag_0_10==0)||(p1_1==1))))))))) * !(E(TRUE U...303
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.377249,16404,1,0,915,79890,922,447,7112,48760,908
FORMULA Dekker-PT-020-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:22] [INFO ] Invariant cache hit.
[2024-05-22 00:01:22] [INFO ] Implicit Places using invariants in 151 ms returned [42, 45, 48, 54, 62, 67, 72, 75, 78, 81, 84, 87, 90, 93]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 174 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 82/96 places, 440/440 transitions.
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:01:22] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:01:22] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4491103868410145831.gal : 5 ms
[2024-05-22 00:01:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality6160051469454343088.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4491103868410145831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6160051469454343088.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.084282,8516,2,260,5,7713,6,0,771,3247,0


Converting to forward existential form...Done !
original formula: EF(EX((AG((p0_4==1)) * ((flag_1_5==0)||(p0_7==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * ((flag_1_5==0)||(p0_7==1))) * !(E(TRUE U !((p0_4==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.313886,14640,1,0,910,72133,902,442,6991,41914,890
FORMULA Dekker-PT-020-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:23] [INFO ] Invariant cache hit.
[2024-05-22 00:01:23] [INFO ] Implicit Places using invariants in 152 ms returned [42, 45, 48, 51, 62, 67, 72, 75, 78, 81, 84, 93]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 155 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 84/96 places, 440/440 transitions.
[2024-05-22 00:01:23] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:23] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:01:23] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:23] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:23] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7749687412360862.gal : 14 ms
[2024-05-22 00:01:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7009817977250760872.ctl : 74 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7749687412360862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7009817977250760872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.105154,8548,2,268,5,8135,6,0,779,3360,0


Converting to forward existential form...Done !
original formula: !(E(EX(!(((p0_7==0)||(p0_5==1)))) U (AX(FALSE) * !((AF(((p0_18==0)&&(p1_12==1))) * (((!(((p0_17==0)||(p0_7==1))&&((flag_0_6==0)||(flag_0_...236
=> equivalent forward existential formula: ([FwdG((FwdU(Init,EX(!(((p0_7==0)||(p0_5==1))))) * !(EX(!(FALSE)))),!(((p0_18==0)&&(p1_12==1))))] = FALSE * [((F...360
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.386572,14672,1,0,913,73194,907,445,7162,45005,890
FORMULA Dekker-PT-020-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 20 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:23] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:23] [INFO ] Invariant cache hit.
[2024-05-22 00:01:24] [INFO ] Implicit Places using invariants in 134 ms returned [45, 48, 51, 54, 59, 62, 67, 72, 75, 78, 81, 84, 87, 90, 93]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 136 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/96 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 166 ms. Remains : 81/96 places, 440/440 transitions.
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:24] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8971859350884569624.gal : 3 ms
[2024-05-22 00:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12092222993489925989.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8971859350884569624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12092222993489925989.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.082474,8496,2,256,5,7585,6,0,767,3203,0


Converting to forward existential form...Done !
original formula: EF((AF(AG((((p3_14==0)||(p1_12==1))&&(p3_8==1)))) + AG(EF(((p0_1==0)&&(flag_0_12==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((((p3_14==0)||(p1_12==1))&&(p3_8==1)))))))))] != FALSE + [(FwdU(Init,TR...226
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.339391,15148,1,0,911,74048,906,445,7049,43908,901
FORMULA Dekker-PT-020-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:24] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:24] [INFO ] Invariant cache hit.
[2024-05-22 00:01:24] [INFO ] Implicit Places using invariants in 166 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 75, 78, 81, 87, 90]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 167 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 82/96 places, 440/440 transitions.
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:24] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14613991773184346606.gal : 4 ms
[2024-05-22 00:01:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15606549903288843058.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14613991773184346606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15606549903288843058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.088515,8516,2,259,5,7803,6,0,771,3261,0


Converting to forward existential form...Done !
original formula: EF(((E((EX(TRUE) + !(((flag_1_9==0)||(p0_16==1)))) U EX(((p3_8==0)||(flag_0_0==1)))) * AG(AF(((flag_1_11==0)||(flag_0_10==1))))) * (AF(((...207
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E((EX(TRUE) + !(((flag_1_9==0)||(p0_16==1)))) U EX(((p3_8==0)||(flag_0_0==1)))) * !(E(TRU...283
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.359103,16224,1,0,918,80946,915,448,7142,48103,907
FORMULA Dekker-PT-020-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:25] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:25] [INFO ] Invariant cache hit.
[2024-05-22 00:01:25] [INFO ] Implicit Places using invariants in 130 ms returned [42, 48, 51, 54, 59, 62, 72, 75, 81, 84, 87, 90, 93]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 131 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 83/96 places, 440/440 transitions.
[2024-05-22 00:01:25] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:25] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5881013100648159760.gal : 3 ms
[2024-05-22 00:01:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6418327402190254833.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5881013100648159760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6418327402190254833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.084578,8636,2,264,5,7891,6,0,775,3299,0


Converting to forward existential form...Done !
original formula: EF((((!(A((p0_10==0) U (p1_4==1))) * (flag_0_8==0)) * ((flag_1_5==1) * ((p3_14==1) + AX(((flag_1_16==0)&&(p1_3==1)))))) * (((p0_14==0)||(...197
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * (((p0_14==0)||(p0_2==0))||((flag_1_18==0)&&(p3_16==1)))) * (!(!((E(!((p1_4==1)) U (!((p0...509
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.346742,16344,1,0,928,80155,911,455,7080,51457,909
FORMULA Dekker-PT-020-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:25] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:25] [INFO ] Invariant cache hit.
[2024-05-22 00:01:26] [INFO ] Implicit Places using invariants in 274 ms returned [42, 45, 48, 51, 54, 59, 72, 78, 81, 84, 87, 90, 93]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 275 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 279 ms. Remains : 83/96 places, 440/440 transitions.
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:26] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality1023866867766948141.gal : 2 ms
[2024-05-22 00:01:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5437083291376300998.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1023866867766948141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5437083291376300998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.084925,8640,2,264,5,7946,6,0,775,3309,0


Converting to forward existential form...Done !
original formula: (EX(EF(AG((p1_15!=1)))) * (!(A(!((((flag_1_6==0)||(p3_3==1))||(flag_0_2==0))) U (E((flag_1_4==1) U ((p1_1==0)||(flag_1_4==1))) + AF(((p0_...255
=> equivalent forward existential formula: (([FwdG(((FwdU((Init * EX(E(TRUE U !(E(TRUE U !((p1_15!=1))))))),!((E((flag_1_4==1) U ((p1_1==0)||(flag_1_4==1))...744
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.405349,18724,1,0,927,89965,946,456,7182,58283,921
FORMULA Dekker-PT-020-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:26] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:26] [INFO ] Invariant cache hit.
[2024-05-22 00:01:26] [INFO ] Implicit Places using invariants in 127 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 75, 81, 84, 87, 93]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 128 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 82/96 places, 440/440 transitions.
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:26] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:01:26] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:01:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6386892212576520304.gal : 4 ms
[2024-05-22 00:01:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality337330709494831055.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6386892212576520304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality337330709494831055.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.107355,8512,2,260,5,7944,6,0,771,3287,0


Converting to forward existential form...Done !
original formula: (AG(E((AX(((flag_0_13==0)||(flag_0_3==1))) * ((EX((p0_14==1)) + (flag_1_17==0)) + (p3_6==1))) U ((p3_17==0)||(p0_18==1)))) * EX(EF(!(A((p...180
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((!(EX(!(((flag_0_13==0)||(flag_0_3==1))))) * ((EX((p0_14==1)) + (flag_1_17==0)) + (p3_6...315
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,0,0.41309,18068,1,0,926,87325,921,461,7147,56167,933
FORMULA Dekker-PT-020-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:27] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:27] [INFO ] Invariant cache hit.
[2024-05-22 00:01:27] [INFO ] Implicit Places using invariants in 129 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 75, 78, 81, 84, 87, 90, 93]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 130 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 80/96 places, 440/440 transitions.
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:01:27] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3997828998035199239.gal : 2 ms
[2024-05-22 00:01:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4071341233352053976.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3997828998035199239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4071341233352053976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.081286,8488,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: (AF(EX(EX(((flag_1_16==0)||(p1_12==1))))) + AG(((flag_0_17==0)&&(flag_1_0==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(EX(EX(((flag_1_16==0)||(p1_12==1))))))))),TRUE) * !(((flag_0_17==0)&&(flag_1_0==1))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t21, t43, t65, t87, t109, t131, t153, t175, t197, t219, t241, t263, t285, t307, t329, t351, t...278
(forward)formula 0,1,0.302132,14348,1,0,915,69265,905,447,6928,42314,894
FORMULA Dekker-PT-020-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:27] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:27] [INFO ] Invariant cache hit.
[2024-05-22 00:01:27] [INFO ] Implicit Places using invariants in 142 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 75, 78, 81, 84, 87, 90, 93]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 143 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/96 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 80/96 places, 440/440 transitions.
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16954927346185680079.gal : 2 ms
[2024-05-22 00:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2797725770819343425.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16954927346185680079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2797725770819343425.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.087363,8488,2,252,5,7566,6,0,763,3181,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.094401,8488,1,0,6,7566,7,1,1378,3181,1
FORMULA Dekker-PT-020-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 00:01:28] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 00:01:28] [INFO ] Invariant cache hit.
[2024-05-22 00:01:28] [INFO ] Implicit Places using invariants in 130 ms returned [42, 45, 48, 51, 54, 59, 62, 67, 72, 75, 78, 84, 87, 90, 93]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 131 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/96 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 81/96 places, 440/440 transitions.
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:01:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6392055403863205713.gal : 2 ms
[2024-05-22 00:01:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality170249218977868615.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6392055403863205713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality170249218977868615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15343e+07,0.082744,8500,2,256,5,7744,6,0,767,3233,0


Converting to forward existential form...Done !
original formula: EX(EX((((flag_1_19==0)||(flag_1_16==1)) * (EG((p0_15==1)) + (p1_2==0)))))
=> equivalent forward existential formula: ([FwdG((EY(EY(Init)) * ((flag_1_19==0)||(flag_1_16==1))),(p0_15==1))] != FALSE + [((EY(EY(Init)) * ((flag_1_19==...199
Hit Full ! (commute/partial/dont) 419/0/21
(forward)formula 0,1,0.169766,8816,1,0,12,15900,20,3,5483,9226,11
FORMULA Dekker-PT-020-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-22 00:01:28] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:01:28] [INFO ] Flatten gal took : 14 ms
Total runtime 50372 ms.

BK_STOP 1716336088788

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Dekker-PT-020"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Dekker-PT-020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131900097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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