About the Execution of GreatSPN+red for PolyORBNT-PT-S10J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16187.796 | 3600000.00 | 9923502.00 | 385.60 | ???FFTT?T?????FF | 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.r289-tajo-171654446000481.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 PolyORBNT-PT-S10J20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000481
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J20-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716889170219
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:39:32] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2024-05-28 09:39:32] [INFO ] Transformed 474 places.
[2024-05-28 09:39:32] [INFO ] Transformed 11760 transitions.
[2024-05-28 09:39:32] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 784 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 442 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 465 transition count 1650
Applied a total of 9 rules in 78 ms. Remains 465 /474 variables (removed 9) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-05-28 09:39:32] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 465 cols
[2024-05-28 09:39:32] [INFO ] Computed 63 invariants in 72 ms
[2024-05-28 09:39:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2106 variables, and 51 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 20086 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/465 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1645 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/454 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 3)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s45 3)
(s46 0)
(s47 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2106 variables, and 52 constraints, problems are : Problem set: 66 solved, 1573 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/465 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/639 constraints, Known Traps: 0/0 constraints]
After SMT, in 55236ms problems are : Problem set: 66 solved, 1573 unsolved
Search for dead transitions found 66 dead transitions in 55288ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2024-05-28 09:40:28] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
// Phase 1: matrix 1575 rows 465 cols
[2024-05-28 09:40:28] [INFO ] Computed 63 invariants in 42 ms
[2024-05-28 09:40:28] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-28 09:40:28] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
[2024-05-28 09:40:28] [INFO ] Invariant cache hit.
[2024-05-28 09:40:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:40:29] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 465/474 places, 1584/1650 transitions.
Applied a total of 0 rules in 16 ms. Remains 465 /465 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56513 ms. Remains : 465/474 places, 1584/1650 transitions.
Support contains 442 out of 465 places after structural reductions.
[2024-05-28 09:40:29] [INFO ] Flatten gal took : 204 ms
[2024-05-28 09:40:29] [INFO ] Flatten gal took : 130 ms
[2024-05-28 09:40:30] [INFO ] Input system was already deterministic with 1584 transitions.
RANDOM walk for 40000 steps (2234 resets) in 4267 ms. (9 steps per ms) remains 75/90 properties
BEST_FIRST walk for 4004 steps (39 resets) in 76 ms. (52 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 81 ms. (48 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (41 resets) in 53 ms. (74 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 74 ms. (53 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 42 ms. (93 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (40 resets) in 48 ms. (81 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 43 ms. (91 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 43 ms. (90 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (39 resets) in 43 ms. (90 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (38 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (48 resets) in 64 ms. (61 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 39 ms. (100 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (48 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 45 ms. (87 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 42 ms. (93 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (41 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 37 ms. (105 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (39 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (39 resets) in 61 ms. (64 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (40 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (44 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (48 resets) in 53 ms. (74 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (41 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (39 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (39 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (41 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (39 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (40 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
[2024-05-28 09:40:32] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
[2024-05-28 09:40:32] [INFO ] Invariant cache hit.
[2024-05-28 09:40:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 23/23 constraints. Problems are: Problem set: 16 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 2/25 constraints. Problems are: Problem set: 16 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/25 constraints. Problems are: Problem set: 16 solved, 59 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 3 (OVERLAPS) 85/443 variables, 21/46 constraints. Problems are: Problem set: 23 solved, 52 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 3/49 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/49 constraints. Problems are: Problem set: 26 solved, 49 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/465 variables, 14/63 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/63 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1575/2040 variables, 465/528 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2040 variables, 1/529 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2040 variables, 0/529 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/2040 variables, 0/529 constraints. Problems are: Problem set: 54 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2040/2040 variables, and 529 constraints, problems are : Problem set: 54 solved, 21 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 465/465 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 225/264 variables, 25/25 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/25 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 139/403 variables, 18/43 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/43 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 60/463 variables, 19/62 constraints. Problems are: Problem set: 54 solved, 21 unsolved
[2024-05-28 09:40:37] [INFO ] Deduced a trap composed of 134 places in 354 ms of which 26 ms to minimize.
[2024-05-28 09:40:38] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 4 ms to minimize.
[2024-05-28 09:40:38] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-05-28 09:40:38] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 4/66 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/66 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/464 variables, 1/67 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/67 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1575/2039 variables, 464/531 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2039 variables, 1/532 constraints. Problems are: Problem set: 54 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2039 variables, 18/550 constraints. Problems are: Problem set: 54 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2039/2040 variables, and 550 constraints, problems are : Problem set: 54 solved, 21 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 464/465 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/74 constraints, Known Traps: 4/4 constraints]
After SMT, in 9425ms problems are : Problem set: 54 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1584/1584 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 464 transition count 1568
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 448 transition count 1564
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 444 transition count 1564
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 41 place count 444 transition count 1545
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 79 place count 425 transition count 1545
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 424 transition count 1544
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 424 transition count 1544
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 422 transition count 1542
Applied a total of 85 rules in 274 ms. Remains 422 /465 variables (removed 43) and now considering 1542/1584 (removed 42) transitions.
Running 1531 sub problems to find dead transitions.
[2024-05-28 09:40:41] [INFO ] Flow matrix only has 1533 transitions (discarded 9 similar events)
// Phase 1: matrix 1533 rows 422 cols
[2024-05-28 09:40:41] [INFO ] Computed 62 invariants in 40 ms
[2024-05-28 09:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
[2024-05-28 09:41:17] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/1955 variables, and 53 constraints, problems are : Problem set: 0 solved, 1531 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 45/46 constraints, Generalized P Invariants (flows): 7/16 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1531/1531 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
[2024-05-28 09:41:29] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 2 ms to minimize.
[2024-05-28 09:41:30] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2024-05-28 09:41:30] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1531 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s43 3)
(s44 0)
(s45 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 3)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 3)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 4)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 3)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 9)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 4)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s319 0)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 4)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 4)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)timeout
(s378 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/1955 variables, and 56 constraints, problems are : Problem set: 0 solved, 1531 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 45/46 constraints, Generalized P Invariants (flows): 7/16 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1531 constraints, Known Traps: 4/4 constraints]
After SMT, in 64097ms problems are : Problem set: 0 solved, 1531 unsolved
Search for dead transitions found 0 dead transitions in 64120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64402 ms. Remains : 422/465 places, 1542/1584 transitions.
RANDOM walk for 40000 steps (2746 resets) in 1307 ms. (30 steps per ms) remains 13/21 properties
BEST_FIRST walk for 40004 steps (425 resets) in 239 ms. (166 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (439 resets) in 268 ms. (148 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (428 resets) in 230 ms. (173 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (443 resets) in 248 ms. (160 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (427 resets) in 245 ms. (162 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (444 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (432 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
[2024-05-28 09:41:46] [INFO ] Flow matrix only has 1533 transitions (discarded 9 similar events)
[2024-05-28 09:41:46] [INFO ] Invariant cache hit.
[2024-05-28 09:41:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 96/126 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 254/380 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 41/421 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1533/1954 variables, 421/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1954 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1954 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/1955 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1955 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1955 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1955/1955 variables, and 485 constraints, problems are : Problem set: 0 solved, 3 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 422/422 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 96/126 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 254/380 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 41/421 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1533/1954 variables, 421/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1954 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1954 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1954 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/1955 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1955 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1955 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1955 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1955/1955 variables, and 488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2564 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 422/422 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3418ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 114 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1542/1542 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 422 transition count 1539
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 419 transition count 1539
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 419 transition count 1530
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 410 transition count 1530
Applied a total of 24 rules in 73 ms. Remains 410 /422 variables (removed 12) and now considering 1530/1542 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 410/422 places, 1530/1542 transitions.
RANDOM walk for 40000 steps (2938 resets) in 1029 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (400 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (399 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 259706 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 259706 steps, saw 42860 distinct states, run finished after 3005 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-28 09:41:53] [INFO ] Flow matrix only has 1521 transitions (discarded 9 similar events)
// Phase 1: matrix 1521 rows 410 cols
[2024-05-28 09:41:54] [INFO ] Computed 62 invariants in 15 ms
[2024-05-28 09:41:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/125 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 261/386 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/387 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/409 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1521/1930 variables, 409/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1930 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1930 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/1931 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1931 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1931 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1931/1931 variables, and 473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/125 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 261/386 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 09:41:55] [INFO ] Deduced a trap composed of 81 places in 227 ms of which 3 ms to minimize.
[2024-05-28 09:41:55] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/409 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1521/1930 variables, 409/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1930 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1930 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1931 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1931 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1931 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1931 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1931/1931 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2329ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1530/1530 transitions.
Applied a total of 0 rules in 42 ms. Remains 410 /410 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 410/410 places, 1530/1530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1530/1530 transitions.
Applied a total of 0 rules in 37 ms. Remains 410 /410 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
[2024-05-28 09:41:56] [INFO ] Flow matrix only has 1521 transitions (discarded 9 similar events)
[2024-05-28 09:41:56] [INFO ] Invariant cache hit.
[2024-05-28 09:41:57] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-28 09:41:57] [INFO ] Flow matrix only has 1521 transitions (discarded 9 similar events)
[2024-05-28 09:41:57] [INFO ] Invariant cache hit.
[2024-05-28 09:41:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:42:01] [INFO ] Implicit Places using invariants and state equation in 4685 ms returned []
Implicit Place search using SMT with State Equation took 5383 ms to find 0 implicit places.
[2024-05-28 09:42:01] [INFO ] Redundant transitions in 117 ms returned []
Running 1519 sub problems to find dead transitions.
[2024-05-28 09:42:02] [INFO ] Flow matrix only has 1521 transitions (discarded 9 similar events)
[2024-05-28 09:42:02] [INFO ] Invariant cache hit.
[2024-05-28 09:42:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 1519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 1519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1519 unsolved
At refinement iteration 3 (OVERLAPS) 1/401 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1519 unsolved
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
At refinement iteration 5 (OVERLAPS) 9/410 variables, 9/62 constraints. Problems are: Problem set: 549 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1931 variables, and 62 constraints, problems are : Problem set: 549 solved, 970 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1519/1519 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 549 solved, 970 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 45/45 constraints. Problems are: Problem set: 549 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 7/52 constraints. Problems are: Problem set: 549 solved, 970 unsolved
[2024-05-28 09:42:55] [INFO ] Deduced a trap composed of 189 places in 178 ms of which 3 ms to minimize.
[2024-05-28 09:42:55] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 2/54 constraints. Problems are: Problem set: 549 solved, 970 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/54 constraints. Problems are: Problem set: 549 solved, 970 unsolved
At refinement iteration 4 (OVERLAPS) 1/401 variables, 1/55 constraints. Problems are: Problem set: 549 solved, 970 unsolved
[2024-05-28 09:43:20] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 3 ms to minimize.
[2024-05-28 09:43:20] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 2/57 constraints. Problems are: Problem set: 549 solved, 970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1931 variables, and 57 constraints, problems are : Problem set: 549 solved, 970 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 7/16 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1519 constraints, Known Traps: 4/4 constraints]
After SMT, in 81738ms problems are : Problem set: 549 solved, 970 unsolved
Search for dead transitions found 549 dead transitions in 81758ms
Found 549 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 549 transitions
Dead transitions reduction (with SMT) removed 549 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/410 places, 981/1530 transitions.
Applied a total of 0 rules in 30 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2024-05-28 09:43:23] [INFO ] Redundant transitions in 44 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87389 ms. Remains : 410/410 places, 981/1530 transitions.
Successfully simplified 54 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:43:23] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 09:43:23] [INFO ] Flatten gal took : 112 ms
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:43:24] [INFO ] Flatten gal took : 119 ms
[2024-05-28 09:43:24] [INFO ] Input system was already deterministic with 1584 transitions.
Support contains 249 out of 465 places (down from 293) after GAL structural reductions.
FORMULA PolyORBNT-PT-S10J20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 1584/1584 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 463 transition count 1583
Applied a total of 3 rules in 81 ms. Remains 463 /465 variables (removed 2) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-05-28 09:43:24] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-05-28 09:43:24] [INFO ] Computed 62 invariants in 18 ms
[2024-05-28 09:43:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/2037 variables, and 51 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 3)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s45 3)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 3)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 timeout
0)
(s72 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 61838ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 61854ms
Finished structural reductions in LTL mode , in 1 iterations and 61940 ms. Remains : 463/465 places, 1583/1584 transitions.
[2024-05-28 09:44:26] [INFO ] Flatten gal took : 99 ms
[2024-05-28 09:44:26] [INFO ] Flatten gal took : 105 ms
[2024-05-28 09:44:26] [INFO ] Input system was already deterministic with 1583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 1584/1584 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 1584
Applied a total of 1 rules in 33 ms. Remains 464 /465 variables (removed 1) and now considering 1584/1584 (removed 0) transitions.
Running 1573 sub problems to find dead transitions.
[2024-05-28 09:44:26] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
// Phase 1: matrix 1575 rows 464 cols
[2024-05-28 09:44:26] [INFO ] Computed 62 invariants in 18 ms
[2024-05-28 09:44:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s45 4.0)
(s46 0.0)
(s47 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 4.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.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 4.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 4.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2039 variables, and 51 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 8/18 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1573/1573 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
At refinement iteration 3 (OVERLAPS) 1/454 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/2039 variables, and 52 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 8/18 constraints, State Equation: 0/464 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1573 constraints, Known Traps: 0/0 constraints]
After SMT, in 61110ms problems are : Problem set: 0 solved, 1573 unsolved
Search for dead transitions found 0 dead transitions in 61129ms
Finished structural reductions in LTL mode , in 1 iterations and 61167 ms. Remains : 464/465 places, 1584/1584 transitions.
[2024-05-28 09:45:27] [INFO ] Flatten gal took : 106 ms
[2024-05-28 09:45:28] [INFO ] Flatten gal took : 94 ms
[2024-05-28 09:45:28] [INFO ] Input system was already deterministic with 1584 transitions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 1584/1584 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 463 transition count 1583
Applied a total of 3 rules in 45 ms. Remains 463 /465 variables (removed 2) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-05-28 09:45:28] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-05-28 09:45:28] [INFO ] Computed 62 invariants in 17 ms
[2024-05-28 09:45:28] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-PT-S10J20
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 474
TRANSITIONS: 11760
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.838s, Sys 0.044s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.131s, 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: 686
MODEL NAME: /home/mcc/execution/model
474 places, 11760 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
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 PolyORBNT-PT-S10J20, 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-171654446000481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 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 ;