Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500266.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 17K Apr 11 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716863612570

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:33:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 02:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:33:35] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2024-05-28 02:33:35] [INFO ] Transformed 554 places.
[2024-05-28 02:33:35] [INFO ] Transformed 2998 transitions.
[2024-05-28 02:33:35] [INFO ] Parsed PT model containing 554 places and 2998 transitions and 20754 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
[2024-05-28 02:33:35] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-28 02:33:35] [INFO ] Reduced 264 identical enabling conditions.
[2024-05-28 02:33:35] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 354 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 108 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 02:33:35] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-05-28 02:33:35] [INFO ] Computed 46 invariants in 78 ms
[2024-05-28 02:33:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:33:53] [INFO ] Deduced a trap composed of 110 places in 326 ms of which 42 ms to minimize.
[2024-05-28 02:33:53] [INFO ] Deduced a trap composed of 174 places in 263 ms of which 4 ms to minimize.
[2024-05-28 02:33:54] [INFO ] Deduced a trap composed of 145 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:33:54] [INFO ] Deduced a trap composed of 276 places in 285 ms of which 6 ms to minimize.
[2024-05-28 02:33:55] [INFO ] Deduced a trap composed of 270 places in 275 ms of which 4 ms to minimize.
[2024-05-28 02:33:55] [INFO ] Deduced a trap composed of 274 places in 273 ms of which 4 ms to minimize.
[2024-05-28 02:33:56] [INFO ] Deduced a trap composed of 280 places in 286 ms of which 3 ms to minimize.
[2024-05-28 02:33:56] [INFO ] Deduced a trap composed of 274 places in 238 ms of which 4 ms to minimize.
[2024-05-28 02:33:56] [INFO ] Deduced a trap composed of 290 places in 246 ms of which 4 ms to minimize.
[2024-05-28 02:33:56] [INFO ] Deduced a trap composed of 277 places in 282 ms of which 3 ms to minimize.
[2024-05-28 02:33:57] [INFO ] Deduced a trap composed of 290 places in 260 ms of which 4 ms to minimize.
[2024-05-28 02:33:57] [INFO ] Deduced a trap composed of 265 places in 288 ms of which 3 ms to minimize.
[2024-05-28 02:33:58] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:33:58] [INFO ] Deduced a trap composed of 264 places in 228 ms of which 4 ms to minimize.
[2024-05-28 02:33:58] [INFO ] Deduced a trap composed of 277 places in 209 ms of which 3 ms to minimize.
[2024-05-28 02:33:59] [INFO ] Deduced a trap composed of 276 places in 208 ms of which 3 ms to minimize.
[2024-05-28 02:33:59] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 58 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20090 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:34:08] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:34:08] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-28 02:34:09] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 1 ms to minimize.
[2024-05-28 02:34:11] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:34:12] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:34:15] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 64 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 23/23 constraints]
After SMT, in 45687ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45750ms
[2024-05-28 02:34:21] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-28 02:34:21] [INFO ] Invariant cache hit.
[2024-05-28 02:34:21] [INFO ] Implicit Places using invariants in 257 ms returned [88, 244, 274, 360, 382, 480]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 271 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 544/554 places, 1372/1372 transitions.
Applied a total of 0 rules in 19 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46247 ms. Remains : 544/554 places, 1372/1372 transitions.
Support contains 354 out of 544 places after structural reductions.
[2024-05-28 02:34:22] [INFO ] Flatten gal took : 154 ms
[2024-05-28 02:34:22] [INFO ] Flatten gal took : 108 ms
[2024-05-28 02:34:22] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 348 out of 544 places (down from 354) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 72
RANDOM walk for 40001 steps (9 resets) in 4130 ms. (9 steps per ms) remains 25/72 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
[2024-05-28 02:34:24] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-28 02:34:24] [INFO ] Computed 40 invariants in 43 ms
[2024-05-28 02:34:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 82/142 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 02:34:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 388/530 variables, 19/30 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/30 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/534 variables, 4/34 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/34 constraints. Problems are: Problem set: 17 solved, 8 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 10 (OVERLAPS) 10/544 variables, 7/41 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/41 constraints. Problems are: Problem set: 23 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1892/1892 variables, and 585 constraints, problems are : Problem set: 23 solved, 2 unsolved in 2222 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 544/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 23 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/43 variables, 2/2 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 470/513 variables, 16/18 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/18 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/523 variables, 10/28 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/29 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/29 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19/542 variables, 11/40 constraints. Problems are: Problem set: 23 solved, 2 unsolved
[2024-05-28 02:34:27] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:34:27] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-28 02:34:27] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:34:27] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 2 ms to minimize.
[2024-05-28 02:34:27] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 5/45 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 0/45 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1348/1890 variables, 542/587 constraints. Problems are: Problem set: 23 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1890 variables, 120/707 constraints. Problems are: Problem set: 23 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1890/1892 variables, and 709 constraints, problems are : Problem set: 23 solved, 2 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 542/544 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/25 constraints, Known Traps: 6/6 constraints]
After SMT, in 6955ms problems are : Problem set: 23 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 544 transition count 1325
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 497 transition count 1325
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 94 place count 497 transition count 1265
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 214 place count 437 transition count 1265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 216 place count 435 transition count 1263
Iterating global reduction 2 with 2 rules applied. Total rules applied 218 place count 435 transition count 1263
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 338 place count 375 transition count 1203
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 352 place count 375 transition count 1189
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 366 place count 361 transition count 1189
Applied a total of 366 rules in 275 ms. Remains 361 /544 variables (removed 183) and now considering 1189/1372 (removed 183) transitions.
Running 1185 sub problems to find dead transitions.
[2024-05-28 02:34:31] [INFO ] Flow matrix only has 1165 transitions (discarded 24 similar events)
// Phase 1: matrix 1165 rows 361 cols
[2024-05-28 02:34:31] [INFO ] Computed 40 invariants in 28 ms
[2024-05-28 02:34:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-28 02:34:43] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 2 ms to minimize.
[2024-05-28 02:34:44] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 7 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 2 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:34:45] [INFO ] Deduced a trap composed of 143 places in 278 ms of which 2 ms to minimize.
[2024-05-28 02:34:49] [INFO ] Deduced a trap composed of 118 places in 259 ms of which 3 ms to minimize.
[2024-05-28 02:34:52] [INFO ] Deduced a trap composed of 165 places in 257 ms of which 2 ms to minimize.
[2024-05-28 02:34:53] [INFO ] Deduced a trap composed of 197 places in 337 ms of which 2 ms to minimize.
[2024-05-28 02:34:53] [INFO ] Deduced a trap composed of 162 places in 297 ms of which 3 ms to minimize.
[2024-05-28 02:34:54] [INFO ] Deduced a trap composed of 127 places in 269 ms of which 3 ms to minimize.
[2024-05-28 02:34:54] [INFO ] Deduced a trap composed of 143 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:34:55] [INFO ] Deduced a trap composed of 130 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 357/1526 variables, and 53 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/361 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1185/1185 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 1185 unsolved
[2024-05-28 02:35:03] [INFO ] Deduced a trap composed of 176 places in 265 ms of which 3 ms to minimize.
[2024-05-28 02:35:13] [INFO ] Deduced a trap composed of 153 places in 230 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1526 variables, and 55 constraints, problems are : Problem set: 0 solved, 1185 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/361 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1185 constraints, Known Traps: 19/19 constraints]
After SMT, in 46411ms problems are : Problem set: 0 solved, 1185 unsolved
Search for dead transitions found 0 dead transitions in 46433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46714 ms. Remains : 361/544 places, 1189/1372 transitions.
RANDOM walk for 40001 steps (10 resets) in 652 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 190 ms. (209 steps per ms) remains 1/2 properties
BEST_FIRST walk for 17320 steps (3 resets) in 61 ms. (279 steps per ms) remains 0/1 properties
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:35:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 02:35:18] [INFO ] Flatten gal took : 89 ms
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:35:18] [INFO ] Flatten gal took : 78 ms
[2024-05-28 02:35:18] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 255 out of 544 places (down from 264) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Applied a total of 12 rules in 38 ms. Remains 538 /544 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-28 02:35:18] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 538 cols
[2024-05-28 02:35:18] [INFO ] Computed 40 invariants in 24 ms
[2024-05-28 02:35:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 02:35:38] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
[2024-05-28 02:35:40] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1880 variables, and 33 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 5 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:35:47] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-05-28 02:35:48] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:35:52] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1880 variables, and 42 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 17/25 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 11/11 constraints]
After SMT, in 45711ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45730ms
Finished structural reductions in LTL mode , in 1 iterations and 45785 ms. Remains : 538/544 places, 1366/1372 transitions.
[2024-05-28 02:36:04] [INFO ] Flatten gal took : 67 ms
[2024-05-28 02:36:04] [INFO ] Flatten gal took : 109 ms
[2024-05-28 02:36:04] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 65 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:36:05] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:36:05] [INFO ] Computed 40 invariants in 36 ms
[2024-05-28 02:36:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:22] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:36:24] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 3 ms to minimize.
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 2 ms to minimize.
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:36:37] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:36:40] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:36:40] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:36:49] [INFO ] Deduced a trap composed of 47 places in 342 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 4)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 4)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 9)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 1)
(s134 0)
(s135 3)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 2)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45810ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45840ms
Finished structural reductions in LTL mode , in 1 iterations and 45908 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-05-28 02:36:50] [INFO ] Flatten gal took : 55 ms
[2024-05-28 02:36:50] [INFO ] Flatten gal took : 56 ms
[2024-05-28 02:36:51] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 8 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 02:36:51] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-28 02:36:51] [INFO ] Computed 40 invariants in 55 ms
[2024-05-28 02:36:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:37:06] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-05-28 02:37:09] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:37:30] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 3 ms to minimize.
[2024-05-28 02:37:30] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 2 ms to minimize.
[2024-05-28 02:37:31] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:37:31] [INFO ] Deduced a trap composed of 76 places in 300 ms of which 3 ms to minimize.
[2024-05-28 02:37:31] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 3 ms to minimize.
[2024-05-28 02:37:31] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:37:35] [INFO ] Deduced a trap composed of 112 places in 183 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 4)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 4)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 3)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 4)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 9)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 40 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 9/9 constraints]
After SMT, in 45196ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45212ms
Finished structural reductions in LTL mode , in 1 iterations and 45225 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-05-28 02:37:36] [INFO ] Flatten gal took : 79 ms
[2024-05-28 02:37:36] [INFO ] Flatten gal took : 66 ms
[2024-05-28 02:37:36] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 50 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:37:36] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:37:36] [INFO ] Computed 40 invariants in 45 ms
[2024-05-28 02:37:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:37:53] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:37:55] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:38:08] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 10 ms to minimize.
[2024-05-28 02:38:08] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-28 02:38:08] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-28 02:38:09] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:38:09] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:38:09] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:38:11] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:38:11] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:38:19] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 41 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 11/11 constraints]
After SMT, in 45945ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45972ms
Finished structural reductions in LTL mode , in 1 iterations and 46038 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-05-28 02:38:22] [INFO ] Flatten gal took : 45 ms
[2024-05-28 02:38:22] [INFO ] Flatten gal took : 48 ms
[2024-05-28 02:38:22] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 02:38:22] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-28 02:38:22] [INFO ] Computed 40 invariants in 54 ms
[2024-05-28 02:38:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:38:38] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-28 02:38:40] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:39:02] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 3 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 2 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 2 ms to minimize.
[2024-05-28 02:39:03] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 3 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 2 ms to minimize.
[2024-05-28 02:39:04] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 39 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 8/8 constraints]
After SMT, in 44898ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 44913ms
Finished structural reductions in LTL mode , in 1 iterations and 44923 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-05-28 02:39:07] [INFO ] Flatten gal took : 43 ms
[2024-05-28 02:39:07] [INFO ] Flatten gal took : 44 ms
[2024-05-28 02:39:07] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 544 transition count 1354
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 42 place count 526 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 520 transition count 1348
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 520 transition count 1312
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 120 place count 484 transition count 1312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 478 transition count 1306
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 478 transition count 1306
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 240 place count 424 transition count 1252
Applied a total of 240 rules in 86 ms. Remains 424 /544 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-05-28 02:39:08] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 424 cols
[2024-05-28 02:39:08] [INFO ] Computed 40 invariants in 33 ms
[2024-05-28 02:39:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 02:39:20] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-28 02:39:20] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1652 variables, and 33 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 02:39:34] [INFO ] Deduced a trap composed of 56 places in 343 ms of which 3 ms to minimize.
[2024-05-28 02:39:34] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2024-05-28 02:39:34] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-28 02:39:34] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-28 02:39:35] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:39:35] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:39:39] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-05-28 02:39:50] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1652 variables, and 41 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/424 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 10/10 constraints]
After SMT, in 44722ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 44734ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44826 ms. Remains : 424/544 places, 1252/1372 transitions.
[2024-05-28 02:39:52] [INFO ] Flatten gal took : 44 ms
[2024-05-28 02:39:52] [INFO ] Flatten gal took : 76 ms
[2024-05-28 02:39:53] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 33 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:39:53] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:39:53] [INFO ] Computed 40 invariants in 46 ms
[2024-05-28 02:39:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:40:11] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:40:13] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 2.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 4.0)
(s11 4.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 4.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 3.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 2.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 4.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 2.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 9.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 3.0)
(s136 4.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 2.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 4.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 4.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 2.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 2.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 2.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 2.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 4.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 2.0)
(s363 6.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 2.0)
(s399 0.0)
(s400 2.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 2.0)
(s414 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 3.0)
(s424 4.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 3.0)
(s455 0.0)
(s456 1.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 4.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 3.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 5.0)
(s497 1.0)
(s498 0.0)
(s499 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 33 places in 343 ms of which 3 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 3 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:40:29] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-28 02:40:29] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
(s89 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 4)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 1)
(s21 4)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 3)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 4)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0timeout
)
(s90 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 40 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 10/10 constraints]
After SMT, in 45758ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45785ms
Finished structural reductions in LTL mode , in 1 iterations and 45823 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-05-28 02:40:38] [INFO ] Flatten gal took : 52 ms
[2024-05-28 02:40:39] [INFO ] Flatten gal took : 56 ms
[2024-05-28 02:40:39] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 544 /544 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-05-28 02:40:39] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 544 cols
[2024-05-28 02:40:39] [INFO ] Computed 40 invariants in 46 ms
[2024-05-28 02:40:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:40:54] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-28 02:40:56] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1892 variables, and 33 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 3 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 76 places in 276 ms of which 3 ms to minimize.
[2024-05-28 02:41:17] [INFO ] Deduced a trap composed of 76 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:41:18] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 2 ms to minimize.
[2024-05-28 02:41:18] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1892 variables, and 39 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 8/8 constraints]
After SMT, in 45498ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45513ms
Finished structural reductions in LTL mode , in 1 iterations and 45526 ms. Remains : 544/544 places, 1372/1372 transitions.
[2024-05-28 02:41:24] [INFO ] Flatten gal took : 48 ms
[2024-05-28 02:41:24] [INFO ] Flatten gal took : 46 ms
[2024-05-28 02:41:24] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 544 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 490 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 490 transition count 1258
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 430 transition count 1258
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 428 transition count 1256
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 428 transition count 1256
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 344 place count 372 transition count 1200
Applied a total of 344 rules in 139 ms. Remains 372 /544 variables (removed 172) and now considering 1200/1372 (removed 172) transitions.
Running 1196 sub problems to find dead transitions.
[2024-05-28 02:41:25] [INFO ] Flow matrix only has 1176 transitions (discarded 24 similar events)
// Phase 1: matrix 1176 rows 372 cols
[2024-05-28 02:41:25] [INFO ] Computed 40 invariants in 37 ms
[2024-05-28 02:41:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
[2024-05-28 02:41:39] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 2 ms to minimize.
[2024-05-28 02:41:39] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-28 02:41:39] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2024-05-28 02:41:40] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 2 ms to minimize.
[2024-05-28 02:41:40] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
[2024-05-28 02:41:40] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:41:40] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:41:40] [INFO ] Deduced a trap composed of 61 places in 205 ms of which 1 ms to minimize.
[2024-05-28 02:41:41] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 1 ms to minimize.
[2024-05-28 02:41:41] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 2 ms to minimize.
[2024-05-28 02:41:41] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 2 ms to minimize.
[2024-05-28 02:41:41] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 2 ms to minimize.
[2024-05-28 02:41:41] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 2 ms to minimize.
[2024-05-28 02:41:42] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 2.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.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 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 2.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 6.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/1548 variables, and 49 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
[2024-05-28 02:41:54] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-28 02:41:54] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2024-05-28 02:41:54] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 5 ms to minimize.
[2024-05-28 02:41:55] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:41:56] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 0 ms to minimize.
[2024-05-28 02:41:57] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:42:05] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
[2024-05-28 02:42:09] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/1548 variables, and 57 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/372 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 22/22 constraints]
After SMT, in 46144ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 46172ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46327 ms. Remains : 372/544 places, 1200/1372 transitions.
[2024-05-28 02:42:11] [INFO ] Flatten gal took : 39 ms
[2024-05-28 02:42:11] [INFO ] Flatten gal took : 44 ms
[2024-05-28 02:42:11] [INFO ] Input system was already deterministic with 1200 transitions.
RANDOM walk for 695 steps (0 resets) in 8 ms. (77 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J04T06-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 20 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:42:11] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 532 cols
[2024-05-28 02:42:11] [INFO ] Computed 40 invariants in 31 ms
[2024-05-28 02:42:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:42:25] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2024-05-28 02:42:28] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 5 ms to minimize.
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 2 ms to minimize.
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 0 ms to minimize.
[2024-05-28 02:42:43] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:42:48] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:42:48] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 4)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 4)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 3)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 4)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 9)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 4)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 2)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 4)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 2)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 1)
(s247 1)
(s248 0)
(s249 2)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 40 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 10/10 constraints]
After SMT, in 45166ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45179ms
Finished structural reductions in LTL mode , in 1 iterations and 45202 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-05-28 02:42:56] [INFO ] Flatten gal took : 39 ms
[2024-05-28 02:42:56] [INFO ] Flatten gal took : 42 ms
[2024-05-28 02:42:56] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 538 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 538 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 532 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 532 transition count 1360
Applied a total of 24 rules in 22 ms. Remains 532 /544 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-05-28 02:42:56] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
[2024-05-28 02:42:56] [INFO ] Invariant cache hit.
[2024-05-28 02:42:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:43:11] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:43:12] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1868 variables, and 32 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-05-28 02:43:34] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1868 variables, and 33 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 17/26 constraints, State Equation: 0/532 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 3/3 constraints]
After SMT, in 45535ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45552ms
Finished structural reductions in LTL mode , in 1 iterations and 45578 ms. Remains : 532/544 places, 1360/1372 transitions.
[2024-05-28 02:43:42] [INFO ] Flatten gal took : 44 ms
[2024-05-28 02:43:42] [INFO ] Flatten gal took : 49 ms
[2024-05-28 02:43:42] [INFO ] Input system was already deterministic with 1360 transitions.
[2024-05-28 02:43:42] [INFO ] Flatten gal took : 49 ms
[2024-05-28 02:43:42] [INFO ] Flatten gal took : 52 ms
[2024-05-28 02:43:42] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2024-05-28 02:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 544 places, 1372 transitions and 6956 arcs took 9 ms.
Total runtime 608220 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 544
TRANSITIONS: 1372
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.053s, Sys 0.008s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1171
MODEL NAME: /home/mcc/execution/417/model
544 places, 1372 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J04T06, 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 r289-tajo-171654445500266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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