Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 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 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 1.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717260410105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:46:51] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-06-01 16:46:51] [INFO ] Transformed 909 places.
[2024-06-01 16:46:51] [INFO ] Transformed 1970 transitions.
[2024-06-01 16:46:51] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2024-06-01 16:46:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:46:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:46:52] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 16:46:52] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 898 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 41 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:46:52] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-06-01 16:46:52] [INFO ] Computed 137 invariants in 84 ms
[2024-06-01 16:46:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20092 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 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 Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43276ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43333ms
[2024-06-01 16:47:35] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:35] [INFO ] Invariant cache hit.
[2024-06-01 16:47:35] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 16:47:35] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:35] [INFO ] Invariant cache hit.
[2024-06-01 16:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:47:36] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:47:36] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:36] [INFO ] Invariant cache hit.
[2024-06-01 16:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2215 variables, and 137 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1314 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 95 solved, 1214 unsolved
[2024-06-01 16:48:39] [INFO ] Deduced a trap composed of 24 places in 602 ms of which 60 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2215 variables, and 138 constraints, problems are : Problem set: 95 solved, 1214 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 1/1 constraints]
After SMT, in 63202ms problems are : Problem set: 95 solved, 1214 unsolved
Search for dead transitions found 95 dead transitions in 63217ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1220/1315 transitions.
Applied a total of 0 rules in 27 ms. Remains 904 /904 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107759 ms. Remains : 904/909 places, 1220/1315 transitions.
Support contains 898 out of 904 places after structural reductions.
[2024-06-01 16:48:40] [INFO ] Flatten gal took : 322 ms
[2024-06-01 16:48:40] [INFO ] Flatten gal took : 108 ms
[2024-06-01 16:48:41] [INFO ] Input system was already deterministic with 1220 transitions.
Reduction of identical properties reduced properties to check from 81 to 80
RANDOM walk for 40000 steps (2789 resets) in 2822 ms. (14 steps per ms) remains 35/80 properties
BEST_FIRST walk for 4003 steps (34 resets) in 442 ms. (9 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (101 resets) in 121 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (16 resets) in 42 ms. (93 steps per ms) remains 30/35 properties
BEST_FIRST walk for 4003 steps (50 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (24 resets) in 61 ms. (64 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (47 resets) in 35 ms. (111 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (65 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (60 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (78 resets) in 25 ms. (154 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2024-06-01 16:48:42] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2024-06-01 16:48:42] [INFO ] Computed 137 invariants in 47 ms
[2024-06-01 16:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 558/833 variables, 112/112 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/833 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 71/904 variables, 25/137 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/137 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1216/2120 variables, 904/1041 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2120 variables, 1/1042 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2120 variables, 0/1042 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/2120 variables, 0/1042 constraints. Problems are: Problem set: 23 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2120/2120 variables, and 1042 constraints, problems are : Problem set: 23 solved, 5 unsolved in 3482 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 211/220 variables, 7/7 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/7 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 274/494 variables, 46/53 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 0/53 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 220/714 variables, 44/97 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/97 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 174/888 variables, 25/122 constraints. Problems are: Problem set: 23 solved, 5 unsolved
[2024-06-01 16:48:48] [INFO ] Deduced a trap composed of 175 places in 519 ms of which 7 ms to minimize.
[2024-06-01 16:48:48] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 2/124 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/888 variables, 0/124 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 15/903 variables, 15/139 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/903 variables, 0/139 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1216/2119 variables, 903/1042 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2119 variables, 1/1043 constraints. Problems are: Problem set: 23 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2119 variables, 5/1048 constraints. Problems are: Problem set: 23 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2119/2120 variables, and 1048 constraints, problems are : Problem set: 23 solved, 5 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 903/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/28 constraints, Known Traps: 2/2 constraints]
After SMT, in 9375ms problems are : Problem set: 23 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 840 transition count 1156
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 128 place count 840 transition count 1091
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 258 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 774 transition count 1090
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 772 transition count 1088
Applied a total of 264 rules in 368 ms. Remains 772 /904 variables (removed 132) and now considering 1088/1220 (removed 132) transitions.
Running 1082 sub problems to find dead transitions.
[2024-06-01 16:48:52] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-06-01 16:48:52] [INFO ] Computed 137 invariants in 42 ms
[2024-06-01 16:48:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 238 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 198 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:49:06] [INFO ] Deduced a trap composed of 198 places in 376 ms of which 5 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 198 places in 383 ms of which 6 ms to minimize.
[2024-06-01 16:49:07] [INFO ] Deduced a trap composed of 241 places in 361 ms of which 6 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 199 places in 385 ms of which 5 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 266 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:49:08] [INFO ] Deduced a trap composed of 209 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 252 places in 228 ms of which 4 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 209 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:49:09] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:49:10] [INFO ] Deduced a trap composed of 199 places in 373 ms of which 5 ms to minimize.
[2024-06-01 16:49:11] [INFO ] Deduced a trap composed of 199 places in 335 ms of which 6 ms to minimize.
[2024-06-01 16:49:12] [INFO ] Deduced a trap composed of 198 places in 343 ms of which 7 ms to minimize.
[2024-06-01 16:49:12] [INFO ] Deduced a trap composed of 274 places in 361 ms of which 5 ms to minimize.
[2024-06-01 16:49:12] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 5 ms to minimize.
[2024-06-01 16:49:13] [INFO ] Deduced a trap composed of 259 places in 331 ms of which 5 ms to minimize.
[2024-06-01 16:49:13] [INFO ] Deduced a trap composed of 198 places in 289 ms of which 5 ms to minimize.
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:49:14] [INFO ] Deduced a trap composed of 198 places in 339 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1856 variables, and 152 constraints, problems are : Problem set: 0 solved, 1082 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1082/1082 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1082 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 215 places in 292 ms of which 4 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 207 places in 325 ms of which 5 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 244 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 3 ms to minimize.
[2024-06-01 16:49:19] [INFO ] Deduced a trap composed of 272 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 4 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 245 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 251 places in 237 ms of which 4 ms to minimize.
[2024-06-01 16:49:20] [INFO ] Deduced a trap composed of 257 places in 234 ms of which 4 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 265 places in 239 ms of which 5 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:49:21] [INFO ] Deduced a trap composed of 202 places in 269 ms of which 4 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 3 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 198 places in 245 ms of which 4 ms to minimize.
[2024-06-01 16:49:22] [INFO ] Deduced a trap composed of 199 places in 324 ms of which 8 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 136 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 140 places in 317 ms of which 4 ms to minimize.
[2024-06-01 16:49:23] [INFO ] Deduced a trap composed of 136 places in 323 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 16:49:29] [INFO ] Deduced a trap composed of 241 places in 389 ms of which 4 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 268 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 242 places in 377 ms of which 6 ms to minimize.
[2024-06-01 16:49:30] [INFO ] Deduced a trap composed of 277 places in 315 ms of which 4 ms to minimize.
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 254 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:49:31] [INFO ] Deduced a trap composed of 247 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 250 places in 348 ms of which 9 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 247 places in 336 ms of which 4 ms to minimize.
[2024-06-01 16:49:32] [INFO ] Deduced a trap composed of 251 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 261 places in 281 ms of which 11 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 253 places in 297 ms of which 3 ms to minimize.
[2024-06-01 16:49:33] [INFO ] Deduced a trap composed of 284 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 198 places in 314 ms of which 6 ms to minimize.
[2024-06-01 16:49:34] [INFO ] Deduced a trap composed of 247 places in 365 ms of which 5 ms to minimize.
[2024-06-01 16:49:35] [INFO ] Deduced a trap composed of 257 places in 338 ms of which 5 ms to minimize.
SMT process timed out in 42826ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 42841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43215 ms. Remains : 772/904 places, 1088/1220 transitions.
RANDOM walk for 37358 steps (1972 resets) in 1140 ms. (32 steps per ms) remains 0/5 properties
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J60-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:49:35] [INFO ] Flatten gal took : 91 ms
[2024-06-01 16:49:36] [INFO ] Flatten gal took : 64 ms
[2024-06-01 16:49:36] [INFO ] Input system was already deterministic with 1220 transitions.
Support contains 830 out of 904 places (down from 832) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 904 transition count 1157
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 841 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
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 262 place count 773 transition count 1089
Applied a total of 262 rules in 128 ms. Remains 773 /904 variables (removed 131) and now considering 1089/1220 (removed 131) transitions.
Running 1083 sub problems to find dead transitions.
[2024-06-01 16:49:36] [INFO ] Flow matrix only has 1085 transitions (discarded 4 similar events)
// Phase 1: matrix 1085 rows 773 cols
[2024-06-01 16:49:36] [INFO ] Computed 137 invariants in 32 ms
[2024-06-01 16:49:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 19/132 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 16:49:49] [INFO ] Deduced a trap composed of 253 places in 236 ms of which 4 ms to minimize.
[2024-06-01 16:49:50] [INFO ] Deduced a trap composed of 206 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:49:50] [INFO ] Deduced a trap composed of 207 places in 256 ms of which 3 ms to minimize.
[2024-06-01 16:49:50] [INFO ] Deduced a trap composed of 205 places in 244 ms of which 4 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 255 places in 239 ms of which 5 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 200 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 259 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:49:51] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 200 places in 268 ms of which 3 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 198 places in 232 ms of which 4 ms to minimize.
[2024-06-01 16:49:52] [INFO ] Deduced a trap composed of 246 places in 274 ms of which 3 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 198 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 199 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 212 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:49:53] [INFO ] Deduced a trap composed of 198 places in 252 ms of which 4 ms to minimize.
[2024-06-01 16:49:54] [INFO ] Deduced a trap composed of 255 places in 356 ms of which 3 ms to minimize.
[2024-06-01 16:49:54] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 3 ms to minimize.
[2024-06-01 16:49:54] [INFO ] Deduced a trap composed of 198 places in 254 ms of which 4 ms to minimize.
[2024-06-01 16:49:55] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:49:55] [INFO ] Deduced a trap composed of 198 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
[2024-06-01 16:49:56] [INFO ] Deduced a trap composed of 213 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:49:56] [INFO ] Deduced a trap composed of 212 places in 239 ms of which 3 ms to minimize.
[2024-06-01 16:49:57] [INFO ] Deduced a trap composed of 264 places in 237 ms of which 3 ms to minimize.
[2024-06-01 16:49:57] [INFO ] Deduced a trap composed of 211 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:49:57] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 6 ms to minimize.
[2024-06-01 16:49:57] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:49:58] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 3 ms to minimize.
[2024-06-01 16:49:58] [INFO ] Deduced a trap composed of 199 places in 260 ms of which 3 ms to minimize.
[2024-06-01 16:49:58] [INFO ] Deduced a trap composed of 198 places in 263 ms of which 4 ms to minimize.
[2024-06-01 16:49:59] [INFO ] Deduced a trap composed of 199 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 22566ms, After SMT, problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 22575ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22719 ms. Remains : 773/904 places, 1089/1220 transitions.
[2024-06-01 16:49:59] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:49:59] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:49:59] [INFO ] Input system was already deterministic with 1089 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 39 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:49:59] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-06-01 16:49:59] [INFO ] Computed 137 invariants in 37 ms
[2024-06-01 16:49:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:50:25] [INFO ] Deduced a trap composed of 137 places in 231 ms of which 3 ms to minimize.
[2024-06-01 16:50:26] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:50:26] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 2 ms to minimize.
[2024-06-01 16:50:28] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:50:30] [INFO ] Deduced a trap composed of 137 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:50:32] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 3 ms to minimize.
[2024-06-01 16:50:33] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
[2024-06-01 16:50:35] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 2 ms to minimize.
[2024-06-01 16:50:36] [INFO ] Deduced a trap composed of 137 places in 233 ms of which 3 ms to minimize.
[2024-06-01 16:50:38] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:50:41] [INFO ] Deduced a trap composed of 137 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:50:41] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 144 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 13/13 constraints]
After SMT, in 42670ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42682ms
Finished structural reductions in LTL mode , in 1 iterations and 42724 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:50:42] [INFO ] Flatten gal took : 81 ms
[2024-06-01 16:50:42] [INFO ] Flatten gal took : 106 ms
[2024-06-01 16:50:42] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1218
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1157
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 126 place count 841 transition count 1155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1153
Applied a total of 134 rules in 88 ms. Remains 837 /904 variables (removed 67) and now considering 1153/1220 (removed 67) transitions.
Running 1147 sub problems to find dead transitions.
[2024-06-01 16:50:42] [INFO ] Flow matrix only has 1149 transitions (discarded 4 similar events)
// Phase 1: matrix 1149 rows 837 cols
[2024-06-01 16:50:42] [INFO ] Computed 137 invariants in 37 ms
[2024-06-01 16:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1147 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 831/1986 variables, and 131 constraints, problems are : Problem set: 0 solved, 1147 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1147/1147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/831 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/831 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
[2024-06-01 16:51:09] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 2 ms to minimize.
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 2 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/831 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/1986 variables, and 135 constraints, problems are : Problem set: 0 solved, 1147 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/837 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1147 constraints, Known Traps: 4/4 constraints]
After SMT, in 42991ms problems are : Problem set: 0 solved, 1147 unsolved
Search for dead transitions found 0 dead transitions in 43005ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43098 ms. Remains : 837/904 places, 1153/1220 transitions.
[2024-06-01 16:51:25] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:51:25] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:51:25] [INFO ] Input system was already deterministic with 1153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Applied a total of 0 rules in 5 ms. Remains 904 /904 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Running 1214 sub problems to find dead transitions.
[2024-06-01 16:51:25] [INFO ] Flow matrix only has 1216 transitions (discarded 4 similar events)
// Phase 1: matrix 1216 rows 904 cols
[2024-06-01 16:51:25] [INFO ] Computed 137 invariants in 44 ms
[2024-06-01 16:51:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2120 variables, and 131 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-06-01 16:51:52] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 3 ms to minimize.
[2024-06-01 16:51:59] [INFO ] Deduced a trap composed of 137 places in 301 ms of which 4 ms to minimize.
[2024-06-01 16:52:02] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-06-01 16:52:04] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:52:07] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-06-01 16:52:08] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 2 ms to minimize.
SMT process timed out in 42590ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 42601ms
Finished structural reductions in LTL mode , in 1 iterations and 42609 ms. Remains : 904/904 places, 1220/1220 transitions.
[2024-06-01 16:52:08] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:52:08] [INFO ] Flatten gal took : 66 ms
[2024-06-01 16:52:08] [INFO ] Input system was already deterministic with 1220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 16 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:52:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-06-01 16:52:08] [INFO ] Computed 137 invariants in 29 ms
[2024-06-01 16:52:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 137 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:52:35] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:52:38] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-06-01 16:52:40] [INFO ] Deduced a trap composed of 137 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:52:42] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-06-01 16:52:43] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:52:45] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 3 ms to minimize.
[2024-06-01 16:52:46] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 3 ms to minimize.
[2024-06-01 16:52:48] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 43130ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 43147ms
Finished structural reductions in LTL mode , in 1 iterations and 43167 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:52:51] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:52:51] [INFO ] Flatten gal took : 57 ms
[2024-06-01 16:52:52] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1154
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1154
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1089
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1088
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1088
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1086
Applied a total of 268 rules in 88 ms. Remains 770 /904 variables (removed 134) and now considering 1086/1220 (removed 134) transitions.
Running 1080 sub problems to find dead transitions.
[2024-06-01 16:52:52] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-06-01 16:52:52] [INFO ] Computed 137 invariants in 25 ms
[2024-06-01 16:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 247 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 248 places in 313 ms of which 5 ms to minimize.
[2024-06-01 16:53:05] [INFO ] Deduced a trap composed of 260 places in 289 ms of which 3 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 197 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:53:06] [INFO ] Deduced a trap composed of 208 places in 276 ms of which 5 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 207 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 213 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:53:07] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 5 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 207 places in 262 ms of which 5 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 203 places in 266 ms of which 4 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 206 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:53:08] [INFO ] Deduced a trap composed of 208 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 201 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 205 places in 253 ms of which 4 ms to minimize.
[2024-06-01 16:53:09] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 197 places in 305 ms of which 3 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 206 places in 323 ms of which 6 ms to minimize.
[2024-06-01 16:53:10] [INFO ] Deduced a trap composed of 225 places in 249 ms of which 4 ms to minimize.
[2024-06-01 16:53:11] [INFO ] Deduced a trap composed of 242 places in 333 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-06-01 16:53:12] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:53:13] [INFO ] Deduced a trap composed of 197 places in 339 ms of which 5 ms to minimize.
[2024-06-01 16:53:14] [INFO ] Deduced a trap composed of 244 places in 348 ms of which 5 ms to minimize.
SMT process timed out in 22811ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22837ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22929 ms. Remains : 770/904 places, 1086/1220 transitions.
[2024-06-01 16:53:14] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:53:15] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:53:15] [INFO ] Input system was already deterministic with 1086 transitions.
RANDOM walk for 338 steps (15 resets) in 16 ms. (19 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S05J60-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 904 transition count 1218
Reduce places removed 2 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 63 rules applied. Total rules applied 65 place count 902 transition count 1157
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 126 place count 841 transition count 1157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 841 transition count 1156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 840 transition count 1156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 839 transition count 1155
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 837 transition count 1153
Applied a total of 134 rules in 88 ms. Remains 837 /904 variables (removed 67) and now considering 1153/1220 (removed 67) transitions.
Running 1147 sub problems to find dead transitions.
[2024-06-01 16:53:15] [INFO ] Flow matrix only has 1149 transitions (discarded 4 similar events)
// Phase 1: matrix 1149 rows 837 cols
[2024-06-01 16:53:15] [INFO ] Computed 137 invariants in 26 ms
[2024-06-01 16:53:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/832 variables, 19/132 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 314 places in 368 ms of which 6 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:53:30] [INFO ] Deduced a trap composed of 263 places in 306 ms of which 4 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 263 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:53:31] [INFO ] Deduced a trap composed of 263 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 275 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 263 places in 274 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 263 places in 285 ms of which 4 ms to minimize.
[2024-06-01 16:53:32] [INFO ] Deduced a trap composed of 263 places in 296 ms of which 5 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 272 places in 296 ms of which 4 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 278 places in 337 ms of which 6 ms to minimize.
[2024-06-01 16:53:33] [INFO ] Deduced a trap composed of 275 places in 295 ms of which 4 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 275 places in 284 ms of which 4 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 273 places in 289 ms of which 4 ms to minimize.
[2024-06-01 16:53:34] [INFO ] Deduced a trap composed of 263 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 275 places in 246 ms of which 4 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 263 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:53:35] [INFO ] Deduced a trap composed of 274 places in 300 ms of which 4 ms to minimize.
[2024-06-01 16:53:36] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/832 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 307 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:53:37] [INFO ] Deduced a trap composed of 273 places in 352 ms of which 5 ms to minimize.
[2024-06-01 16:53:38] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 4 ms to minimize.
SMT process timed out in 22953ms, After SMT, problems are : Problem set: 0 solved, 1147 unsolved
Search for dead transitions found 0 dead transitions in 22964ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 23054 ms. Remains : 837/904 places, 1153/1220 transitions.
[2024-06-01 16:53:38] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:53:38] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:53:38] [INFO ] Input system was already deterministic with 1153 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 904 transition count 1156
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 840 transition count 1155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 839 transition count 1155
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 839 transition count 1091
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 775 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1090
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1090
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1088
Applied a total of 264 rules in 102 ms. Remains 772 /904 variables (removed 132) and now considering 1088/1220 (removed 132) transitions.
Running 1082 sub problems to find dead transitions.
[2024-06-01 16:53:38] [INFO ] Flow matrix only has 1084 transitions (discarded 4 similar events)
// Phase 1: matrix 1084 rows 772 cols
[2024-06-01 16:53:38] [INFO ] Computed 137 invariants in 25 ms
[2024-06-01 16:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 205 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:53:50] [INFO ] Deduced a trap composed of 199 places in 259 ms of which 4 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 204 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 210 places in 251 ms of which 4 ms to minimize.
[2024-06-01 16:53:51] [INFO ] Deduced a trap composed of 210 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 199 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 6 ms to minimize.
[2024-06-01 16:53:52] [INFO ] Deduced a trap composed of 242 places in 307 ms of which 6 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 241 places in 218 ms of which 4 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 229 places in 224 ms of which 4 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 220 places in 270 ms of which 4 ms to minimize.
[2024-06-01 16:53:53] [INFO ] Deduced a trap composed of 242 places in 225 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 238 places in 273 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 261 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 212 places in 258 ms of which 4 ms to minimize.
[2024-06-01 16:53:55] [INFO ] Deduced a trap composed of 245 places in 257 ms of which 4 ms to minimize.
[2024-06-01 16:53:56] [INFO ] Deduced a trap composed of 198 places in 242 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 265 places in 328 ms of which 5 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 198 places in 287 ms of which 4 ms to minimize.
[2024-06-01 16:53:57] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
[2024-06-01 16:53:59] [INFO ] Deduced a trap composed of 198 places in 336 ms of which 5 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 210 places in 355 ms of which 5 ms to minimize.
[2024-06-01 16:54:00] [INFO ] Deduced a trap composed of 208 places in 330 ms of which 5 ms to minimize.
[2024-06-01 16:54:01] [INFO ] Deduced a trap composed of 208 places in 352 ms of which 5 ms to minimize.
SMT process timed out in 22529ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 22539ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 22645 ms. Remains : 772/904 places, 1088/1220 transitions.
[2024-06-01 16:54:01] [INFO ] Flatten gal took : 31 ms
[2024-06-01 16:54:01] [INFO ] Flatten gal took : 32 ms
[2024-06-01 16:54:01] [INFO ] Input system was already deterministic with 1088 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 35 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:54:01] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
// Phase 1: matrix 1215 rows 903 cols
[2024-06-01 16:54:01] [INFO ] Computed 137 invariants in 38 ms
[2024-06-01 16:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 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 1.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 1.0)
(s85 0.0)
(s86 1.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 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 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)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.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 0.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 1.0)
(s209 4.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 4.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 10.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 9.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 1.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 1.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:54:27] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 3 ms to minimize.
[2024-06-01 16:54:27] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
[2024-06-01 16:54:27] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 3 ms to minimize.
[2024-06-01 16:54:29] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 2 ms to minimize.
[2024-06-01 16:54:29] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:54:31] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:54:33] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 2 ms to minimize.
[2024-06-01 16:54:33] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 2 ms to minimize.
[2024-06-01 16:54:36] [INFO ] Deduced a trap composed of 137 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:54:36] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:54:38] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-06-01 16:54:42] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 5 ms to minimize.
[2024-06-01 16:54:42] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 144 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 13/13 constraints]
After SMT, in 42570ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42580ms
Finished structural reductions in LTL mode , in 1 iterations and 42618 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:54:43] [INFO ] Flatten gal took : 65 ms
[2024-06-01 16:54:43] [INFO ] Flatten gal took : 56 ms
[2024-06-01 16:54:44] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 43 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:54:44] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-06-01 16:54:44] [INFO ] Invariant cache hit.
[2024-06-01 16:54:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 3 ms to minimize.
[2024-06-01 16:55:19] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:55:24] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 2 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:55:25] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 1 ms to minimize.
[2024-06-01 16:55:26] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 42230ms, After SMT, problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42242ms
Finished structural reductions in LTL mode , in 1 iterations and 42289 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:55:26] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:55:26] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:55:26] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 33 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:55:26] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-06-01 16:55:26] [INFO ] Invariant cache hit.
[2024-06-01 16:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:56:01] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:56:02] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:56:05] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 2 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 2 ms to minimize.
[2024-06-01 16:56:06] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:56:07] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42172ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42183ms
Finished structural reductions in LTL mode , in 1 iterations and 42219 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:56:08] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:56:08] [INFO ] Flatten gal took : 41 ms
[2024-06-01 16:56:08] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 33 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:56:08] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-06-01 16:56:08] [INFO ] Invariant cache hit.
[2024-06-01 16:56:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 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 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:56:44] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 2 ms to minimize.
[2024-06-01 16:56:44] [INFO ] Deduced a trap composed of 140 places in 189 ms of which 4 ms to minimize.
[2024-06-01 16:56:44] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 2 ms to minimize.
[2024-06-01 16:56:47] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 3 ms to minimize.
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:56:48] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-06-01 16:56:49] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2118 variables, and 142 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 11/11 constraints]
After SMT, in 42007ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42018ms
Finished structural reductions in LTL mode , in 1 iterations and 42066 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:56:51] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:56:51] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:56:51] [INFO ] Input system was already deterministic with 1219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1220/1220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1219
Applied a total of 2 rules in 33 ms. Remains 903 /904 variables (removed 1) and now considering 1219/1220 (removed 1) transitions.
Running 1213 sub problems to find dead transitions.
[2024-06-01 16:56:51] [INFO ] Flow matrix only has 1215 transitions (discarded 4 similar events)
[2024-06-01 16:56:51] [INFO ] Invariant cache hit.
[2024-06-01 16:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2118 variables, and 131 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1213 unsolved
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:57:28] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:57:32] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:57:32] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:57:32] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:57:32] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 2 ms to minimize.
[2024-06-01 16:57:33] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 3 ms to minimize.
[2024-06-01 16:57:33] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:57:33] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 2 ms to minimize.
SMT process timed out in 42464ms, After SMT, problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 42474ms
Finished structural reductions in LTL mode , in 1 iterations and 42509 ms. Remains : 903/904 places, 1219/1220 transitions.
[2024-06-01 16:57:33] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:57:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:57:33] [INFO ] Input system was already deterministic with 1219 transitions.
[2024-06-01 16:57:33] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:57:34] [INFO ] Flatten gal took : 53 ms
[2024-06-01 16:57:34] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 29 ms.
[2024-06-01 16:57:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 904 places, 1220 transitions and 5774 arcs took 15 ms.
Total runtime 642552 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-06
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLFireability-2024-14

BK_STOP 1717261054704

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J60, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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