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.r553-tall-171734901300266.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 ltsminxred
Input is FireWire-PT-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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 FireWire-PT-13-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-13-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355579244

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:13:00] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-02 19:13:00] [INFO ] Transformed 205 places.
[2024-06-02 19:13:00] [INFO ] Transformed 610 transitions.
[2024-06-02 19:13:00] [INFO ] Found NUPN structural information;
[2024-06-02 19:13:00] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Support contains 88 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 203 transition count 538
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 203 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 203 transition count 537
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 534
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 202 transition count 528
Applied a total of 13 rules in 48 ms. Remains 202 /205 variables (removed 3) and now considering 528/542 (removed 14) transitions.
[2024-06-02 19:13:00] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 202 cols
[2024-06-02 19:13:00] [INFO ] Computed 10 invariants in 19 ms
[2024-06-02 19:13:01] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-02 19:13:01] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
[2024-06-02 19:13:01] [INFO ] Invariant cache hit.
[2024-06-02 19:13:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 19:13:01] [INFO ] Implicit Places using invariants and state equation in 471 ms returned [21, 85, 149]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 763 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/205 places, 528/542 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 833 ms. Remains : 199/205 places, 528/542 transitions.
Support contains 88 out of 199 places after structural reductions.
[2024-06-02 19:13:01] [INFO ] Flatten gal took : 69 ms
[2024-06-02 19:13:01] [INFO ] Flatten gal took : 37 ms
[2024-06-02 19:13:01] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 85 out of 199 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (1134 resets) in 3028 ms. (13 steps per ms) remains 33/71 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (25 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (24 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (26 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (28 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (24 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (17 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
[2024-06-02 19:13:03] [INFO ] Flow matrix only has 496 transitions (discarded 32 similar events)
// Phase 1: matrix 496 rows 199 cols
[2024-06-02 19:13:03] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:13:03] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/176 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 23 unsolved
[2024-06-02 19:13:03] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 8 ms to minimize.
[2024-06-02 19:13:03] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/6 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 9/185 variables, 3/9 constraints. Problems are: Problem set: 9 solved, 23 unsolved
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2024-06-02 19:13:04] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 484/669 variables, 185/198 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 69/267 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 25/694 variables, 14/281 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 2/283 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/283 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 1/695 variables, 1/284 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/284 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/695 variables, 0/284 constraints. Problems are: Problem set: 9 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 284 constraints, problems are : Problem set: 9 solved, 23 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 23 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/176 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 3/7 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 9/185 variables, 3/10 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 3/13 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 484/669 variables, 185/198 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 69/267 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 21/288 constraints. Problems are: Problem set: 10 solved, 22 unsolved
[2024-06-02 19:13:08] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/289 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/289 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 25/694 variables, 14/303 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 2/305 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/694 variables, 1/306 constraints. Problems are: Problem set: 10 solved, 22 unsolved
[2024-06-02 19:13:09] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
[2024-06-02 19:13:09] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/694 variables, 2/308 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/694 variables, 0/308 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 1/695 variables, 1/309 constraints. Problems are: Problem set: 10 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/695 variables, 0/309 constraints. Problems are: Problem set: 10 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 309 constraints, problems are : Problem set: 10 solved, 22 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 199/199 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 22/32 constraints, Known Traps: 9/9 constraints]
After SMT, in 8424ms problems are : Problem set: 10 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 528/528 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 199 transition count 525
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 199 transition count 522
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 196 transition count 522
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 194 transition count 518
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 194 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 194 transition count 517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 193 transition count 514
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 193 transition count 514
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 192 transition count 512
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 192 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 191 transition count 509
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 191 transition count 509
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 190 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 190 transition count 507
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 189 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 189 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 188 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 188 transition count 502
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 32 place count 185 transition count 499
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 38 place count 182 transition count 505
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 182 transition count 499
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 47 place count 182 transition count 496
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 182 transition count 498
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 181 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 181 transition count 494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 180 transition count 493
Applied a total of 54 rules in 173 ms. Remains 180 /199 variables (removed 19) and now considering 493/528 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 180/199 places, 493/528 transitions.
RANDOM walk for 40000 steps (1289 resets) in 841 ms. (47 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4002 steps (24 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (26 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (30 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (26 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (24 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (26 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 424873 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :5 out of 20
Probabilistic random walk after 424873 steps, saw 110260 distinct states, run finished after 3007 ms. (steps per millisecond=141 ) properties seen :5
[2024-06-02 19:13:15] [INFO ] Flow matrix only has 458 transitions (discarded 35 similar events)
// Phase 1: matrix 458 rows 180 cols
[2024-06-02 19:13:15] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:13:15] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 143/163 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:13:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:13:15] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 447/610 variables, 163/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 67/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 25/635 variables, 14/250 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3/638 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/638 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 256 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 143/163 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 447/610 variables, 163/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 67/236 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 15/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 25/635 variables, 14/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/635 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/638 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:13:18] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/638 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/638 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:13:19] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:13:19] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/638 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/638 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 638/638 variables, and 274 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints]
After SMT, in 5235ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 9022 ms.
Support contains 20 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 179 transition count 491
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 179 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 179 transition count 490
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 179 transition count 492
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 178 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 178 transition count 488
Applied a total of 9 rules in 40 ms. Remains 178 /180 variables (removed 2) and now considering 488/493 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 178/180 places, 488/493 transitions.
RANDOM walk for 40000 steps (1252 resets) in 250 ms. (159 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 451052 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 15
Probabilistic random walk after 451052 steps, saw 118169 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2024-06-02 19:13:32] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
// Phase 1: matrix 452 rows 178 cols
[2024-06-02 19:13:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:13:32] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 141/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 441/602 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 67/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 25/627 variables, 14/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 3/630 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/630 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 253 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 141/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 441/602 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 67/233 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 25/627 variables, 14/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/630 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 19:13:35] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/630 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/630 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/630 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 269 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2510 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 4144ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 11696 ms.
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 488/488 transitions.
Applied a total of 0 rules in 11 ms. Remains 178 /178 variables (removed 0) and now considering 488/488 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 178/178 places, 488/488 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 488/488 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 488/488 (removed 0) transitions.
[2024-06-02 19:13:48] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 19:13:48] [INFO ] Invariant cache hit.
[2024-06-02 19:13:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:13:48] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 19:13:48] [INFO ] Invariant cache hit.
[2024-06-02 19:13:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 19:13:48] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-02 19:13:48] [INFO ] Redundant transitions in 29 ms returned []
Running 482 sub problems to find dead transitions.
[2024-06-02 19:13:48] [INFO ] Flow matrix only has 452 transitions (discarded 36 similar events)
[2024-06-02 19:13:48] [INFO ] Invariant cache hit.
[2024-06-02 19:13:48] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 19:13:51] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:13:51] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:13:51] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
[2024-06-02 19:13:51] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:13:51] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:13:52] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:13:52] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:13:53] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 452/630 variables, 178/193 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 67/260 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 19:13:59] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:14:00] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:14:01] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-02 19:14:07] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:14:07] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/630 variables, and 265 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 452/630 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 67/265 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 482/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 0/630 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 482 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 747 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 13/13 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60966 ms. Remains : 178/178 places, 488/488 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-13-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:14:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 30 ms
FORMULA FireWire-PT-13-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:14:49] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 64 out of 199 places (down from 68) after GAL structural reductions.
Computed a total of 56 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 520
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 195 transition count 519
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 193 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 193 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 191 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 191 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 190 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 190 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 189 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 189 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 188 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 188 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 187 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 187 transition count 499
Applied a total of 25 rules in 20 ms. Remains 187 /199 variables (removed 12) and now considering 499/528 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 187/199 places, 499/528 transitions.
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:14:49] [INFO ] Input system was already deterministic with 499 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 520
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 195 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 193 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 193 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 191 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 191 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 189 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 189 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 187 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 187 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 186 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 186 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 185 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 185 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 184 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 184 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 183 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 183 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 182 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 181 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 181 transition count 484
Applied a total of 38 rules in 37 ms. Remains 181 /199 variables (removed 18) and now considering 484/528 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 181/199 places, 484/528 transitions.
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:14:49] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:14:49] [INFO ] Input system was already deterministic with 484 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 183 transition count 488
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 183 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 181 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 181 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 180 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 180 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 179 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 178 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 178 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 177 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 177 transition count 472
Applied a total of 46 rules in 36 ms. Remains 177 /199 variables (removed 22) and now considering 472/528 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 177/199 places, 472/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 170 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 170 transition count 456
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 167 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 164 transition count 442
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 164 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 162 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 162 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 160 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 160 transition count 434
Applied a total of 80 rules in 30 ms. Remains 160 /199 variables (removed 39) and now considering 434/528 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 160/199 places, 434/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 171 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 171 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 169 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 169 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 167 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 165 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 165 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 163 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 163 transition count 440
Applied a total of 74 rules in 26 ms. Remains 163 /199 variables (removed 36) and now considering 440/528 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 163/199 places, 440/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 180 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 179 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 179 transition count 478
Applied a total of 42 rules in 16 ms. Remains 179 /199 variables (removed 20) and now considering 478/528 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 179/199 places, 478/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 189 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 189 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 187 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 187 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 185 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 185 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 183 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 183 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 181 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 181 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 179 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 177 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 177 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 175 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 175 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 173 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 173 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 172 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 172 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 171 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 171 transition count 459
Applied a total of 58 rules in 24 ms. Remains 171 /199 variables (removed 28) and now considering 459/528 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 171/199 places, 459/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 459 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 199 transition count 525
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 196 transition count 525
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 192 transition count 517
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 192 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 192 transition count 515
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 190 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 190 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 188 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 188 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 187 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 187 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 186 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 186 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 185 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 185 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 184 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 184 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 183 transition count 492
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 183 transition count 492
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 1 with 4 rules applied. Total rules applied 38 place count 181 transition count 490
Applied a total of 38 rules in 54 ms. Remains 181 /199 variables (removed 18) and now considering 490/528 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 181/199 places, 490/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 490 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 518
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 518
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 194 transition count 516
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 191 transition count 507
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 191 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 188 transition count 501
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 188 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 185 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 185 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 182 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 182 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 179 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 179 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 176 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 176 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 173 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 173 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 170 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 170 transition count 456
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 167 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 167 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 164 transition count 442
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 164 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 162 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 162 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 160 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 160 transition count 434
Applied a total of 80 rules in 26 ms. Remains 160 /199 variables (removed 39) and now considering 434/528 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 160/199 places, 434/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 170 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 170 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 168 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 168 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 166 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 164 transition count 448
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 164 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 163 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 163 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 162 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 162 transition count 444
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 1 with 6 rules applied. Total rules applied 80 place count 159 transition count 441
Applied a total of 80 rules in 58 ms. Remains 159 /199 variables (removed 40) and now considering 441/528 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 159/199 places, 441/528 transitions.
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:50] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:50] [INFO ] Input system was already deterministic with 441 transitions.
RANDOM walk for 40000 steps (1317 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (53 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1454440 steps, run timeout after 3001 ms. (steps per millisecond=484 ) properties seen :0 out of 1
Probabilistic random walk after 1454440 steps, saw 312031 distinct states, run finished after 3001 ms. (steps per millisecond=484 ) properties seen :0
[2024-06-02 19:14:53] [INFO ] Flow matrix only has 409 transitions (discarded 32 similar events)
// Phase 1: matrix 409 rows 159 cols
[2024-06-02 19:14:53] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:14:53] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/367 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 179/546 variables, 87/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 36/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/565 variables, 11/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/567 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/568 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 308/367 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 179/546 variables, 87/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 36/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/565 variables, 11/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/567 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:14:54] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/567 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/567 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/567 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/568 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 441/441 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 159 transition count 438
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 156 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 156 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 156 transition count 435
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 156 transition count 441
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 30 place count 153 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 153 transition count 429
Applied a total of 36 rules in 26 ms. Remains 153 /159 variables (removed 6) and now considering 429/441 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 153/159 places, 429/441 transitions.
RANDOM walk for 4000000 steps (128246 resets) in 8570 ms. (466 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (101 resets) in 4479 ms. (892 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4205551 steps, run timeout after 9001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 4205551 steps, saw 966276 distinct states, run finished after 9001 ms. (steps per millisecond=467 ) properties seen :0
[2024-06-02 19:15:07] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 153 cols
[2024-06-02 19:15:07] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:15:07] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 300/357 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 167/524 variables, 83/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/543 variables, 11/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/545 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 300/357 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 167/524 variables, 83/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/543 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 13 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 153/153 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:15:07] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:15:07] [INFO ] Invariant cache hit.
[2024-06-02 19:15:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:15:07] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:15:07] [INFO ] Invariant cache hit.
[2024-06-02 19:15:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:15:07] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 19:15:07] [INFO ] Redundant transitions in 11 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 19:15:07] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:15:07] [INFO ] Invariant cache hit.
[2024-06-02 19:15:07] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:15:09] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:15:10] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:15:11] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:15:11] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:15:11] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:15:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:15:11] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:15:17] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:15:22] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:15:22] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 24150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/177 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 423/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 658 constraints, problems are : Problem set: 0 solved, 423 unsolved in 28326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
After SMT, in 52846ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 52852ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53207 ms. Remains : 153/153 places, 429/429 transitions.
RANDOM walk for 400000 steps (12812 resets) in 1628 ms. (245 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 19:16:01] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:16:01] [INFO ] Invariant cache hit.
[2024-06-02 19:16:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:16:01] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 19:16:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:16:01] [INFO ] After 18ms SMT Verify possible using 58 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:16:01] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:16:01] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:16:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:16:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:16:01] [INFO ] After 28ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:16:01] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:16:01] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (128386 resets) in 7495 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (118 resets) in 4718 ms. (847 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 4162807 steps, run timeout after 9001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 4162807 steps, saw 956039 distinct states, run finished after 9001 ms. (steps per millisecond=462 ) properties seen :0
[2024-06-02 19:16:13] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:16:13] [INFO ] Invariant cache hit.
[2024-06-02 19:16:13] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 300/357 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 167/524 variables, 83/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/543 variables, 11/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/545 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 300/357 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 167/524 variables, 83/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/543 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 153/153 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:16:14] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:16:14] [INFO ] Invariant cache hit.
[2024-06-02 19:16:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 19:16:14] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:16:14] [INFO ] Invariant cache hit.
[2024-06-02 19:16:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:16:14] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 19:16:14] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 19:16:14] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:16:14] [INFO ] Invariant cache hit.
[2024-06-02 19:16:14] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:16:17] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:16:17] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:16:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:16:17] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:16:17] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:16:18] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:16:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:16:18] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:16:24] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:16:28] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:16:29] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 23955 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/177 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 423/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 658 constraints, problems are : Problem set: 0 solved, 423 unsolved in 27010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
After SMT, in 51265ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 51269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51616 ms. Remains : 153/153 places, 429/429 transitions.
RANDOM walk for 400000 steps (12759 resets) in 724 ms. (551 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-06-02 19:17:05] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:05] [INFO ] Invariant cache hit.
[2024-06-02 19:17:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:17:06] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 19:17:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:17:06] [INFO ] After 15ms SMT Verify possible using 58 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:17:06] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:17:06] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:17:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:17:06] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:17:06] [INFO ] After 25ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:17:06] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:17:06] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 104 steps (4 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1298 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (282 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1386304 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1386304 steps, saw 336422 distinct states, run finished after 3001 ms. (steps per millisecond=461 ) properties seen :0
[2024-06-02 19:17:09] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:09] [INFO ] Invariant cache hit.
[2024-06-02 19:17:09] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/525 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/543 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/545 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/525 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/543 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 429/429 transitions.
RANDOM walk for 40000 steps (1297 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (260 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1385343 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1385343 steps, saw 336261 distinct states, run finished after 3002 ms. (steps per millisecond=461 ) properties seen :0
[2024-06-02 19:17:12] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:12] [INFO ] Invariant cache hit.
[2024-06-02 19:17:12] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/525 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/543 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/545 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/525 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/543 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 19:17:13] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:13] [INFO ] Invariant cache hit.
[2024-06-02 19:17:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:17:13] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:13] [INFO ] Invariant cache hit.
[2024-06-02 19:17:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:17:13] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 19:17:13] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 19:17:13] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 19:17:13] [INFO ] Invariant cache hit.
[2024-06-02 19:17:13] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:17:15] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:17:16] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:17:16] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:17:16] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:17:16] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:17:16] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:17:17] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:17:17] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:17:17] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:17:23] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 19:17:27] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:17:28] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 24122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/177 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 423/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 658 constraints, problems are : Problem set: 0 solved, 423 unsolved in 27321 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 17/17 constraints]
After SMT, in 51730ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 51734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52074 ms. Remains : 153/153 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 153 vertex of which 29 / 153 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 127 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 126 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 126 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 125 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 230
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 124 transition count 215
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 115 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 212
Applied a total of 46 rules in 51 ms. Remains 115 /153 variables (removed 38) and now considering 212/429 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:18:05] [INFO ] Flow matrix only has 210 transitions (discarded 2 similar events)
// Phase 1: matrix 210 rows 115 cols
[2024-06-02 19:18:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:18:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:05] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:18:05] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 19:18:05] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 180 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 153 vertex of which 29 / 153 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 127 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 126 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 126 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 125 transition count 272
Free-agglomeration rule applied 10 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 27 place count 125 transition count 256
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 40 place count 115 transition count 253
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 253
Applied a total of 46 rules in 22 ms. Remains 115 /153 variables (removed 38) and now considering 253/429 (removed 176) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:18:05] [INFO ] Flow matrix only has 251 transitions (discarded 2 similar events)
// Phase 1: matrix 251 rows 115 cols
[2024-06-02 19:18:05] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:18:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:05] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:18:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:18:05] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:18:05] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:18:05] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 296 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 169 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 169 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 166 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 163 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 163 transition count 444
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 160 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 156 transition count 430
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 1 with 6 rules applied. Total rules applied 92 place count 153 transition count 427
Applied a total of 92 rules in 53 ms. Remains 153 /199 variables (removed 46) and now considering 427/528 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 153/199 places, 427/528 transitions.
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:05] [INFO ] Input system was already deterministic with 427 transitions.
RANDOM walk for 31119 steps (975 resets) in 114 ms. (270 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-13-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 198 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 195 transition count 524
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 190 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 190 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 190 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 187 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 187 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 184 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 184 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 181 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 181 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 178 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 178 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 175 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 175 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 172 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 172 transition count 467
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 169 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 169 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 166 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 166 transition count 452
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 163 transition count 444
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 163 transition count 444
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 160 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 156 transition count 430
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 1 with 6 rules applied. Total rules applied 92 place count 153 transition count 427
Applied a total of 92 rules in 51 ms. Remains 153 /199 variables (removed 46) and now considering 427/528 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 153/199 places, 427/528 transitions.
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:05] [INFO ] Input system was already deterministic with 427 transitions.
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:18:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:18:05] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 19:18:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 528 transitions and 1964 arcs took 3 ms.
Total runtime 305579 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-13-CTLFireability-2024-15

BK_STOP 1717355886339

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-13-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/914/ctl_0_
ctl formula name FireWire-PT-13-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/914/ctl_1_
ctl formula name FireWire-PT-13-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/914/ctl_2_
ctl formula name FireWire-PT-13-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/914/ctl_3_
ctl formula name FireWire-PT-13-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/914/ctl_4_
ctl formula name FireWire-PT-13-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/914/ctl_5_
ctl formula name FireWire-PT-13-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/914/ctl_6_
ctl formula name FireWire-PT-13-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/914/ctl_7_
ctl formula name FireWire-PT-13-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/914/ctl_8_
ctl formula name FireWire-PT-13-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/914/ctl_9_
ctl formula name FireWire-PT-13-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/914/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FireWire-PT-13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901300266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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