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-171683758500302.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 ShieldIIPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 512K 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 ShieldIIPt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716937259156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 23:01:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 23:01:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:01:00] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-05-28 23:01:00] [INFO ] Transformed 2103 places.
[2024-05-28 23:01:00] [INFO ] Transformed 1953 transitions.
[2024-05-28 23:01:00] [INFO ] Found NUPN structural information;
[2024-05-28 23:01:00] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1856 ms. (21 steps per ms) remains 9/15 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1100 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
// Phase 1: matrix 1953 rows 2103 cols
[2024-05-28 23:01:02] [INFO ] Computed 271 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1909/2045 variables, 262/398 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2045 variables, 1909/2307 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2045 variables, 0/2307 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 58/2103 variables, 9/2316 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2103 variables, 58/2374 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2103 variables, 0/2374 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1953/4056 variables, 2103/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4056/4056 variables, and 4477 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3056 ms.
Refiners :[Domain max(s): 2103/2103 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 2103/2103 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07 is UNSAT
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1915/2045 variables, 262/392 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2045 variables, 1915/2307 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-28 23:01:06] [INFO ] Deduced a trap composed of 12 places in 450 ms of which 75 ms to minimize.
[2024-05-28 23:01:06] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 9 ms to minimize.
[2024-05-28 23:01:07] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 6 ms to minimize.
[2024-05-28 23:01:07] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 6 ms to minimize.
[2024-05-28 23:01:07] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 6 ms to minimize.
[2024-05-28 23:01:08] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 6 ms to minimize.
[2024-05-28 23:01:08] [INFO ] Deduced a trap composed of 20 places in 304 ms of which 6 ms to minimize.
[2024-05-28 23:01:08] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 5 ms to minimize.
[2024-05-28 23:01:09] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 7 ms to minimize.
[2024-05-28 23:01:09] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 5 ms to minimize.
[2024-05-28 23:01:09] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 5 ms to minimize.
[2024-05-28 23:01:10] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 6 ms to minimize.
[2024-05-28 23:01:10] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 5 ms to minimize.
[2024-05-28 23:01:10] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 6 ms to minimize.
SMT process timed out in 8422ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 2103 transition count 1515
Reduce places removed 438 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 452 rules applied. Total rules applied 890 place count 1665 transition count 1501
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 904 place count 1651 transition count 1501
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 904 place count 1651 transition count 1371
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 1164 place count 1521 transition count 1371
Discarding 188 places :
Symmetric choice reduction at 3 with 188 rule applications. Total rules 1352 place count 1333 transition count 1183
Iterating global reduction 3 with 188 rules applied. Total rules applied 1540 place count 1333 transition count 1183
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 1540 place count 1333 transition count 1104
Deduced a syphon composed of 79 places in 6 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 1698 place count 1254 transition count 1104
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2598 place count 804 transition count 654
Renaming transitions due to excessive name length > 1024 char.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2754 place count 726 transition count 699
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2755 place count 726 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2756 place count 726 transition count 697
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2762 place count 726 transition count 691
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2768 place count 720 transition count 691
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 2791 place count 720 transition count 691
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2792 place count 720 transition count 691
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2793 place count 719 transition count 690
Applied a total of 2793 rules in 743 ms. Remains 719 /2103 variables (removed 1384) and now considering 690/1953 (removed 1263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 719/2103 places, 690/1953 transitions.
RANDOM walk for 40000 steps (8 resets) in 470 ms. (84 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
// Phase 1: matrix 690 rows 719 cols
[2024-05-28 23:01:11] [INFO ] Computed 271 invariants in 3 ms
[2024-05-28 23:01:11] [INFO ] State equation strengthened by 216 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 606/699 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/717 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 689/1406 variables, 717/987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1406 variables, 215/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1406 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/1409 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1409 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1409 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1409 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1409 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 1206 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 719/719 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 606/699 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 23:01:13] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:14] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-28 23:01:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/717 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 689/1406 variables, 717/1015 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1406 variables, 215/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1406 variables, 5/1235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:01:17] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-28 23:01:17] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1406 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1406 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1409 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1409 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1409 variables, 1/1242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1409 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:19] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1409 variables, 1/1244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1409 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1409 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 1244 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8639 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 719/719 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 32/32 constraints]
After SMT, in 9925ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6365 ms.
Support contains 93 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 719 transition count 684
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 713 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 712 transition count 683
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 30 place count 704 transition count 675
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 702 transition count 675
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 702 transition count 673
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 700 transition count 673
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 700 transition count 673
Applied a total of 40 rules in 147 ms. Remains 700 /719 variables (removed 19) and now considering 673/690 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 700/719 places, 673/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 177290 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 6
Probabilistic random walk after 177290 steps, saw 101366 distinct states, run finished after 3021 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 673 rows 700 cols
[2024-05-28 23:01:31] [INFO ] Computed 271 invariants in 3 ms
[2024-05-28 23:01:31] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/698 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/698 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 672/1370 variables, 698/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 219/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1370 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/1373 variables, 2/1189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1373 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1373 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1373 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1373 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1373/1373 variables, and 1191 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 700/700 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 2 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:01:33] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 6 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 19/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-28 23:01:34] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:01:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/698 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 672/1370 variables, 698/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1370 variables, 219/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1370 variables, 5/1221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:37] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:01:37] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 2/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1370 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1373 variables, 2/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1373 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1373 variables, 1/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1373 variables, 1/1228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:38] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 3 ms to minimize.
[2024-05-28 23:01:39] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1373 variables, 2/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1373 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1373 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1373/1373 variables, and 1230 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7122 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 700/700 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 8371ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3300 ms.
Support contains 93 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 673/673 transitions.
Applied a total of 0 rules in 26 ms. Remains 700 /700 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 700/700 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 673/673 transitions.
Applied a total of 0 rules in 13 ms. Remains 700 /700 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-05-28 23:01:43] [INFO ] Invariant cache hit.
[2024-05-28 23:01:44] [INFO ] Implicit Places using invariants in 406 ms returned [684]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 699/700 places, 673/673 transitions.
Applied a total of 0 rules in 13 ms. Remains 699 /699 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 440 ms. Remains : 699/700 places, 673/673 transitions.
RANDOM walk for 40000 steps (8 resets) in 464 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 163833 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 6
Probabilistic random walk after 163833 steps, saw 93166 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 673 rows 699 cols
[2024-05-28 23:01:47] [INFO ] Computed 270 invariants in 2 ms
[2024-05-28 23:01:47] [INFO ] State equation strengthened by 218 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 17/697 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 672/1369 variables, 697/966 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1369 variables, 217/1183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1369 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/1372 variables, 2/1185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1372 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1372 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1372 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1372 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 1187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 699/699 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-28 23:01:49] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-28 23:01:50] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 17/697 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:01:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 672/1369 variables, 697/995 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 217/1212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 5/1217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:54] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-28 23:01:54] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2024-05-28 23:01:54] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 3/1220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 23:01:55] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-28 23:01:55] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1369 variables, 2/1222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1369 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/1372 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1372 variables, 1/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1372 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1372 variables, 1/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1372 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1372 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 1227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8748 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 699/699 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 34/34 constraints]
After SMT, in 10036ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3043 ms.
Support contains 93 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 673/673 transitions.
Applied a total of 0 rules in 27 ms. Remains 699 /699 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 699/699 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 673/673 transitions.
Applied a total of 0 rules in 13 ms. Remains 699 /699 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-05-28 23:02:00] [INFO ] Invariant cache hit.
[2024-05-28 23:02:01] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-28 23:02:01] [INFO ] Invariant cache hit.
[2024-05-28 23:02:01] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-28 23:02:02] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2024-05-28 23:02:02] [INFO ] Redundant transitions in 47 ms returned []
Running 671 sub problems to find dead transitions.
[2024-05-28 23:02:02] [INFO ] Invariant cache hit.
[2024-05-28 23:02:02] [INFO ] State equation strengthened by 218 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (OVERLAPS) 2/699 variables, 269/270 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 23:02:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-28 23:02:15] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-28 23:02:16] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 23:02:17] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 23:02:24] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-28 23:02:24] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 23:02:24] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 23:02:25] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 23:02:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-28 23:02:26] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-28 23:02:26] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 23:02:26] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-28 23:02:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-28 23:02:27] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 23:02:30] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 23:02:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-28 23:02:31] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 23:02:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/1372 variables, and 314 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/699 constraints, ReadFeed: 0/218 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (OVERLAPS) 2/699 variables, 269/270 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 44/314 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 23:02:45] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-28 23:02:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 23:02:47] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 23:02:48] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 7 (OVERLAPS) 673/1372 variables, 699/1017 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1372 variables, 218/1235 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 1906 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 699/699 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 48/48 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62352 ms. Remains : 699/699 places, 673/673 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 108 times.
Drop transitions (Partial Free agglomeration) removed 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 108 place count 699 transition count 673
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 699 transition count 671
Applied a total of 110 rules in 33 ms. Remains 699 /699 variables (removed 0) and now considering 671/673 (removed 2) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 671 rows 699 cols
[2024-05-28 23:03:03] [INFO ] Computed 270 invariants in 4 ms
[2024-05-28 23:03:03] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 23:03:03] [INFO ] [Nat]Absence check using 270 positive place invariants in 40 ms returned sat
[2024-05-28 23:03:04] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-28 23:03:04] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-28 23:03:04] [INFO ] After 440ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-28 23:03:04] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-05-28 23:03:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-28 23:03:04] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-28 23:03:04] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-28 23:03:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:03:06] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2611 ms
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-28 23:03:07] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 863 ms
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-28 23:03:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 381 ms
TRAPS : Iteration 1
[2024-05-28 23:03:09] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-28 23:03:09] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-28 23:03:09] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-28 23:03:09] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-28 23:03:09] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-28 23:03:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 635 ms
TRAPS : Iteration 2
[2024-05-28 23:03:10] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-28 23:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-28 23:03:10] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 23:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-05-28 23:03:11] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-28 23:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
TRAPS : Iteration 3
[2024-05-28 23:03:11] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-28 23:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
TRAPS : Iteration 4
[2024-05-28 23:03:12] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-28 23:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-28 23:03:12] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-28 23:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-28 23:03:12] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-28 23:03:13] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-28 23:03:13] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-28 23:03:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
TRAPS : Iteration 5
[2024-05-28 23:03:13] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 23:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
TRAPS : Iteration 6
[2024-05-28 23:03:14] [INFO ] After 10613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-28 23:03:15] [INFO ] After 11923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 12140 ms.
[2024-05-28 23:03:15] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-28 23:03:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 699 places, 673 transitions and 3124 arcs took 7 ms.
[2024-05-28 23:03:15] [INFO ] Flatten gal took : 94 ms
Total runtime 135164 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-030B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 699
TRANSITIONS: 673
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.005s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1241
MODEL NAME: /home/mcc/execution/412/model
699 places, 673 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 ReachabilityCardinality -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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758500302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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