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.r575-smll-171734919700169.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 MedleyA-PT-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K Jun 2 16:33 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 MedleyA-PT-22-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-22-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717382420438

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 02:40:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 02:40:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 02:40:22] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-06-03 02:40:22] [INFO ] Transformed 307 places.
[2024-06-03 02:40:22] [INFO ] Transformed 740 transitions.
[2024-06-03 02:40:22] [INFO ] Found NUPN structural information;
[2024-06-03 02:40:22] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 105 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 304 transition count 740
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 67 place count 240 transition count 665
Iterating global reduction 1 with 64 rules applied. Total rules applied 131 place count 240 transition count 665
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 136 place count 240 transition count 660
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 141 place count 235 transition count 651
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 235 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 234 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 234 transition count 649
Applied a total of 148 rules in 119 ms. Remains 234 /307 variables (removed 73) and now considering 649/740 (removed 91) transitions.
// Phase 1: matrix 649 rows 234 cols
[2024-06-03 02:40:23] [INFO ] Computed 22 invariants in 38 ms
[2024-06-03 02:40:23] [INFO ] Implicit Places using invariants in 635 ms returned []
[2024-06-03 02:40:23] [INFO ] Invariant cache hit.
[2024-06-03 02:40:24] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Running 648 sub problems to find dead transitions.
[2024-06-03 02:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 648 unsolved
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/233 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:40:36] [INFO ] Deduced a trap composed of 43 places in 224 ms of which 29 ms to minimize.
[2024-06-03 02:40:36] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 2 ms to minimize.
[2024-06-03 02:40:36] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 2 ms to minimize.
[2024-06-03 02:40:37] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
[2024-06-03 02:40:37] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 2 ms to minimize.
[2024-06-03 02:40:37] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-06-03 02:40:37] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-06-03 02:40:37] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-06-03 02:40:38] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 4 ms to minimize.
[2024-06-03 02:40:38] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-06-03 02:40:38] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2024-06-03 02:40:39] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-06-03 02:40:40] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 19/41 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:40:47] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/42 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:40:51] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2024-06-03 02:40:51] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/44 constraints. Problems are: Problem set: 144 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 233/883 variables, and 44 constraints, problems are : Problem set: 144 solved, 504 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/234 constraints, PredecessorRefiner: 648/648 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 144 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 22/44 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:41:02] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 2 ms to minimize.
[2024-06-03 02:41:02] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 2/46 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:41:06] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-06-03 02:41:06] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/48 constraints. Problems are: Problem set: 144 solved, 504 unsolved
[2024-06-03 02:41:10] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-06-03 02:41:10] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 3 ms to minimize.
[2024-06-03 02:41:10] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 3 ms to minimize.
[2024-06-03 02:41:10] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 4/52 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/52 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 649/882 variables, 233/285 constraints. Problems are: Problem set: 144 solved, 504 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/882 variables, 503/788 constraints. Problems are: Problem set: 144 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 882/883 variables, and 788 constraints, problems are : Problem set: 144 solved, 504 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 233/234 constraints, PredecessorRefiner: 503/648 constraints, Known Traps: 30/30 constraints]
After SMT, in 63005ms problems are : Problem set: 144 solved, 504 unsolved
Search for dead transitions found 144 dead transitions in 63054ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 234/307 places, 505/740 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64577 ms. Remains : 234/307 places, 505/740 transitions.
Support contains 85 out of 234 places after structural reductions.
[2024-06-03 02:41:27] [INFO ] Flatten gal took : 121 ms
[2024-06-03 02:41:27] [INFO ] Flatten gal took : 67 ms
[2024-06-03 02:41:28] [INFO ] Input system was already deterministic with 505 transitions.
Support contains 78 out of 234 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (1169 resets) in 3319 ms. (12 steps per ms) remains 30/52 properties
BEST_FIRST walk for 4001 steps (25 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (23 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (22 resets) in 49 ms. (80 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (22 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (23 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
// Phase 1: matrix 505 rows 234 cols
[2024-06-03 02:41:29] [INFO ] Computed 22 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 85/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 75/203 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 6/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 492/701 variables, 209/227 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 31/732 variables, 19/246 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 2/734 variables, 4/250 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/734 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 5/739 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/739 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/739 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 256 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 85/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-03 02:41:32] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-06-03 02:41:32] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 75/203 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-03 02:41:33] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 2 ms to minimize.
[2024-06-03 02:41:33] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-06-03 02:41:33] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-06-03 02:41:33] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-06-03 02:41:33] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-06-03 02:41:34] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 2 ms to minimize.
[2024-06-03 02:41:34] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-06-03 02:41:34] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 4 ms to minimize.
[2024-06-03 02:41:34] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 3 ms to minimize.
[2024-06-03 02:41:35] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
[2024-06-03 02:41:35] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-06-03 02:41:35] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-06-03 02:41:35] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
[2024-06-03 02:41:36] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 3 ms to minimize.
[2024-06-03 02:41:36] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
[2024-06-03 02:41:36] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-03 02:41:36] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-03 02:41:36] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 5 ms to minimize.
[2024-06-03 02:41:37] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 4 ms to minimize.
[2024-06-03 02:41:37] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-03 02:41:37] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 3 ms to minimize.
SMT process timed out in 8023ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 233 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 233 transition count 488
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 218 transition count 483
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 42 place count 213 transition count 483
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 42 place count 213 transition count 479
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 209 transition count 479
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 67 place count 192 transition count 447
Iterating global reduction 3 with 17 rules applied. Total rules applied 84 place count 192 transition count 447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 84 place count 192 transition count 446
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 191 transition count 446
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 187 transition count 430
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 187 transition count 430
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 186 transition count 428
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 186 transition count 428
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 138 place count 165 transition count 407
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 162 transition count 404
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 162 transition count 404
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 151 transition count 525
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 182 place count 151 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 4 with 97 rules applied. Total rules applied 279 place count 151 transition count 412
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 281 place count 150 transition count 423
Free-agglomeration rule (complex) applied 16 times with reduction of 8 identical transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 297 place count 150 transition count 625
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 324 place count 134 transition count 614
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 134 transition count 614
Applied a total of 325 rules in 396 ms. Remains 134 /234 variables (removed 100) and now considering 614/505 (removed -109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 134/234 places, 614/505 transitions.
RANDOM walk for 40000 steps (3281 resets) in 1391 ms. (28 steps per ms) remains 5/26 properties
BEST_FIRST walk for 40003 steps (788 resets) in 798 ms. (50 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (813 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (727 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (750 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
[2024-06-03 02:41:38] [INFO ] Flow matrix only has 610 transitions (discarded 4 similar events)
// Phase 1: matrix 610 rows 134 cols
[2024-06-03 02:41:38] [INFO ] Computed 23 invariants in 5 ms
[2024-06-03 02:41:38] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/73 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 51/124 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 609/740 variables, 131/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 217/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/744 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/744 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/744 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/744 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 394 constraints, problems are : Problem set: 0 solved, 4 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/73 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 51/124 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 02:41:39] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 1 ms to minimize.
[2024-06-03 02:41:40] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 2 ms to minimize.
[2024-06-03 02:41:40] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-06-03 02:41:40] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 2 ms to minimize.
[2024-06-03 02:41:40] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/131 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 02:41:40] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 609/740 variables, 131/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/740 variables, 217/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/740 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/740 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 4/744 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/744 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 02:41:42] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/744 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/744 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/744 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 405 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 4866ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 967 ms.
Support contains 12 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 614/614 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 134 transition count 609
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 129 transition count 609
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 129 transition count 608
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 128 transition count 608
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 27 place count 113 transition count 513
Iterating global reduction 2 with 15 rules applied. Total rules applied 42 place count 113 transition count 513
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 110 transition count 500
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 110 transition count 500
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 66 place count 100 transition count 492
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 97 transition count 476
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 97 transition count 476
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 94 transition count 503
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 93 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 93 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 104 place count 93 transition count 471
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 93 transition count 517
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 90 transition count 517
Applied a total of 110 rules in 116 ms. Remains 90 /134 variables (removed 44) and now considering 517/614 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 90/134 places, 517/614 transitions.
RANDOM walk for 40000 steps (4126 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (998 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1022 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (899 resets) in 174 ms. (228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (894 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
[2024-06-03 02:41:45] [INFO ] Flow matrix only has 513 transitions (discarded 4 similar events)
// Phase 1: matrix 513 rows 90 cols
[2024-06-03 02:41:45] [INFO ] Computed 21 invariants in 5 ms
[2024-06-03 02:41:45] [INFO ] State equation strengthened by 280 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/67 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/85 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 512/599 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 280/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/602 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/603 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/603 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 391 constraints, problems are : Problem set: 0 solved, 3 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/67 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/85 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 512/599 variables, 87/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 280/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/602 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/603 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/603 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 394 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 90/90 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1729ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 238 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 517/517 transitions.
Graph (complete) has 524 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 86 transition count 514
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 86 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 85 transition count 513
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 83 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 83 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 82 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 82 transition count 468
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 78 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 77 transition count 465
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 77 transition count 552
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 50 place count 74 transition count 530
Applied a total of 50 rules in 49 ms. Remains 74 /90 variables (removed 16) and now considering 530/517 (removed -13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 74/90 places, 530/517 transitions.
RANDOM walk for 40000 steps (5645 resets) in 427 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1253 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 915137 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 1
Probabilistic random walk after 915137 steps, saw 175909 distinct states, run finished after 3011 ms. (steps per millisecond=303 ) properties seen :0
[2024-06-03 02:41:50] [INFO ] Flow matrix only has 526 transitions (discarded 4 similar events)
// Phase 1: matrix 526 rows 74 cols
[2024-06-03 02:41:50] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 02:41:50] [INFO ] State equation strengthened by 293 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/63 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 526/599 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 293/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/600 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/600 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 387 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/63 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/73 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 526/599 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 293/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/600 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/600 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 911ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 530/530 transitions.
Applied a total of 0 rules in 13 ms. Remains 74 /74 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 74/74 places, 530/530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 530/530 transitions.
Applied a total of 0 rules in 14 ms. Remains 74 /74 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2024-06-03 02:41:51] [INFO ] Flow matrix only has 526 transitions (discarded 4 similar events)
[2024-06-03 02:41:51] [INFO ] Invariant cache hit.
[2024-06-03 02:41:51] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-03 02:41:51] [INFO ] Flow matrix only has 526 transitions (discarded 4 similar events)
[2024-06-03 02:41:51] [INFO ] Invariant cache hit.
[2024-06-03 02:41:51] [INFO ] State equation strengthened by 293 read => feed constraints.
[2024-06-03 02:41:52] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2024-06-03 02:41:52] [INFO ] Redundant transitions in 37 ms returned []
Running 526 sub problems to find dead transitions.
[2024-06-03 02:41:52] [INFO ] Flow matrix only has 526 transitions (discarded 4 similar events)
[2024-06-03 02:41:52] [INFO ] Invariant cache hit.
[2024-06-03 02:41:52] [INFO ] State equation strengthened by 293 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-03 02:41:57] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-06-03 02:41:58] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (OVERLAPS) 526/600 variables, 74/96 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 293/389 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 8 (OVERLAPS) 0/600 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 526 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 389 constraints, problems are : Problem set: 0 solved, 526 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 526 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (OVERLAPS) 526/600 variables, 74/96 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 293/389 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 526/915 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 915 constraints, problems are : Problem set: 0 solved, 526 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, ReadFeed: 293/293 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 2/2 constraints]
After SMT, in 61582ms problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 61588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62592 ms. Remains : 74/74 places, 530/530 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 469 edges and 74 vertex of which 65 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 65 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 63 transition count 419
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 63 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 60 place count 63 transition count 403
Free-agglomeration rule (complex) applied 4 times with reduction of 63 identical transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 63 transition count 493
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 59 transition count 493
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 85 place count 59 transition count 493
Applied a total of 85 rules in 62 ms. Remains 59 /74 variables (removed 15) and now considering 493/530 (removed 37) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 493 rows 59 cols
[2024-06-03 02:42:53] [INFO ] Computed 14 invariants in 7 ms
[2024-06-03 02:42:54] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 02:42:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-03 02:42:54] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 12 ms returned sat
[2024-06-03 02:42:54] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 02:42:54] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 02:42:54] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 558 ms.
[2024-06-03 02:42:54] [INFO ] Flatten gal took : 49 ms
[2024-06-03 02:42:54] [INFO ] Flatten gal took : 49 ms
[2024-06-03 02:42:54] [INFO ] Input system was already deterministic with 505 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 194 transition count 442
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 194 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 194 transition count 438
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 176 transition count 390
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 176 transition count 390
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 168 transition count 369
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 168 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 139 place count 165 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 142 place count 165 transition count 360
Applied a total of 142 rules in 15 ms. Remains 165 /234 variables (removed 69) and now considering 360/505 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 165/234 places, 360/505 transitions.
[2024-06-03 02:42:54] [INFO ] Flatten gal took : 29 ms
[2024-06-03 02:42:54] [INFO ] Flatten gal took : 30 ms
[2024-06-03 02:42:54] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 196 transition count 449
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 196 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 196 transition count 446
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 92 place count 182 transition count 411
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 182 transition count 411
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 176 transition count 395
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 176 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 175 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 175 transition count 392
Applied a total of 120 rules in 13 ms. Remains 175 /234 variables (removed 59) and now considering 392/505 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 175/234 places, 392/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 28 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 196 transition count 447
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 196 transition count 447
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 196 transition count 444
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 92 place count 182 transition count 409
Iterating global reduction 2 with 14 rules applied. Total rules applied 106 place count 182 transition count 409
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 176 transition count 393
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 176 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 174 transition count 387
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 174 transition count 387
Applied a total of 122 rules in 15 ms. Remains 174 /234 variables (removed 60) and now considering 387/505 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 174/234 places, 387/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 29 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 192 transition count 442
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 192 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 192 transition count 438
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 103 place count 176 transition count 395
Iterating global reduction 2 with 16 rules applied. Total rules applied 119 place count 176 transition count 395
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 127 place count 168 transition count 374
Iterating global reduction 2 with 8 rules applied. Total rules applied 135 place count 168 transition count 374
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 165 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 165 transition count 365
Applied a total of 141 rules in 12 ms. Remains 165 /234 variables (removed 69) and now considering 365/505 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 165/234 places, 365/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 230 transition count 472
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 200 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 199 transition count 471
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 63 place count 199 transition count 467
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 195 transition count 467
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 107 place count 159 transition count 408
Iterating global reduction 3 with 36 rules applied. Total rules applied 143 place count 159 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 143 place count 159 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 156 transition count 405
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 166 place count 139 transition count 360
Iterating global reduction 3 with 17 rules applied. Total rules applied 183 place count 139 transition count 360
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 133 transition count 344
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 131 transition count 338
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 131 transition count 338
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 246 place count 106 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 249 place count 106 transition count 313
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 256 place count 99 transition count 298
Iterating global reduction 4 with 7 rules applied. Total rules applied 263 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 99 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 272 place count 96 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 274 place count 94 transition count 290
Applied a total of 274 rules in 88 ms. Remains 94 /234 variables (removed 140) and now considering 290/505 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 94/234 places, 290/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 198 transition count 452
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 198 transition count 452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 198 transition count 449
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 87 place count 185 transition count 413
Iterating global reduction 2 with 13 rules applied. Total rules applied 100 place count 185 transition count 413
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 107 place count 178 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 114 place count 178 transition count 394
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 176 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 176 transition count 388
Applied a total of 118 rules in 13 ms. Remains 176 /234 variables (removed 58) and now considering 388/505 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 176/234 places, 388/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 22 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 25 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 190 transition count 439
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 190 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 190 transition count 435
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 109 place count 172 transition count 387
Iterating global reduction 2 with 18 rules applied. Total rules applied 127 place count 172 transition count 387
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 136 place count 163 transition count 363
Iterating global reduction 2 with 9 rules applied. Total rules applied 145 place count 163 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 160 transition count 354
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 160 transition count 354
Applied a total of 151 rules in 12 ms. Remains 160 /234 variables (removed 74) and now considering 354/505 (removed 151) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 160/234 places, 354/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 23 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 230 transition count 470
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 65 place count 198 transition count 466
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 194 transition count 466
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 108 place count 159 transition count 408
Iterating global reduction 2 with 35 rules applied. Total rules applied 143 place count 159 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 143 place count 159 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 156 transition count 405
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 165 place count 140 transition count 361
Iterating global reduction 2 with 16 rules applied. Total rules applied 181 place count 140 transition count 361
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 187 place count 134 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 193 place count 134 transition count 345
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 195 place count 132 transition count 339
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 132 transition count 339
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 243 place count 108 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 246 place count 108 transition count 314
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 254 place count 100 transition count 296
Iterating global reduction 3 with 8 rules applied. Total rules applied 262 place count 100 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 100 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 97 transition count 290
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 95 transition count 288
Applied a total of 273 rules in 64 ms. Remains 95 /234 variables (removed 139) and now considering 288/505 (removed 217) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 95/234 places, 288/505 transitions.
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:42:55] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:42:55] [INFO ] Input system was already deterministic with 288 transitions.
RANDOM walk for 28310 steps (2988 resets) in 153 ms. (183 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 39 place count 195 transition count 444
Iterating global reduction 1 with 38 rules applied. Total rules applied 77 place count 195 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 195 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 95 place count 179 transition count 400
Iterating global reduction 2 with 16 rules applied. Total rules applied 111 place count 179 transition count 400
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 173 transition count 384
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 173 transition count 384
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 171 transition count 378
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 171 transition count 378
Applied a total of 127 rules in 12 ms. Remains 171 /234 variables (removed 63) and now considering 378/505 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 171/234 places, 378/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 21 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 193 transition count 446
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 193 transition count 446
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 193 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 177 transition count 401
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 177 transition count 401
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 169 transition count 380
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 169 transition count 380
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 166 transition count 371
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 166 transition count 371
Applied a total of 139 rules in 13 ms. Remains 166 /234 variables (removed 68) and now considering 371/505 (removed 134) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 166/234 places, 371/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 371 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 44 place count 190 transition count 439
Iterating global reduction 1 with 43 rules applied. Total rules applied 87 place count 190 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 190 transition count 435
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 108 place count 173 transition count 388
Iterating global reduction 2 with 17 rules applied. Total rules applied 125 place count 173 transition count 388
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 164 transition count 364
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 164 transition count 364
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 161 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 161 transition count 355
Applied a total of 149 rules in 14 ms. Remains 161 /234 variables (removed 73) and now considering 355/505 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 161/234 places, 355/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 230 transition count 471
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 199 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 198 transition count 466
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 194 transition count 466
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 104 place count 163 transition count 415
Iterating global reduction 3 with 31 rules applied. Total rules applied 135 place count 163 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 163 transition count 413
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 161 transition count 413
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 155 place count 145 transition count 372
Iterating global reduction 3 with 16 rules applied. Total rules applied 171 place count 145 transition count 372
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 140 transition count 359
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 140 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 138 transition count 353
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 138 transition count 353
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 232 place count 113 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 235 place count 113 transition count 328
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 243 place count 105 transition count 310
Iterating global reduction 4 with 8 rules applied. Total rules applied 251 place count 105 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 105 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 102 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 262 place count 100 transition count 302
Applied a total of 262 rules in 58 ms. Remains 100 /234 variables (removed 134) and now considering 302/505 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 100/234 places, 302/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 15 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 17 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Graph (complete) has 956 edges and 234 vertex of which 231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 230 transition count 472
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 200 transition count 470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 198 transition count 470
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 65 place count 198 transition count 467
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 195 transition count 467
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 103 place count 163 transition count 416
Iterating global reduction 3 with 32 rules applied. Total rules applied 135 place count 163 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 163 transition count 414
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 161 transition count 414
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 153 place count 147 transition count 373
Iterating global reduction 3 with 14 rules applied. Total rules applied 167 place count 147 transition count 373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 173 place count 141 transition count 357
Iterating global reduction 3 with 6 rules applied. Total rules applied 179 place count 141 transition count 357
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 139 transition count 351
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 139 transition count 351
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 230 place count 115 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 233 place count 115 transition count 325
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 240 place count 108 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 247 place count 108 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 108 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 106 transition count 305
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 104 transition count 303
Applied a total of 256 rules in 65 ms. Remains 104 /234 variables (removed 130) and now considering 303/505 (removed 202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 104/234 places, 303/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 16 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 18 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 505/505 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 505
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 42 place count 192 transition count 442
Iterating global reduction 1 with 41 rules applied. Total rules applied 83 place count 192 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 192 transition count 438
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 177 transition count 397
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 177 transition count 397
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 124 place count 170 transition count 379
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 170 transition count 379
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 167 transition count 370
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 167 transition count 370
Applied a total of 137 rules in 16 ms. Remains 167 /234 variables (removed 67) and now considering 370/505 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 167/234 places, 370/505 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 19 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 20 ms
[2024-06-03 02:42:56] [INFO ] Input system was already deterministic with 370 transitions.
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 26 ms
[2024-06-03 02:42:56] [INFO ] Flatten gal took : 26 ms
[2024-06-03 02:42:56] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-03 02:42:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 234 places, 505 transitions and 2465 arcs took 7 ms.
Total runtime 154595 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-22

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 234
TRANSITIONS: 505
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.017s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/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: 804
MODEL NAME: /home/mcc/execution/411/model
234 places, 505 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r575-smll-171734919700169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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