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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 868K 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-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716920355085

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 18:19:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 18:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:19:16] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-28 18:19:16] [INFO ] Transformed 2503 places.
[2024-05-28 18:19:16] [INFO ] Transformed 2403 transitions.
[2024-05-28 18:19:16] [INFO ] Found NUPN structural information;
[2024-05-28 18:19:16] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2885 ms. (13 steps per ms) remains 8/16 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 790 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1432 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 631 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 681 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 586 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 536 ms. (74 steps per ms) remains 8/8 properties
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-28 18:19:19] [INFO ] Computed 901 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3723 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 28 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-28 18:19:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-28 18:19:25] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 18:19:25] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 8/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5915 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4906 variables, 8/5923 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4906/4906 variables, and 5923 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5015 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 9024ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 329 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 551 times.
Drop transitions (Partial Free agglomeration) removed 551 transitions
Iterating global reduction 0 with 551 rules applied. Total rules applied 555 place count 2501 transition count 2401
Applied a total of 555 rules in 629 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 2501/2503 places, 2401/2403 transitions.
RANDOM walk for 40000 steps (8 resets) in 1401 ms. (28 steps per ms) remains 7/8 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 686 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 604 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 660 ms. (60 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 605 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 546 ms. (73 steps per ms) remains 7/7 properties
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:19:30] [INFO ] Computed 901 invariants in 62 ms
[2024-05-28 18:19:30] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 565/892 variables, 283/610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/892 variables, 565/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1558/2450 variables, 592/1767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2450 variables, 1558/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2450 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 51/2501 variables, 26/3351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 51/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3598 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 565/892 variables, 283/610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/892 variables, 565/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 18:19:34] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 2/1177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1558/2450 variables, 592/1770 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2450 variables, 1558/3328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:35] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-28 18:19:35] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:19:36] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 15/3343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-28 18:19:37] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2450 variables, 5/3348 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:38] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2450 variables, 1/3349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/3349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 51/2501 variables, 26/3375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2501 variables, 51/3426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:19:39] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-28 18:19:40] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2501 variables, 6/3432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2501 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2401/4902 variables, 2501/5933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 4/5937 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 7/5944 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:19:53] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-28 18:19:53] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 4 ms to minimize.
[2024-05-28 18:19:54] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-28 18:19:54] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-28 18:19:54] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 18:19:54] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-28 18:19:55] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-28 18:19:55] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-28 18:19:56] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:19:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:19:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:19:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-28 18:19:57] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:19:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:19:59] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 15/5959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:04] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:20:04] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:20:06] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 3/5962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:10] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4902 variables, 1/5963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:15] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:20:16] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/4902 variables, 2/5965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5965 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45025 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 51/51 constraints]
After SMT, in 48809ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 327 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2501 transition count 2401
Applied a total of 2 rules in 167 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 2501/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 581 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 675 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 75567 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 7
Probabilistic random walk after 75567 steps, saw 71116 distinct states, run finished after 3009 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:20:23] [INFO ] Computed 901 invariants in 35 ms
[2024-05-28 18:20:23] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 565/892 variables, 283/610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/892 variables, 565/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1558/2450 variables, 592/1767 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2450 variables, 1558/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2450 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 51/2501 variables, 26/3351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 51/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3614 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 327/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 565/892 variables, 283/610 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/892 variables, 565/1175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:27] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 18:20:28] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 2/1177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:28] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1558/2450 variables, 592/1770 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2450 variables, 1558/3328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:20:29] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 15/3343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:30] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:20:31] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:20:31] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:20:31] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:20:31] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2450 variables, 5/3348 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2450 variables, 1/3349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/3349 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 51/2501 variables, 26/3375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2501 variables, 51/3426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:20:32] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:20:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2501 variables, 6/3432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2501 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2401/4902 variables, 2501/5933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 4/5937 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 7/5944 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:46] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-05-28 18:20:46] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-28 18:20:47] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-05-28 18:20:47] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-28 18:20:47] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-28 18:20:48] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-28 18:20:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-28 18:20:49] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-28 18:20:49] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-28 18:20:49] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:20:49] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:20:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:20:50] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:20:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:20:51] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:20:52] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-28 18:20:52] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:20:52] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:20:53] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:20:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 20/5964 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:20:58] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:20:58] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:20:58] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:20:58] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 4/5968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4902 variables, 0/5968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/4902 variables, 0/5968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5968 constraints, problems are : Problem set: 0 solved, 7 unsolved in 47541 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 54/54 constraints]
After SMT, in 51308ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 38559 ms.
Support contains 156 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 70 times.
Drop transitions (Partial Free agglomeration) removed 70 transitions
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 2501 transition count 2401
Applied a total of 70 rules in 173 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 2501/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1054 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 579 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 78740 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 4
Probabilistic random walk after 78740 steps, saw 75495 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:21:57] [INFO ] Computed 901 invariants in 24 ms
[2024-05-28 18:21:57] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1970/2461 variables, 727/1372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2461 variables, 1970/3342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2461 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 40/2501 variables, 20/3362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 40/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2326 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 881/881 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:00] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1970/2461 variables, 727/1373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2461 variables, 1970/3343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:22:01] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2461 variables, 10/3353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2461 variables, 0/3353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/2501 variables, 20/3373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 40/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:02] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:22:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:22:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:22:02] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-05-28 18:22:02] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 5/3418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2501 variables, 0/3418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2401/4902 variables, 2501/5919 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 4/5923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 4/5927 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:11] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
[2024-05-28 18:22:12] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-28 18:22:12] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-28 18:22:12] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-28 18:22:13] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:22:13] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-28 18:22:13] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:22:14] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-28 18:22:14] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:22:14] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:22:14] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-28 18:22:15] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:22:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:22:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:22:16] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 15/5942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:22:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 10/5952 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:26] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 1/5953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 1/5954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 0/5954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/4902 variables, 1/5955 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/4902 variables, 2/5957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5957 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44016 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 881/881 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 46/46 constraints]
After SMT, in 46443ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19737 ms.
Support contains 156 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-28 18:23:04] [INFO ] Invariant cache hit.
[2024-05-28 18:23:06] [INFO ] Implicit Places using invariants in 1895 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1916 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2071 ms. Remains : 2500/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1086 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 84512 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 4
Probabilistic random walk after 84512 steps, saw 81124 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-28 18:23:10] [INFO ] Computed 900 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1969/2460 variables, 726/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2460 variables, 1969/3340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2460 variables, 0/3340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 40/2500 variables, 20/3360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2500 variables, 40/3400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 0/3400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4901 variables, 2500/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5900 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2214 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 335/491 variables, 154/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 335/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:12] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1969/2460 variables, 726/1372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2460 variables, 1969/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2460 variables, 10/3351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2460 variables, 0/3351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 40/2500 variables, 20/3371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2500 variables, 40/3411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:14] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:23:14] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 2/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2500 variables, 0/3413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2401/4901 variables, 2500/5913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4901 variables, 4/5917 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:22] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 3 ms to minimize.
[2024-05-28 18:23:23] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 18:23:23] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
[2024-05-28 18:23:23] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:23:24] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-28 18:23:24] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 18:23:24] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:23:27] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:23:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2024-05-28 18:23:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-28 18:23:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:23:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:23:29] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4901 variables, 19/5936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:31] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:23:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4901 variables, 2/5938 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4901 variables, 7/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4901 variables, 0/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/4901 variables, 0/5945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5945 constraints, problems are : Problem set: 0 solved, 4 unsolved in 30336 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 880/880 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 41/41 constraints]
After SMT, in 32628ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 34285 ms.
Support contains 156 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-28 18:24:17] [INFO ] Invariant cache hit.
[2024-05-28 18:24:18] [INFO ] Implicit Places using invariants in 1859 ms returned []
[2024-05-28 18:24:18] [INFO ] Invariant cache hit.
[2024-05-28 18:24:23] [INFO ] Implicit Places using invariants and state equation in 4360 ms returned []
Implicit Place search using SMT with State Equation took 6231 ms to find 0 implicit places.
[2024-05-28 18:24:23] [INFO ] Redundant transitions in 265 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-28 18:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2499 variables, 2499/2499 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
SMT process timed out in 31704ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 31728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38314 ms. Remains : 2500/2500 places, 2401/2401 transitions.
[2024-05-28 18:24:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 25 ms.
[2024-05-28 18:24:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12131 arcs took 18 ms.
[2024-05-28 18:24:55] [INFO ] Flatten gal took : 405 ms
Total runtime 339752 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-100A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2500
TRANSITIONS: 2401
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.071s, Sys 0.010s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.010s, 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: 1211
MODEL NAME: /home/mcc/execution/413/model
2500 places, 2401 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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 262144 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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