Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 14K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 11 20:11 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 141K 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-015-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-03
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-05
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-015-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717184701179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:45:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:45:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:45:02] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-31 19:45:02] [INFO ] Transformed 75 places.
[2024-05-31 19:45:02] [INFO ] Transformed 255 transitions.
[2024-05-31 19:45:02] [INFO ] Found NUPN structural information;
[2024-05-31 19:45:02] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1469 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 789 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1300848 steps, run timeout after 3002 ms. (steps per millisecond=433 ) properties seen :0 out of 6
Probabilistic random walk after 1300848 steps, saw 98224 distinct states, run finished after 3007 ms. (steps per millisecond=432 ) properties seen :0
[2024-05-31 19:45:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2024-05-31 19:45:06] [INFO ] Computed 45 invariants in 6 ms
[2024-05-31 19:45:06] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem Dekker-PT-015-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/73 variables, 12/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 9/112 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 4/116 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/75 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 60/135 variables, 75/195 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 15/210 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 210 constraints, problems are : Problem set: 1 solved, 5 unsolved in 336 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Problem Dekker-PT-015-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 16/78 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/86 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 8 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
Problem Dekker-PT-015-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/89 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/91 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/92 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/73 variables, 14/106 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 11/117 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 5/122 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem Dekker-PT-015-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 8/130 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/130 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/75 variables, 2/132 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/75 variables, 2/134 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/134 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 60/135 variables, 75/209 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/135 variables, 15/224 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/135 variables, 2/226 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 3/229 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-31 19:45:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/135 variables, 1/230 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/135 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/135 variables, 0/230 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 230 constraints, problems are : Problem set: 4 solved, 2 unsolved in 733 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 18/18 constraints]
After SMT, in 1155ms problems are : Problem set: 4 solved, 2 unsolved
FORMULA Dekker-PT-015-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 152 ms.
Support contains 11 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 21 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 75/75 places, 255/255 transitions.
RANDOM walk for 40000 steps (8 resets) in 330 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2257552 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :0 out of 1
Probabilistic random walk after 2257552 steps, saw 161897 distinct states, run finished after 3001 ms. (steps per millisecond=752 ) properties seen :0
[2024-05-31 19:45:11] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-31 19:45:11] [INFO ] Invariant cache hit.
[2024-05-31 19:45:11] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/35 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/37 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/45 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 36/81 variables, 45/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/93 variables, 15/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/129 variables, 24/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/129 variables, 24/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/135 variables, 12/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/135 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/135 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/135 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/135 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/135 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/35 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:45:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/37 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/45 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/81 variables, 45/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/93 variables, 15/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 36/129 variables, 24/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/129 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/129 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:45:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-31 19:45:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/129 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/129 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/135 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/135 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/135 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/135 variables, 6/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/135 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/135 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 11 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 13 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 19:45:11] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-31 19:45:11] [INFO ] Invariant cache hit.
[2024-05-31 19:45:11] [INFO ] Implicit Places using invariants in 117 ms returned [33, 36, 39, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 125 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/75 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 146 ms. Remains : 62/75 places, 255/255 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2194592 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :0 out of 1
Probabilistic random walk after 2194592 steps, saw 147437 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
[2024-05-31 19:45:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2024-05-31 19:45:14] [INFO ] Computed 32 invariants in 9 ms
[2024-05-31 19:45:14] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 19/30 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/36 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/38 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 36/74 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/86 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/116 variables, 18/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/116 variables, 18/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/122 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/122 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 19/30 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:45:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-31 19:45:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-31 19:45:14] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/36 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/38 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 36/74 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/74 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/86 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/86 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/116 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 18/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/116 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:45:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/116 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/116 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/122 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/122 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/122 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/62 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 19:45:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-31 19:45:14] [INFO ] Invariant cache hit.
[2024-05-31 19:45:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:45:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-31 19:45:15] [INFO ] Invariant cache hit.
[2024-05-31 19:45:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 19:45:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-31 19:45:15] [INFO ] Redundant transitions in 9 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-31 19:45:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-31 19:45:15] [INFO ] Invariant cache hit.
[2024-05-31 19:45:15] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-31 19:45:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-31 19:45:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 13 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-31 19:45:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 2/62 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 60/122 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 15/210 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 210 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6229 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 2/62 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 60/122 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 15/210 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 240/450 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 450 constraints, problems are : Problem set: 0 solved, 240 unsolved in 4017 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 39/39 constraints]
After SMT, in 10341ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 10346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10530 ms. Remains : 62/62 places, 255/255 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 100 edges and 62 vertex of which 38 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 102 output transitions
Drop transitions (Output transitions of discarded places.) removed 102 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 36 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 34 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 34 transition count 34
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 34 transition count 32
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 132 place count 30 transition count 30
Applied a total of 132 rules in 25 ms. Remains 30 /62 variables (removed 32) and now considering 30/255 (removed 225) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 30 cols
[2024-05-31 19:45:25] [INFO ] Computed 15 invariants in 0 ms
[2024-05-31 19:45:25] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 19:45:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2024-05-31 19:45:25] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 19:45:25] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 19:45:25] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 102 ms.
[2024-05-31 19:45:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-31 19:45:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 255 transitions and 1622 arcs took 4 ms.
[2024-05-31 19:45:25] [INFO ] Flatten gal took : 59 ms
Total runtime 23477 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Dekker-PT-015-ReachabilityCardinality-2024-08

BK_STOP 1717184726086

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Dekker-PT-015-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/734/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Dekker-PT-015, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631131900094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;