Execution Chart

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

Trace from the execution

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

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-01
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-02
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-03
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-04
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-05
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-06
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-07
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-08
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-09
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-10
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-11
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-12
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-13
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-14
FORMULA_NAME Dekker-PT-020-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716334046136

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:27:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 23:27:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:27:27] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-21 23:27:27] [INFO ] Transformed 100 places.
[2024-05-21 23:27:27] [INFO ] Transformed 440 transitions.
[2024-05-21 23:27:27] [INFO ] Found NUPN structural information;
[2024-05-21 23:27:27] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Dekker-PT-020-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1721 ms. (23 steps per ms) remains 3/11 properties
FORMULA Dekker-PT-020-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 969 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1186 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
[2024-05-21 23:27:28] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-21 23:27:28] [INFO ] Computed 60 invariants in 10 ms
[2024-05-21 23:27:28] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 33/99 variables, 37/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 33/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 18/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/100 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 80/180 variables, 100/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 280 constraints, problems are : Problem set: 0 solved, 3 unsolved in 490 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 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/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem Dekker-PT-020-ReachabilityFireability-2024-04 is UNSAT
FORMULA Dekker-PT-020-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 9 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem Dekker-PT-020-ReachabilityFireability-2024-01 is UNSAT
FORMULA Dekker-PT-020-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 33/99 variables, 37/109 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 33/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 18/160 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 6/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/100 variables, 1/167 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/168 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 80/180 variables, 100/268 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/180 variables, 20/288 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 1/289 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 4/293 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/180 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 293 constraints, problems are : Problem set: 2 solved, 1 unsolved in 822 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1432ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 53 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 44 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 100/100 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1404396 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1404396 steps, saw 696036 distinct states, run finished after 3004 ms. (steps per millisecond=467 ) properties seen :0
[2024-05-21 23:27:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:27:33] [INFO ] Invariant cache hit.
[2024-05-21 23:27:33] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 38/91 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 17/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/98 variables, 7/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/100 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/180 variables, 100/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/180 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 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/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/91 variables, 32/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 17/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 13/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/98 variables, 7/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/100 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 80/180 variables, 100/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/180 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/180 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/180 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/180 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/180 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/180 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1181 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 25/25 constraints]
After SMT, in 1308ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 53 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 17 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-21 23:27:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:27:35] [INFO ] Invariant cache hit.
[2024-05-21 23:27:35] [INFO ] Implicit Places using invariants in 83 ms returned [40, 43, 46, 49, 52, 55, 58, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 90 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/100 places, 440/440 transitions.
Applied a total of 0 rules in 11 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 114 ms. Remains : 81/100 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1573026 steps, run timeout after 3001 ms. (steps per millisecond=524 ) properties seen :0 out of 1
Probabilistic random walk after 1573026 steps, saw 753983 distinct states, run finished after 3001 ms. (steps per millisecond=524 ) properties seen :0
[2024-05-21 23:27:38] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2024-05-21 23:27:38] [INFO ] Computed 41 invariants in 3 ms
[2024-05-21 23:27:38] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/81 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 28/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/161 variables, 81/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 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: 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/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 28/81 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/161 variables, 81/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/161 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 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: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 53 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 31 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 31 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 10 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-21 23:27:38] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:27:38] [INFO ] Invariant cache hit.
[2024-05-21 23:27:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 23:27:38] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:27:38] [INFO ] Invariant cache hit.
[2024-05-21 23:27:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 23:27:39] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 23:27:39] [INFO ] Redundant transitions in 22 ms returned []
Running 420 sub problems to find dead transitions.
[2024-05-21 23:27:39] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:27:39] [INFO ] Invariant cache hit.
[2024-05-21 23:27:39] [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-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 8 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 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-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 19 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-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 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 11895 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 9280 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 21376ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 21382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21573 ms. Remains : 81/81 places, 440/440 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 81 transition count 80
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 367 place count 81 transition count 73
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 388 place count 67 transition count 66
Applied a total of 388 rules in 22 ms. Remains 67 /81 variables (removed 14) and now considering 66/440 (removed 374) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 67 cols
[2024-05-21 23:28:00] [INFO ] Computed 34 invariants in 2 ms
[2024-05-21 23:28:00] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:28:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-21 23:28:00] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 23:28:00] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:28:00] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:28:00] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 208 ms.
[2024-05-21 23:28:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-21 23:28:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 440 transitions and 2841 arcs took 6 ms.
[2024-05-21 23:28:00] [INFO ] Flatten gal took : 113 ms
Total runtime 33683 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-020

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 884
MODEL NAME: /home/mcc/execution/407/model
81 places, 440 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Dekker-PT-020-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716334081871

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Dekker-PT-020, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130400103"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;