MCC'2024- Execution of r355-tall-171683758100146

About the Execution of GreatSPN+red for ShieldIIPs-PT-050A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11455.039	3600000.00	14108346.00	330.20	[undef]	Time out reached

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-171683758100146.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-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758100146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 426K 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-050A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716912677141

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:11:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 16:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:11:18] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-28 16:11:18] [INFO ] Transformed 1253 places.
[2024-05-28 16:11:18] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:11:18] [INFO ] Found NUPN structural information;
[2024-05-28 16:11:18] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 267 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 89 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:11:18] [INFO ] Computed 451 invariants in 31 ms
[2024-05-28 16:11:19] [INFO ] Implicit Places using invariants in 859 ms returned []
[2024-05-28 16:11:19] [INFO ] Invariant cache hit.
[2024-05-28 16:11:21] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30047 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 10 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-28 16:12:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:12:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 3 ms to minimize.
[2024-05-28 16:12:16] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:12:17] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:12:17] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:12:17] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:12:18] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:12:18] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:12:18] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 6 ms to minimize.
[2024-05-28 16:12:18] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:12:19] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30033 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60722ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Finished structural reductions in LTL mode , in 1 iterations and 63261 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 267 out of 1253 places after structural reductions.
[2024-05-28 16:12:22] [INFO ] Flatten gal took : 197 ms
[2024-05-28 16:12:22] [INFO ] Flatten gal took : 107 ms
[2024-05-28 16:12:22] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 262 out of 1253 places (down from 267) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 116 to 114
RANDOM walk for 40000 steps (13 resets) in 3110 ms. (12 steps per ms) remains 10/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 431 ms. (92 steps per ms) remains 9/9 properties
[2024-05-28 16:12:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 83/118 variables, 35/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 83/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1135/1253 variables, 416/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1135/1704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 16:12:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:12:25] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:12:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:12:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 4/1708 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 0/2961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2456 variables, 0/2961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 2961 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1866 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 83/118 variables, 35/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 83/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1135/1253 variables, 416/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1135/1704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 4/1708 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:12:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 3/1711 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1203/2456 variables, 1253/2964 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 9/2973 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:12:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 2/2975 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:12:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2456 variables, 2/2977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2977 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5011 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 6902ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 327 times.
Drop transitions (Partial Free agglomeration) removed 327 transitions
Iterating global reduction 0 with 327 rules applied. Total rules applied 331 place count 1251 transition count 1201
Applied a total of 331 rules in 288 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 1251/1253 places, 1201/1203 transitions.
RANDOM walk for 40000 steps (8 resets) in 1356 ms. (29 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 3/3 properties
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:12:33] [INFO ] Computed 451 invariants in 54 ms
[2024-05-28 16:12:33] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/45 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1184/1229 variables, 427/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1184/1669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 5 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:12:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 6/1675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 22/1251 variables, 11/1686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 22/1708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:34] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 3 ms to minimize.
[2024-05-28 16:12:34] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 2/1710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 0/1710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1201/2452 variables, 1251/2961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 4/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2452 variables, 0/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2965 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1874 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 32/45 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1184/1229 variables, 427/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1184/1669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 6/1675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:12:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 4/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 22/1251 variables, 11/1690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 22/1712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 2/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 3/2972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:12:36] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:12:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:12:38] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:12:39] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 20/2992 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:12:40] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 4 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:12:41] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 13/3005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:12:42] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 1/3006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2452 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 3006 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8976 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 46/46 constraints]
After SMT, in 10931ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 9231 ms.
Support contains 4 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 1251 transition count 1201
Applied a total of 19 rules in 104 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 1251/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 630 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232219 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232219 steps, saw 221801 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:12:56] [INFO ] Computed 451 invariants in 48 ms
[2024-05-28 16:12:56] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1232/1247 variables, 445/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1247 variables, 1232/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:12:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 5/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1251 variables, 2/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 4/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1201/2452 variables, 1251/2958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2452 variables, 4/2962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 4 ms to minimize.
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 4 ms to minimize.
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 5 places in 289 ms of which 5 ms to minimize.
[2024-05-28 16:12:58] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 4 ms to minimize.
[2024-05-28 16:12:59] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 4 ms to minimize.
[2024-05-28 16:12:59] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 4 ms to minimize.
[2024-05-28 16:12:59] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 5 ms to minimize.
[2024-05-28 16:13:00] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 4 ms to minimize.
[2024-05-28 16:13:00] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:13:00] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:13:00] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:13:01] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:13:01] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:13:01] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:13:01] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:13:02] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 3 ms to minimize.
[2024-05-28 16:13:02] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 4 ms to minimize.
[2024-05-28 16:13:02] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 4 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 20/2982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 4 ms to minimize.
[2024-05-28 16:13:03] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 2/2984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 0/2984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2452 variables, 0/2984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2984 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7359 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 449/449 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1232/1247 variables, 445/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1247 variables, 1232/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 27/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 2/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1247 variables, 0/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1251 variables, 2/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 4/1731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:04] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 1/1732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 1/2988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:13:05] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:13:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:13:06] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 9/2997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2452 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 2997 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2576 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 449/449 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 10001ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 58926 steps, including 997 resets, run visited all 1 properties in 611 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 627 ms.
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 80 ms
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 80 ms
[2024-05-28 16:13:07] [INFO ] Input system was already deterministic with 1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 66 ms
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 70 ms
[2024-05-28 16:13:07] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 61 ms
[2024-05-28 16:13:07] [INFO ] Flatten gal took : 58 ms
[2024-05-28 16:13:08] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 59 ms
[2024-05-28 16:13:08] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 85 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:13:08] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:13:08] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:13:08] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:13:09] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:13:09] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:13:09] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:13:09] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:13:09] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:13:09] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 60 ms
[2024-05-28 16:13:10] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 59 ms
[2024-05-28 16:13:10] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 84 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 86 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:13:10] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:13:10] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:13:11] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 71 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:13:11] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:13:11] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:13:11] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:13:11] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-28 16:13:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 9 ms.
Total runtime 113373 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-050A

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: 1253
TRANSITIONS: 1203
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.032s, Sys 0.001s]

SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 933
MODEL NAME: /home/mcc/execution/410/model
1253 places, 1203 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.

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 CTLFireability -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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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