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-171654445600273.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-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600273
=====================================================================

--------------------
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 1716863858146

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:37:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:37:40] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-05-28 02:37:40] [INFO ] Transformed 712 places.
[2024-05-28 02:37:40] [INFO ] Transformed 4012 transitions.
[2024-05-28 02:37:40] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 671 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 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 46 ms. Remains 712 /712 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 02:37:40] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2024-05-28 02:37:40] [INFO ] Computed 54 invariants in 86 ms
[2024-05-28 02:37:40] [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-05-28 02:38:07] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20114 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: 1/1 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, 1/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 41 places in 482 ms of which 6 ms to minimize.
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 3 ms to minimize.
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:38:12] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:38:13] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-28 02:38:14] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-28 02:38:19] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 51 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: 10/10 constraints]
After SMT, in 48392ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48472ms
[2024-05-28 02:38:29] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 02:38:29] [INFO ] Invariant cache hit.
[2024-05-28 02:38:29] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-28 02:38:29] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 02:38:29] [INFO ] Invariant cache hit.
[2024-05-28 02:38:31] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:38:39] [INFO ] Implicit Places using invariants and state equation in 10485 ms returned []
Implicit Place search using SMT with State Equation took 10801 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-28 02:38:39] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 02:38:39] [INFO ] Invariant cache hit.
[2024-05-28 02:38:39] [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-05-28 02:39:06] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-28 02:39:14] [INFO ] Deduced a trap composed of 146 places in 123 ms of which 2 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 30049 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-05-28 02:39:29] [INFO ] Deduced a trap composed of 61 places in 305 ms of which 4 ms to minimize.
[2024-05-28 02:39:29] [INFO ] Deduced a trap composed of 41 places in 325 ms of which 3 ms to minimize.
[2024-05-28 02:39:29] [INFO ] Deduced a trap composed of 75 places in 264 ms of which 3 ms to minimize.
[2024-05-28 02:39:29] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 2 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:39:30] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2024-05-28 02:39:33] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:39:33] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 0 ms to minimize.
[2024-05-28 02:39:33] [INFO ] Deduced a trap composed of 75 places in 65 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 30023 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 68519ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 68551ms
Finished structural reductions in LTL mode , in 1 iterations and 127966 ms. Remains : 712/712 places, 1844/1844 transitions.
Support contains 474 out of 712 places after structural reductions.
[2024-05-28 02:39:48] [INFO ] Flatten gal took : 170 ms
[2024-05-28 02:39:48] [INFO ] Flatten gal took : 113 ms
[2024-05-28 02:39:49] [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 (9 resets) in 3982 ms. (10 steps per ms) remains 59/106 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 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 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 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 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 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 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
[2024-05-28 02:39:51] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 02:39:51] [INFO ] Invariant cache hit.
[2024-05-28 02:39:51] [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, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 55 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, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 2/13 constraints. Problems are: Problem set: 15 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 43 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, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/52 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/710 variables, 1/53 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/53 constraints. Problems are: Problem set: 56 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2522/2524 variables, and 763 constraints, problems are : Problem set: 56 solved, 2 unsolved in 3953 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: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 56 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 598/655 variables, 20/20 constraints. Problems are: Problem set: 57 solved, 1 unsolved
[2024-05-28 02:39:56] [INFO ] Deduced a trap composed of 410 places in 551 ms of which 5 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 2/22 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 0/22 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/682 variables, 11/33 constraints. Problems are: Problem set: 57 solved, 1 unsolved
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 3 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-28 02:39:57] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 7/40 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/40 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/709 variables, 21/61 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 0/61 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/710 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/62 constraints. Problems are: Problem set: 57 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2522/2524 variables, and 772 constraints, problems are : Problem set: 57 solved, 1 unsolved in 5008 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/58 constraints, Known Traps: 9/9 constraints]
After SMT, in 9107ms problems are : Problem set: 57 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 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 2 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 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 468 place count 476 transition count 1612
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 484 place count 476 transition count 1596
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 500 place count 460 transition count 1596
Applied a total of 500 rules in 306 ms. Remains 460 /712 variables (removed 252) and now considering 1596/1844 (removed 248) transitions.
Running 1592 sub problems to find dead transitions.
[2024-05-28 02:40:01] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
// Phase 1: matrix 1564 rows 460 cols
[2024-05-28 02:40:01] [INFO ] Computed 50 invariants in 98 ms
[2024-05-28 02:40:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
[2024-05-28 02:40:23] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 5 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:40:24] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 34 places in 304 ms of which 2 ms to minimize.
[2024-05-28 02:40:26] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 3 ms to minimize.
[2024-05-28 02:40:32] [INFO ] Deduced a trap composed of 165 places in 269 ms of which 3 ms to minimize.
[2024-05-28 02:40:32] [INFO ] Deduced a trap composed of 172 places in 275 ms of which 3 ms to minimize.
[2024-05-28 02:40:33] [INFO ] Deduced a trap composed of 180 places in 285 ms of which 3 ms to minimize.
[2024-05-28 02:40:33] [INFO ] Deduced a trap composed of 190 places in 334 ms of which 3 ms to minimize.
[2024-05-28 02:40:34] [INFO ] Deduced a trap composed of 198 places in 346 ms of which 2 ms to minimize.
SMT process timed out in 32885ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 32906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33218 ms. Remains : 460/712 places, 1596/1844 transitions.
RANDOM walk for 40000 steps (10 resets) in 711 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 158264 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 158264 steps, saw 114388 distinct states, run finished after 3007 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-28 02:40:37] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2024-05-28 02:40:37] [INFO ] Invariant cache hit.
[2024-05-28 02:40:37] [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) 409/420 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/439 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 02:40:38] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-28 02:40:38] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-05-28 02:40:38] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 3 ms to minimize.
[2024-05-28 02:40:39] [INFO ] Deduced a trap composed of 44 places in 414 ms of which 3 ms to minimize.
[2024-05-28 02:40:39] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:40:39] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:40:39] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/458 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2022/2024 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 458/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 409/420 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/439 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/458 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1564/2022 variables, 458/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2022 variables, 160/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2022 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2022 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2024 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2024 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2024 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2024 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 678 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 460/460 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 48312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1596/1596 transitions.
Applied a total of 0 rules in 57 ms. Remains 460 /460 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 460/460 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1596/1596 transitions.
Applied a total of 0 rules in 55 ms. Remains 460 /460 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-28 02:41:26] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2024-05-28 02:41:26] [INFO ] Invariant cache hit.
[2024-05-28 02:41:26] [INFO ] Implicit Places using invariants in 783 ms returned [93, 145, 163, 227, 312, 351, 359, 447]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 792 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 452/460 places, 1596/1596 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 446 transition count 1590
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 446 transition count 1590
Applied a total of 12 rules in 73 ms. Remains 446 /452 variables (removed 6) and now considering 1590/1596 (removed 6) transitions.
[2024-05-28 02:41:27] [INFO ] Flow matrix only has 1558 transitions (discarded 32 similar events)
// Phase 1: matrix 1558 rows 446 cols
[2024-05-28 02:41:27] [INFO ] Computed 42 invariants in 43 ms
[2024-05-28 02:41:27] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 02:41:27] [INFO ] Flow matrix only has 1558 transitions (discarded 32 similar events)
[2024-05-28 02:41:27] [INFO ] Invariant cache hit.
[2024-05-28 02:41:29] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 02:41:46] [INFO ] Implicit Places using invariants and state equation in 18635 ms returned []
Implicit Place search using SMT with State Equation took 19248 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/460 places, 1590/1596 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20169 ms. Remains : 446/460 places, 1590/1596 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-05-28 02:41:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 02:41:46] [INFO ] Flatten gal took : 205 ms
[2024-05-28 02:41:46] [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-05-28 02:41:46] [INFO ] Flatten gal took : 77 ms
[2024-05-28 02:41:46] [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 19 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 02:41:46] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 02:41:46] [INFO ] Computed 50 invariants in 58 ms
[2024-05-28 02:41:46] [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-05-28 02:42:12] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 3 ms to minimize.
[2024-05-28 02:42:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
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 20033 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-05-28 02:42:18] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 3 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 76 places in 423 ms of which 3 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:42:19] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-28 02:42:20] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-05-28 02:42:27] [INFO ] Deduced a trap composed of 146 places in 127 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 20023 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 47977ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 47993ms
Finished structural reductions in LTL mode , in 1 iterations and 48017 ms. Remains : 708/712 places, 1844/1844 transitions.
[2024-05-28 02:42:34] [INFO ] Flatten gal took : 68 ms
[2024-05-28 02:42:35] [INFO ] Flatten gal took : 66 ms
[2024-05-28 02:42:35] [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 1 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 172 ms. Remains 508 /712 variables (removed 204) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 02:42:35] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-05-28 02:42:35] [INFO ] Computed 50 invariants in 51 ms
[2024-05-28 02:42:35] [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-05-28 02:42:54] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:43:00] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 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 20051 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-05-28 02:43:07] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 4 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:43:07] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 3 ms to minimize.
[2024-05-28 02:43:08] [INFO ] Deduced a trap composed of 50 places in 326 ms of which 3 ms to minimize.
[2024-05-28 02:43:09] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 2 ms to minimize.
[2024-05-28 02:43:14] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:43:15] [INFO ] Deduced a trap composed of 19 places in 238 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 20023 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 47797ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 47824ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48000 ms. Remains : 508/712 places, 1644/1844 transitions.
[2024-05-28 02:43:23] [INFO ] Flatten gal took : 53 ms
[2024-05-28 02:43:23] [INFO ] Flatten gal took : 56 ms
[2024-05-28 02:43:23] [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 85 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:43:23] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 692 cols
[2024-05-28 02:43:23] [INFO ] Computed 50 invariants in 26 ms
[2024-05-28 02:43:23] [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-05-28 02:43:47] [INFO ] Deduced a trap composed of 3 places in 66 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 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 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 0.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 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 1.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 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 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 1.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 timeout
1.0) 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-05-28 02:43:57] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 3 ms to minimize.
[2024-05-28 02:43:57] [INFO ] Deduced a trap composed of 90 places in 272 ms of which 2 ms to minimize.
[2024-05-28 02:43:57] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:43:57] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-28 02:43:57] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:43:58] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-05-28 02:44:00] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:44:00] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:44:02] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:44:02] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 3 ms to minimize.
[2024-05-28 02:44:09] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2488 variables, and 53 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20025 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: 12/12 constraints]
After SMT, in 48111ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48127ms
Finished structural reductions in LTL mode , in 1 iterations and 48217 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-05-28 02:44:11] [INFO ] Flatten gal took : 64 ms
[2024-05-28 02:44:11] [INFO ] Flatten gal took : 60 ms
[2024-05-28 02:44:11] [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 75 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:44:12] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:44:12] [INFO ] Invariant cache hit.
[2024-05-28 02:44:12] [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-05-28 02:44:37] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 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 20043 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-05-28 02:44:49] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:44:58] [INFO ] Deduced a trap composed of 73 places in 342 ms of which 3 ms to minimize.
[2024-05-28 02:44:58] [INFO ] Deduced a trap composed of 74 places in 334 ms of which 3 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 73 places in 346 ms of which 10 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 3 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:44:59] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2488 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20025 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: 10/10 constraints]
After SMT, in 47902ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 47924ms
Finished structural reductions in LTL mode , in 1 iterations and 48005 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-05-28 02:45:00] [INFO ] Flatten gal took : 59 ms
[2024-05-28 02:45:00] [INFO ] Flatten gal took : 63 ms
[2024-05-28 02:45:00] [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 99 ms. Remains 692 /712 variables (removed 20) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-28 02:45:00] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-28 02:45:00] [INFO ] Invariant cache hit.
[2024-05-28 02:45:00] [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-05-28 02:45:25] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 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 20027 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-05-28 02:45:40] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 3 ms to minimize.
[2024-05-28 02:45:48] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 3 ms to minimize.
[2024-05-28 02:45:49] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 5 ms to minimize.
[2024-05-28 02:45:49] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 4 ms to minimize.
[2024-05-28 02:45:49] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 3 ms to minimize.
[2024-05-28 02:45:49] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2024-05-28 02:45:49] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
SMT process timed out in 49605ms, After SMT, problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 49647ms
Finished structural reductions in LTL mode , in 1 iterations and 49751 ms. Remains : 692/712 places, 1828/1844 transitions.
[2024-05-28 02:45:50] [INFO ] Flatten gal took : 54 ms
[2024-05-28 02:45:50] [INFO ] Flatten gal took : 55 ms
[2024-05-28 02:45:50] [INFO ] Input system was already deterministic with 1828 transitions.
[2024-05-28 02:45:50] [INFO ] Flatten gal took : 56 ms
[2024-05-28 02:45:50] [INFO ] Flatten gal took : 58 ms
[2024-05-28 02:45:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 02:45:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 712 places, 1844 transitions and 9400 arcs took 17 ms.
Total runtime 490742 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 712
TRANSITIONS: 1844
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.047s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/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: 992
MODEL NAME: /home/mcc/execution/416/model
712 places, 1844 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r289-tajo-171654445600273"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;