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.r355-tall-171683757900063.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 ShieldIIPs-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 66K May 18 16:43 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 ShieldIIPs-PT-004B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716881776099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:36:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 07:36:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:36:17] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-28 07:36:17] [INFO ] Transformed 243 places.
[2024-05-28 07:36:17] [INFO ] Transformed 239 transitions.
[2024-05-28 07:36:17] [INFO ] Found NUPN structural information;
[2024-05-28 07:36:17] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (67 resets) in 1496 ms. (26 steps per ms) remains 5/16 properties
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 357 ms. (111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 759 ms. (52 steps per ms) remains 4/5 properties
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
// Phase 1: matrix 239 rows 243 cols
[2024-05-28 07:36:18] [INFO ] Computed 37 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 146/243 variables, 37/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 146/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 239/482 variables, 243/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 523 constraints, problems are : Problem set: 0 solved, 4 unsolved in 565 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 146/243 variables, 37/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 146/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 16 ms to minimize.
Problem ShieldIIPs-PT-004B-ReachabilityFireability-2024-01 is UNSAT
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 7/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 07:36:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 239/482 variables, 243/531 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/534 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:21] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-28 07:36:21] [INFO ] Deduced a trap composed of 22 places in 543 ms of which 1 ms to minimize.
[2024-05-28 07:36:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 12/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/482 variables, 0/546 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 546 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3257 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 3949ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1261 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 239/239 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 243 transition count 233
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 237 transition count 229
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 233 transition count 229
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 20 place count 233 transition count 218
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 42 place count 222 transition count 218
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 56 place count 208 transition count 204
Iterating global reduction 3 with 14 rules applied. Total rules applied 70 place count 208 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 208 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 207 transition count 203
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 138 place count 174 transition count 170
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 174 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 173 transition count 169
Applied a total of 147 rules in 76 ms. Remains 173 /243 variables (removed 70) and now considering 169/239 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 173/243 places, 169/239 transitions.
RANDOM walk for 40000 steps (76 resets) in 320 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 791103 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 3
Probabilistic random walk after 791103 steps, saw 148321 distinct states, run finished after 3013 ms. (steps per millisecond=262 ) properties seen :0
// Phase 1: matrix 169 rows 173 cols
[2024-05-28 07:36:27] [INFO ] Computed 37 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/171 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/173 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 169/342 variables, 173/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 173/173 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/171 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 15 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/173 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/342 variables, 173/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 07:36:28] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:36:28] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 224 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2237 ms.
Support contains 81 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 169/169 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 173/173 places, 169/169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 169/169 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2024-05-28 07:36:30] [INFO ] Invariant cache hit.
[2024-05-28 07:36:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 07:36:30] [INFO ] Invariant cache hit.
[2024-05-28 07:36:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-28 07:36:31] [INFO ] Redundant transitions in 21 ms returned []
Running 165 sub problems to find dead transitions.
[2024-05-28 07:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 4/173 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:36] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:36:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 169/342 variables, 173/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 17/281 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:36:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 3 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 14/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 17/312 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/342 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/342 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:36:56] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:57] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:36:57] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/342 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/342 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/342 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/342 variables, and 351 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 4/173 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 141/178 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 169/342 variables, 173/351 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 165/516 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:37:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:37:05] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:37:11] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 532 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 157/157 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60328 ms. Remains : 173/173 places, 169/169 transitions.
[2024-05-28 07:37:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-28 07:37:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 169 transitions and 592 arcs took 4 ms.
[2024-05-28 07:37:31] [INFO ] Flatten gal took : 39 ms
Total runtime 74177 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-004B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/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: 1126
MODEL NAME: /home/mcc/execution/410/model
173 places, 169 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 ShieldIIPs-PT-004B-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-004B"
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 ShieldIIPs-PT-004B, 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 r355-tall-171683757900063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-004B.tgz
mv ShieldIIPs-PT-004B 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 ;