About the Execution of LTSMin+red for PolyORBLF-PT-S04J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16099.844 | 528316.00 | 669242.00 | 122.70 | F??FF?TTTTFFFF?? | normal |
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.r516-tajo-171654446700273.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 ltsminxred
Input is PolyORBLF-PT-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 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 9.0K 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 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 3.3M 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-S04J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717253808883
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:56:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:56:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:56:50] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2024-06-01 14:56:50] [INFO ] Transformed 712 places.
[2024-06-01 14:56:50] [INFO ] Transformed 4012 transitions.
[2024-06-01 14:56:50] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 474 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 50 ms. Remains 712 /712 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:56:50] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2024-06-01 14:56:50] [INFO ] Computed 54 invariants in 136 ms
[2024-06-01 14:56:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 41 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 61 places in 571 ms of which 44 ms to minimize.
[2024-06-01 14:57:22] [INFO ] Deduced a trap composed of 75 places in 508 ms of which 6 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 41 places in 443 ms of which 6 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:57:23] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:57:24] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-06-01 14:57:25] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:57:26] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 54 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 13/13 constraints]
After SMT, in 48578ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48626ms
[2024-06-01 14:57:39] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:57:39] [INFO ] Invariant cache hit.
[2024-06-01 14:57:39] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 14:57:39] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:57:39] [INFO ] Invariant cache hit.
[2024-06-01 14:57:40] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-01 14:57:48] [INFO ] Implicit Places using invariants and state equation in 9120 ms returned []
Implicit Place search using SMT with State Equation took 9371 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 14:57:48] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:57:48] [INFO ] Invariant cache hit.
[2024-06-01 14:57:48] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:58:21] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 43 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:58:39] [INFO ] Deduced a trap composed of 75 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 2 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 77 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:58:40] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:58:43] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:58:43] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:58:43] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 55 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 14/14 constraints]
After SMT, in 68317ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 68355ms
Finished structural reductions in LTL mode , in 1 iterations and 126468 ms. Remains : 712/712 places, 1844/1844 transitions.
Support contains 474 out of 712 places after structural reductions.
[2024-06-01 14:58:57] [INFO ] Flatten gal took : 174 ms
[2024-06-01 14:58:57] [INFO ] Flatten gal took : 101 ms
[2024-06-01 14:58:57] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 458 out of 712 places (down from 474) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2947 ms. (13 steps per ms) remains 60/106 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
[2024-06-01 14:58:59] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-06-01 14:58:59] [INFO ] Invariant cache hit.
[2024-06-01 14:58:59] [INFO ] State equation strengthened by 160 read => feed constraints.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp38 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
At refinement iteration 2 (OVERLAPS) 124/436 variables, 10/11 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 2/13 constraints. Problems are: Problem set: 15 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 44 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp105 is UNSAT
At refinement iteration 5 (OVERLAPS) 273/709 variables, 39/52 constraints. Problems are: Problem set: 56 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/52 constraints. Problems are: Problem set: 56 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/710 variables, 1/53 constraints. Problems are: Problem set: 56 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/53 constraints. Problems are: Problem set: 56 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1812/2522 variables, 710/763 constraints. Problems are: Problem set: 56 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2522/2524 variables, and 923 constraints, problems are : Problem set: 56 solved, 3 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 710/712 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 56 solved, 3 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 597/655 variables, 20/20 constraints. Problems are: Problem set: 57 solved, 2 unsolved
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 418 places in 478 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 1/21 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 0/21 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 27/682 variables, 11/32 constraints. Problems are: Problem set: 57 solved, 2 unsolved
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 7/39 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/39 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/709 variables, 21/60 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 0/60 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/710 variables, 1/61 constraints. Problems are: Problem set: 57 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/61 constraints. Problems are: Problem set: 57 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2522/2524 variables, and 771 constraints, problems are : Problem set: 57 solved, 2 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 710/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/59 constraints, Known Traps: 8/8 constraints]
After SMT, in 9571ms problems are : Problem set: 57 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 466 place count 477 transition count 1613
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 477 transition count 1597
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 498 place count 461 transition count 1597
Applied a total of 498 rules in 347 ms. Remains 461 /712 variables (removed 251) and now considering 1597/1844 (removed 247) transitions.
Running 1593 sub problems to find dead transitions.
[2024-06-01 14:59:09] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
// Phase 1: matrix 1565 rows 461 cols
[2024-06-01 14:59:09] [INFO ] Computed 50 invariants in 57 ms
[2024-06-01 14:59:09] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2024-06-01 14:59:30] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:59:33] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:59:33] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/2026 variables, and 44 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 30/37 constraints, State Equation: 0/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1593/1593 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1593 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/457 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 3 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:59:42] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:59:43] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 4 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 3 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 66 places in 405 ms of which 5 ms to minimize.
[2024-06-01 14:59:44] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/2026 variables, and 56 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 30/37 constraints, State Equation: 0/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1593 constraints, Known Traps: 15/15 constraints]
After SMT, in 50857ms problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 50876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51228 ms. Remains : 461/712 places, 1597/1844 transitions.
RANDOM walk for 40000 steps (12 resets) in 890 ms. (44 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
[2024-06-01 15:00:00] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
[2024-06-01 15:00:00] [INFO ] Invariant cache hit.
[2024-06-01 15:00:00] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/372 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/405 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/459 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:00:01] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2024/2026 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 459/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/372 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/405 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/459 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 44 places in 478 ms of which 3 ms to minimize.
[2024-06-01 15:00:46] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 4 ms to minimize.
[2024-06-01 15:00:47] [INFO ] Deduced a trap composed of 187 places in 423 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2024/2026 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 459/461 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 90065ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1597/1597 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 1596
Applied a total of 2 rules in 106 ms. Remains 460 /461 variables (removed 1) and now considering 1596/1597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 460/461 places, 1596/1597 transitions.
Successfully simplified 57 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:01:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 15:01:31] [INFO ] Flatten gal took : 114 ms
[2024-06-01 15:01:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:01:31] [INFO ] Flatten gal took : 115 ms
[2024-06-01 15:01:31] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 72 out of 712 places (down from 184) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 23 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 15:01:31] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-06-01 15:01:31] [INFO ] Computed 50 invariants in 37 ms
[2024-06-01 15:01:31] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 15:01:57] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:01:59] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 2.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 4.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 2.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 2.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 4.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 3.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 2.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 4.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 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 2.0)
(s197 1.0)
(s198 0.0)
(s199 4.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 10.0)
(s236 0.0)
(s237 0.0)
(s238 3.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 4.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 1.0)
(s279 4.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 3.0)
(s318 2.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 7.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 3.0)
(s357 0.0)
(s358 0.0)
(s359 2.0)
(s360 9.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 2.0)
(s379 1.0)
(s380 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 2.0)
(s389 0.0)
(s390 0.0)
(s391 4.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 3.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 2.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 2.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 4.0)
(s454 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-06-01 15:02:05] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 4 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 76 places in 384 ms of which 4 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:02:14] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 50 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 10/10 constraints]
After SMT, in 49802ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49831ms
Finished structural reductions in LTL mode , in 1 iterations and 49863 ms. Remains : 708/712 places, 1844/1844 transitions.
[2024-06-01 15:02:21] [INFO ] Flatten gal took : 63 ms
[2024-06-01 15:02:21] [INFO ] Flatten gal took : 70 ms
[2024-06-01 15:02:21] [INFO ] Input system was already deterministic with 1844 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 144 place count 636 transition count 1724
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 588 transition count 1724
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 400 place count 508 transition count 1644
Applied a total of 400 rules in 127 ms. Remains 508 /712 variables (removed 204) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-06-01 15:02:21] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-06-01 15:02:21] [INFO ] Computed 50 invariants in 29 ms
[2024-06-01 15:02:21] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 15:02:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:02:46] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/2120 variables, and 43 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 28/35 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 3 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:02:54] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 50 places in 283 ms of which 2 ms to minimize.
[2024-06-01 15:02:55] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 2 ms to minimize.
[2024-06-01 15:02:56] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:03:01] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:03:02] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/2120 variables, and 53 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 28/35 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 12/12 constraints]
After SMT, in 48307ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 48327ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48471 ms. Remains : 508/712 places, 1644/1844 transitions.
[2024-06-01 15:03:10] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:03:10] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:03:10] [INFO ] Input system was already deterministic with 1644 transitions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 700 transition count 1836
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 700 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 692 transition count 1828
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 692 transition count 1828
Applied a total of 36 rules in 103 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:03:10] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 692 cols
[2024-06-01 15:03:10] [INFO ] Computed 50 invariants in 24 ms
[2024-06-01 15:03:10] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:03:35] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
(s356 9.0timeout
^^^^^^^^^^
(error "Invalid token: 9.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 2.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 4.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 2.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 2.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 4.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 3.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 2.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 4.0)
(s177 0.0)
(s178 0.0)
(s179 0.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 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 2.0)
(s194 1.0)
(s195 0.0)
(s196 4.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 10.0)
(s233 0.0)
(s234 0.0)
(s235 3.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 4.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 2.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 4.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 3.0)
(s314 2.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 5.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 3.0)
(s353 0.0)
(s354 0.0)
(s355 2.0)
(s356 9.0timeout
)
(s357 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2488 variables, and 42 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:03:45] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:03:46] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:03:49] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:03:51] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:03:51] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:03:58] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 48273ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48304ms
Finished structural reductions in LTL mode , in 1 iterations and 48420 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-06-01 15:03:58] [INFO ] Flatten gal took : 52 ms
[2024-06-01 15:03:58] [INFO ] Flatten gal took : 56 ms
[2024-06-01 15:03:59] [INFO ] Input system was already deterministic with 1828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 700 transition count 1836
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 700 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 692 transition count 1828
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 692 transition count 1828
Applied a total of 36 rules in 53 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:03:59] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:03:59] [INFO ] Invariant cache hit.
[2024-06-01 15:03:59] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2488 variables, and 42 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:04:37] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 2)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 4)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 1)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 2)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 2)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 4)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 3)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 timeout
0)
(s121 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2488 variables, and 43 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 2/2 constraints]
After SMT, in 48513ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48530ms
Finished structural reductions in LTL mode , in 1 iterations and 48588 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-06-01 15:04:47] [INFO ] Flatten gal took : 77 ms
[2024-06-01 15:04:47] [INFO ] Flatten gal took : 71 ms
[2024-06-01 15:04:47] [INFO ] Input system was already deterministic with 1828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 700 transition count 1836
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 700 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 692 transition count 1828
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 692 transition count 1828
Applied a total of 36 rules in 58 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-06-01 15:04:47] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-06-01 15:04:47] [INFO ] Invariant cache hit.
[2024-06-01 15:04:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:05:12] [INFO ] Deduced a trap composed of 3 places in 126 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 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 2.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 4.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 2.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 2.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 4.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 3.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 2.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 4.0)
(s177 0.0)
(s178 0.0)
(s179 0.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 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 2.0)
(s194 1.0)
(s195 0.0)
(s196 4.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 10.0)
(s233 1.0)
(s234 0.0)
(s235 3.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 4.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 2.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 4.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 3.0)
(s314 2.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 5.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 3.0)
(s353 0.0)
(s354 0.0)
(s355 2.0)
(s356 10.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 2.0)
(s375 0.0)
(s376 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 4.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 3.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 2.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 2.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2488 variables, and 42 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-06-01 15:05:26] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 4 ms to minimize.
[2024-06-01 15:05:35] [INFO ] Deduced a trap composed of 73 places in 344 ms of which 3 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 74 places in 403 ms of which 4 ms to minimize.
[2024-06-01 15:05:36] [INFO ] Deduced a trap composed of 73 places in 377 ms of which 3 ms to minimize.
SMT process timed out in 48474ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48490ms
Finished structural reductions in LTL mode , in 1 iterations and 48552 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-06-01 15:05:36] [INFO ] Flatten gal took : 56 ms
[2024-06-01 15:05:36] [INFO ] Flatten gal took : 54 ms
[2024-06-01 15:05:36] [INFO ] Input system was already deterministic with 1828 transitions.
[2024-06-01 15:05:36] [INFO ] Flatten gal took : 51 ms
[2024-06-01 15:05:36] [INFO ] Flatten gal took : 52 ms
[2024-06-01 15:05:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 9 ms.
[2024-06-01 15:05:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 712 places, 1844 transitions and 9400 arcs took 31 ms.
Total runtime 526808 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBLF-PT-S04J04T08-CTLCardinality-2024-15
BK_STOP 1717254337199
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S04J04T08-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/923/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/923/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/923/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T08-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/923/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T08-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/923/ctl_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J04T08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;