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-171683760001017.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 ShieldRVt-PT-040B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 489K 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 ShieldRVt-PT-040B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-040B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717083594071

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:39:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 15:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:39:55] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-30 15:39:55] [INFO ] Transformed 2003 places.
[2024-05-30 15:39:55] [INFO ] Transformed 2003 transitions.
[2024-05-30 15:39:55] [INFO ] Found NUPN structural information;
[2024-05-30 15:39:55] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA ShieldRVt-PT-040B-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 169 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 382 places :
Symmetric choice reduction at 0 with 382 rule applications. Total rules 382 place count 1621 transition count 1621
Iterating global reduction 0 with 382 rules applied. Total rules applied 764 place count 1621 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 765 place count 1620 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 766 place count 1620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 767 place count 1619 transition count 1619
Iterating global reduction 0 with 1 rules applied. Total rules applied 768 place count 1619 transition count 1619
Applied a total of 768 rules in 619 ms. Remains 1619 /2003 variables (removed 384) and now considering 1619/2003 (removed 384) transitions.
// Phase 1: matrix 1619 rows 1619 cols
[2024-05-30 15:39:56] [INFO ] Computed 161 invariants in 33 ms
[2024-05-30 15:39:57] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-30 15:39:57] [INFO ] Invariant cache hit.
[2024-05-30 15:39:58] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2024-05-30 15:39:58] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1618/3238 variables, and 0 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1619 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1618/3238 variables, and 0 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1619 constraints, PredecessorRefiner: 0/1618 constraints, Known Traps: 0/0 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 60621ms
Starting structural reductions in LTL mode, iteration 1 : 1619/2003 places, 1619/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63075 ms. Remains : 1619/2003 places, 1619/2003 transitions.
Support contains 169 out of 1619 places after structural reductions.
[2024-05-30 15:40:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 15:40:59] [INFO ] Flatten gal took : 121 ms
[2024-05-30 15:40:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-040B-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 15:40:59] [INFO ] Flatten gal took : 72 ms
[2024-05-30 15:40:59] [INFO ] Input system was already deterministic with 1619 transitions.
Support contains 163 out of 1619 places (down from 169) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2582 ms. (15 steps per ms) remains 29/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
[2024-05-30 15:41:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 846/916 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 703/1619 variables, 76/161 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1619 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1619/3238 variables, 1619/1780 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3238 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/3238 variables, 0/1780 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3238/3238 variables, and 1780 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1619/1619 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 846/916 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 41 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 4 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 4 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 4 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 3 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-30 15:41:05] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 3 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-30 15:41:06] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-30 15:41:07] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-30 15:41:07] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-30 15:41:07] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-30 15:41:07] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-30 15:41:07] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-30 15:41:08] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-30 15:41:08] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 703/1619 variables, 76/183 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-30 15:41:09] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
SMT process timed out in 9462ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 1619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 1619 transition count 1218
Reduce places removed 401 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 411 rules applied. Total rules applied 812 place count 1218 transition count 1208
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 822 place count 1208 transition count 1208
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 282 Pre rules applied. Total rules applied 822 place count 1208 transition count 926
Deduced a syphon composed of 282 places in 2 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 3 with 564 rules applied. Total rules applied 1386 place count 926 transition count 926
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1407 place count 905 transition count 905
Iterating global reduction 3 with 21 rules applied. Total rules applied 1428 place count 905 transition count 905
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 1428 place count 905 transition count 891
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1456 place count 891 transition count 891
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 4 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 3 with 712 rules applied. Total rules applied 2168 place count 535 transition count 535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2169 place count 535 transition count 534
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2171 place count 534 transition count 533
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2373 place count 433 transition count 610
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2375 place count 432 transition count 611
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2376 place count 432 transition count 610
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2380 place count 432 transition count 606
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2384 place count 428 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2385 place count 428 transition count 605
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 2388 place count 428 transition count 605
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2389 place count 428 transition count 605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2390 place count 427 transition count 604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2391 place count 426 transition count 604
Applied a total of 2391 rules in 540 ms. Remains 426 /1619 variables (removed 1193) and now considering 604/1619 (removed 1015) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 426/1619 places, 604/1619 transitions.
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
// Phase 1: matrix 604 rows 426 cols
[2024-05-30 15:41:10] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:41:10] [INFO ] State equation strengthened by 126 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 189/248 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 10/258 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 395/653 variables, 258/340 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 102/442 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 269/922 variables, 109/551 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/922 variables, 50/601 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 15/616 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/922 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 5/927 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 94/1021 variables, 49/672 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1021 variables, 19/691 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1021 variables, 7/698 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1021 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 5/1026 variables, 4/702 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1026 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1026 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 2/1028 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1028 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (OVERLAPS) 2/1030 variables, 4/710 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1030 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1030 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (OVERLAPS) 0/1030 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1030/1030 variables, and 712 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3786 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 426/426 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 189/248 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 15:41:14] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:41:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 15:41:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 10/258 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:15] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 395/653 variables, 258/345 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 102/447 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 17/464 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 269/922 variables, 109/574 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/922 variables, 50/624 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/922 variables, 15/639 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/922 variables, 7/646 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:17] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/922 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/922 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 5/927 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/927 variables, 3/654 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/927 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 94/1021 variables, 49/703 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1021 variables, 19/722 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1021 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1021 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 5/1026 variables, 4/733 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1026 variables, 3/736 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1026 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 2/1028 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1028 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 30 (OVERLAPS) 2/1030 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1030 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1030 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 33 (OVERLAPS) 0/1030 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1030/1030 variables, and 743 constraints, problems are : Problem set: 0 solved, 24 unsolved in 12143 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 426/426 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 7/7 constraints]
After SMT, in 15962ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1909 ms.
Support contains 59 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 604/604 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 426 transition count 599
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 421 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 421 transition count 597
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 419 transition count 597
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 414 transition count 592
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 412 transition count 593
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 412 transition count 590
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 409 transition count 590
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 408 transition count 589
Applied a total of 35 rules in 112 ms. Remains 408 /426 variables (removed 18) and now considering 589/604 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 408/426 places, 589/604 transitions.
RANDOM walk for 40000 steps (12 resets) in 556 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 145914 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 24
Probabilistic random walk after 145914 steps, saw 92918 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 589 rows 408 cols
[2024-05-30 15:41:32] [INFO ] Computed 160 invariants in 6 ms
[2024-05-30 15:41:32] [INFO ] State equation strengthened by 121 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 183/242 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 10/252 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 390/642 variables, 252/334 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 102/436 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 265/907 variables, 108/544 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/907 variables, 54/598 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 18/616 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 87/994 variables, 46/662 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/994 variables, 23/685 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/994 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/994 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 3/997 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/997 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/997 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/997 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 997/997 variables, and 689 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 408/408 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 183/242 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:34] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-30 15:41:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 15:41:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 10/252 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 390/642 variables, 252/337 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 102/439 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 17/456 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:35] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:41:35] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-30 15:41:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/642 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 265/907 variables, 108/567 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/907 variables, 54/621 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/907 variables, 18/639 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/907 variables, 7/646 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/907 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 87/994 variables, 46/692 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/994 variables, 23/715 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/994 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/994 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 3/997 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/997 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/997 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 24 (OVERLAPS) 0/997 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 997/997 variables, and 719 constraints, problems are : Problem set: 0 solved, 24 unsolved in 6467 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 408/408 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 6/6 constraints]
After SMT, in 8970ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1663 ms.
Support contains 59 out of 408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 589/589 transitions.
Applied a total of 0 rules in 29 ms. Remains 408 /408 variables (removed 0) and now considering 589/589 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 408/408 places, 589/589 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 408/408 places, 589/589 transitions.
Applied a total of 0 rules in 8 ms. Remains 408 /408 variables (removed 0) and now considering 589/589 (removed 0) transitions.
[2024-05-30 15:41:42] [INFO ] Invariant cache hit.
[2024-05-30 15:41:43] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-30 15:41:43] [INFO ] Invariant cache hit.
[2024-05-30 15:41:43] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-30 15:41:43] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2024-05-30 15:41:43] [INFO ] Redundant transitions in 29 ms returned []
Running 577 sub problems to find dead transitions.
[2024-05-30 15:41:43] [INFO ] Invariant cache hit.
[2024-05-30 15:41:43] [INFO ] State equation strengthened by 121 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 9/408 variables, 76/160 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-30 15:41:51] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-30 15:41:51] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 15:41:51] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 3 ms to minimize.
[2024-05-30 15:41:52] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-30 15:41:52] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 15:41:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 15:41:52] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-30 15:41:53] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-05-30 15:41:59] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 589/997 variables, 408/577 constraints. Problems are: Problem set: 0 solved, 577 unsolved
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 30192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31184 ms. Remains : 408/408 places, 589/589 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 408 vertex of which 4 / 408 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1304 edges and 406 vertex of which 404 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 111 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 400 transition count 580
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 109 edges and 399 vertex of which 2 / 399 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 398 transition count 573
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 108 edges and 397 vertex of which 2 / 397 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 24 place count 396 transition count 568
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 107 edges and 395 vertex of which 2 / 395 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 394 transition count 565
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1255 edges and 393 vertex of which 388 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 4 with 7 rules applied. Total rules applied 36 place count 388 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 36 place count 388 transition count 553
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 39 place count 386 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 42 place count 384 transition count 552
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 102 edges and 384 vertex of which 2 / 384 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 46 place count 383 transition count 549
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 48 place count 383 transition count 547
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 60 place count 383 transition count 535
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 69 place count 383 transition count 535
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 76 place count 383 transition count 528
Applied a total of 76 rules in 93 ms. Remains 383 /408 variables (removed 25) and now considering 528/589 (removed 61) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 528 rows 383 cols
[2024-05-30 15:42:14] [INFO ] Computed 148 invariants in 3 ms
[2024-05-30 15:42:14] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-30 15:42:14] [INFO ] [Nat]Absence check using 148 positive place invariants in 21 ms returned sat
[2024-05-30 15:42:15] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2024-05-30 15:42:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 15:42:15] [INFO ] After 469ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :24
TRAPS : Iteration 0
[2024-05-30 15:42:15] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-30 15:42:16] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
TRAPS : Iteration 1
[2024-05-30 15:42:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-30 15:42:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 15:42:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
TRAPS : Iteration 2
[2024-05-30 15:42:18] [INFO ] After 2954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
[2024-05-30 15:42:18] [INFO ] After 4402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Over-approximation ignoring read arcs solved 0 properties in 4737 ms.
[2024-05-30 15:42:18] [INFO ] Flatten gal took : 55 ms
[2024-05-30 15:42:18] [INFO ] Flatten gal took : 48 ms
[2024-05-30 15:42:18] [INFO ] Input system was already deterministic with 1619 transitions.
Computed a total of 497 stabilizing places and 497 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 429 place count 1618 transition count 1189
Reduce places removed 429 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 433 rules applied. Total rules applied 862 place count 1189 transition count 1185
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 866 place count 1185 transition count 1185
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 289 Pre rules applied. Total rules applied 866 place count 1185 transition count 896
Deduced a syphon composed of 289 places in 2 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 3 with 578 rules applied. Total rules applied 1444 place count 896 transition count 896
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1486 place count 854 transition count 854
Iterating global reduction 3 with 42 rules applied. Total rules applied 1528 place count 854 transition count 854
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1528 place count 854 transition count 821
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1594 place count 821 transition count 821
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 2210 place count 513 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2211 place count 513 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2213 place count 512 transition count 511
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2214 place count 512 transition count 511
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2216 place count 510 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2217 place count 509 transition count 509
Applied a total of 2217 rules in 182 ms. Remains 509 /1619 variables (removed 1110) and now considering 509/1619 (removed 1110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 182 ms. Remains : 509/1619 places, 509/1619 transitions.
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 17 ms
[2024-05-30 15:42:19] [INFO ] Input system was already deterministic with 509 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1566 transition count 1566
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1566 transition count 1566
Applied a total of 106 rules in 111 ms. Remains 1566 /1619 variables (removed 53) and now considering 1566/1619 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 1566/1619 places, 1566/1619 transitions.
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 37 ms
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 38 ms
[2024-05-30 15:42:19] [INFO ] Input system was already deterministic with 1566 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1565 transition count 1565
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1565 transition count 1565
Applied a total of 108 rules in 107 ms. Remains 1565 /1619 variables (removed 54) and now considering 1565/1619 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 1565/1619 places, 1565/1619 transitions.
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 39 ms
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:42:19] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1563 transition count 1563
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1563 transition count 1563
Applied a total of 112 rules in 116 ms. Remains 1563 /1619 variables (removed 56) and now considering 1563/1619 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 1563/1619 places, 1563/1619 transitions.
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 32 ms
[2024-05-30 15:42:19] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:42:20] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1565 transition count 1565
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1565 transition count 1565
Applied a total of 108 rules in 115 ms. Remains 1565 /1619 variables (removed 54) and now considering 1565/1619 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1565/1619 places, 1565/1619 transitions.
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 31 ms
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 31 ms
[2024-05-30 15:42:20] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 446 rules applied. Total rules applied 446 place count 1618 transition count 1172
Reduce places removed 446 places and 0 transitions.
Iterating post reduction 1 with 446 rules applied. Total rules applied 892 place count 1172 transition count 1172
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 292 Pre rules applied. Total rules applied 892 place count 1172 transition count 880
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 2 with 584 rules applied. Total rules applied 1476 place count 880 transition count 880
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1525 place count 831 transition count 831
Iterating global reduction 2 with 49 rules applied. Total rules applied 1574 place count 831 transition count 831
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 1574 place count 831 transition count 791
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 1654 place count 791 transition count 791
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Deduced a syphon composed of 306 places in 0 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 2 with 612 rules applied. Total rules applied 2266 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2267 place count 485 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2269 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2271 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2272 place count 481 transition count 481
Applied a total of 2272 rules in 145 ms. Remains 481 /1619 variables (removed 1138) and now considering 481/1619 (removed 1138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 481/1619 places, 481/1619 transitions.
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:42:20] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1568 transition count 1568
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1568 transition count 1568
Applied a total of 102 rules in 108 ms. Remains 1568 /1619 variables (removed 51) and now considering 1568/1619 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1568/1619 places, 1568/1619 transitions.
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 32 ms
[2024-05-30 15:42:20] [INFO ] Input system was already deterministic with 1568 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 446 transitions
Trivial Post-agglo rules discarded 446 transitions
Performed 446 trivial Post agglomeration. Transition count delta: 446
Iterating post reduction 0 with 446 rules applied. Total rules applied 446 place count 1618 transition count 1172
Reduce places removed 446 places and 0 transitions.
Iterating post reduction 1 with 446 rules applied. Total rules applied 892 place count 1172 transition count 1172
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 290 Pre rules applied. Total rules applied 892 place count 1172 transition count 882
Deduced a syphon composed of 290 places in 1 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 2 with 580 rules applied. Total rules applied 1472 place count 882 transition count 882
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1521 place count 833 transition count 833
Iterating global reduction 2 with 49 rules applied. Total rules applied 1570 place count 833 transition count 833
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 1570 place count 833 transition count 793
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 1650 place count 793 transition count 793
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 0 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 2266 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2267 place count 485 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2269 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2271 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2272 place count 481 transition count 481
Applied a total of 2272 rules in 145 ms. Remains 481 /1619 variables (removed 1138) and now considering 481/1619 (removed 1138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 481/1619 places, 481/1619 transitions.
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:42:20] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:42:20] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 439 transitions
Trivial Post-agglo rules discarded 439 transitions
Performed 439 trivial Post agglomeration. Transition count delta: 439
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1618 transition count 1179
Reduce places removed 439 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 441 rules applied. Total rules applied 880 place count 1179 transition count 1177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 882 place count 1177 transition count 1177
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 289 Pre rules applied. Total rules applied 882 place count 1177 transition count 888
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 3 with 578 rules applied. Total rules applied 1460 place count 888 transition count 888
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1507 place count 841 transition count 841
Iterating global reduction 3 with 47 rules applied. Total rules applied 1554 place count 841 transition count 841
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1554 place count 841 transition count 803
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1630 place count 803 transition count 803
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 616 rules applied. Total rules applied 2246 place count 495 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2247 place count 495 transition count 494
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2249 place count 494 transition count 493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2251 place count 492 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2252 place count 491 transition count 491
Applied a total of 2252 rules in 124 ms. Remains 491 /1619 variables (removed 1128) and now considering 491/1619 (removed 1128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 124 ms. Remains : 491/1619 places, 491/1619 transitions.
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 12 ms
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 12 ms
[2024-05-30 15:42:21] [INFO ] Input system was already deterministic with 491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1567 transition count 1567
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1567 transition count 1567
Applied a total of 104 rules in 108 ms. Remains 1567 /1619 variables (removed 52) and now considering 1567/1619 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1567/1619 places, 1567/1619 transitions.
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 36 ms
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 28 ms
[2024-05-30 15:42:21] [INFO ] Input system was already deterministic with 1567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1573 transition count 1573
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1573 transition count 1573
Applied a total of 92 rules in 110 ms. Remains 1573 /1619 variables (removed 46) and now considering 1573/1619 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 1573/1619 places, 1573/1619 transitions.
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 40 ms
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:42:21] [INFO ] Input system was already deterministic with 1573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1619/1619 places, 1619/1619 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1618 transition count 1181
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1181 transition count 1180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1180 transition count 1180
Performed 291 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 291 Pre rules applied. Total rules applied 876 place count 1180 transition count 889
Deduced a syphon composed of 291 places in 1 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 3 with 582 rules applied. Total rules applied 1458 place count 889 transition count 889
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1500 place count 847 transition count 847
Iterating global reduction 3 with 42 rules applied. Total rules applied 1542 place count 847 transition count 847
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1542 place count 847 transition count 811
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1614 place count 811 transition count 811
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2240 place count 498 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2241 place count 498 transition count 497
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2243 place count 497 transition count 496
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2245 place count 497 transition count 496
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2247 place count 495 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2248 place count 494 transition count 494
Applied a total of 2248 rules in 125 ms. Remains 494 /1619 variables (removed 1125) and now considering 494/1619 (removed 1125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 494/1619 places, 494/1619 transitions.
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:42:21] [INFO ] Input system was already deterministic with 494 transitions.
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 30 ms
[2024-05-30 15:42:21] [INFO ] Flatten gal took : 31 ms
[2024-05-30 15:42:21] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-30 15:42:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1619 places, 1619 transitions and 3958 arcs took 7 ms.
Total runtime 146684 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-040B

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: 1619
TRANSITIONS: 1619
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 758
MODEL NAME: /home/mcc/execution/413/model
1619 places, 1619 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="ShieldRVt-PT-040B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldRVt-PT-040B, examination is CTLCardinality"
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-171683760001017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;