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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717255242958

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:20:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:20:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:20:45] [INFO ] Load time of PNML (sax parser for PT used): 556 ms
[2024-06-01 15:20:45] [INFO ] Transformed 454 places.
[2024-06-01 15:20:45] [INFO ] Transformed 6994 transitions.
[2024-06-01 15:20:45] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 811 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 48 ms.
[2024-06-01 15:20:45] [INFO ] Reduced 4680 identical enabling conditions.
[2024-06-01 15:20:45] [INFO ] Reduced 60 identical enabling conditions.
[2024-06-01 15:20:45] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 310 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 1610
Applied a total of 8 rules in 86 ms. Remains 450 /454 variables (removed 4) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-06-01 15:20:46] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
// Phase 1: matrix 1586 rows 450 cols
[2024-06-01 15:20:46] [INFO ] Computed 50 invariants in 99 ms
[2024-06-01 15:20:46] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
SMT process timed out in 36067ms, After SMT, problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 36147ms
[2024-06-01 15:21:22] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-06-01 15:21:22] [INFO ] Invariant cache hit.
[2024-06-01 15:21:26] [INFO ] Implicit Places using invariants in 3946 ms returned []
[2024-06-01 15:21:26] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-06-01 15:21:26] [INFO ] Invariant cache hit.
[2024-06-01 15:21:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:21:31] [INFO ] Implicit Places using invariants and state equation in 5709 ms returned []
Implicit Place search using SMT with State Equation took 9665 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-06-01 15:21:31] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-06-01 15:21:31] [INFO ] Invariant cache hit.
[2024-06-01 15:21:31] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 15:21:58] [INFO ] Deduced a trap composed of 103 places in 327 ms of which 36 ms to minimize.
[2024-06-01 15:21:59] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:21:59] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 2 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 199 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:22:00] [INFO ] Deduced a trap composed of 210 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:22:01] [INFO ] Deduced a trap composed of 202 places in 334 ms of which 5 ms to minimize.
[2024-06-01 15:22:02] [INFO ] Deduced a trap composed of 187 places in 329 ms of which 3 ms to minimize.
[2024-06-01 15:22:06] [INFO ] Deduced a trap composed of 199 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 78 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:22:08] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2036 variables, and 47 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1445 is UNSAT
At refinement iteration 4 (OVERLAPS) 5/443 variables, 5/52 constraints. Problems are: Problem set: 268 solved, 1336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/2036 variables, and 52 constraints, problems are : Problem set: 268 solved, 1336 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 10/10 constraints]
After SMT, in 76050ms problems are : Problem set: 268 solved, 1336 unsolved
Search for dead transitions found 268 dead transitions in 76083ms
Found 268 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 268 transitions
Dead transitions reduction (with SMT) removed 268 transitions
Starting structural reductions in LTL mode, iteration 1 : 450/454 places, 1342/1614 transitions.
Applied a total of 0 rules in 20 ms. Remains 450 /450 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122110 ms. Remains : 450/454 places, 1342/1614 transitions.
Support contains 310 out of 450 places after structural reductions.
[2024-06-01 15:22:48] [INFO ] Flatten gal took : 203 ms
[2024-06-01 15:22:48] [INFO ] Flatten gal took : 115 ms
[2024-06-01 15:22:49] [INFO ] Input system was already deterministic with 1342 transitions.
Reduction of identical properties reduced properties to check from 97 to 95
RANDOM walk for 40001 steps (238 resets) in 4183 ms. (9 steps per ms) remains 47/95 properties
BEST_FIRST walk for 4002 steps (13 resets) in 159 ms. (25 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (17 resets) in 113 ms. (35 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (15 resets) in 73 ms. (54 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (9 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (11 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (11 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (11 resets) in 49 ms. (80 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (10 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (9 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
[2024-06-01 15:22:50] [INFO ] Flow matrix only has 1318 transitions (discarded 24 similar events)
// Phase 1: matrix 1318 rows 450 cols
[2024-06-01 15:22:50] [INFO ] Computed 50 invariants in 44 ms
[2024-06-01 15:22:50] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 89/118 variables, 7/7 constraints. Problems are: Problem set: 24 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 24 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 24/142 variables, 7/14 constraints. Problems are: Problem set: 24 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 24 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 38/180 variables, 2/16 constraints. Problems are: Problem set: 24 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/16 constraints. Problems are: Problem set: 24 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp96 is UNSAT
At refinement iteration 7 (OVERLAPS) 250/430 variables, 20/36 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 0/36 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/437 variables, 4/40 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/40 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/450 variables, 10/50 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 0/50 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1318/1768 variables, 450/500 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1768 variables, 112/612 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1768 variables, 0/612 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1768 variables, 0/612 constraints. Problems are: Problem set: 44 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1768/1768 variables, and 612 constraints, problems are : Problem set: 44 solved, 3 unsolved in 3986 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 450/450 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/92 variables, 5/5 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/116 variables, 6/11 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 47/163 variables, 4/15 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 265/428 variables, 20/35 constraints. Problems are: Problem set: 44 solved, 3 unsolved
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 4/39 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/39 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/435 variables, 4/43 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/43 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/448 variables, 10/53 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/53 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1318/1766 variables, 448/501 constraints. Problems are: Problem set: 44 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 112/613 constraints. Problems are: Problem set: 44 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1766/1768 variables, and 616 constraints, problems are : Problem set: 44 solved, 3 unsolved in 4710 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 448/450 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 9358ms problems are : Problem set: 44 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 1342/1342 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 444 transition count 1318
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 54 place count 420 transition count 1318
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 54 place count 420 transition count 1270
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 150 place count 372 transition count 1270
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 254 place count 320 transition count 1218
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 320 transition count 1208
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 274 place count 310 transition count 1208
Applied a total of 274 rules in 321 ms. Remains 310 /450 variables (removed 140) and now considering 1208/1342 (removed 134) transitions.
Running 1202 sub problems to find dead transitions.
[2024-06-01 15:23:00] [INFO ] Flow matrix only has 1184 transitions (discarded 24 similar events)
// Phase 1: matrix 1184 rows 310 cols
[2024-06-01 15:23:00] [INFO ] Computed 44 invariants in 30 ms
[2024-06-01 15:23:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:23:16] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:23:18] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 2 ms to minimize.
[2024-06-01 15:23:22] [INFO ] Deduced a trap composed of 88 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:23:22] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/1494 variables, and 42 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 15:23:33] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:23:34] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 15:23:44] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/1494 variables, and 47 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/310 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 10/10 constraints]
After SMT, in 50109ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 50126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50451 ms. Remains : 310/450 places, 1208/1342 transitions.
RANDOM walk for 40000 steps (417 resets) in 600 ms. (66 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (36 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
[2024-06-01 15:23:51] [INFO ] Flow matrix only has 1184 transitions (discarded 24 similar events)
[2024-06-01 15:23:51] [INFO ] Invariant cache hit.
[2024-06-01 15:23:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 182/289 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:23:51] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/299 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/308 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1184/1492 variables, 308/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 112/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1492 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1494 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1494 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1494 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1494 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1494/1494 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/310 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/107 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 182/289 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/299 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/308 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1184/1492 variables, 308/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 112/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1492 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1492 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1494 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1494 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1494 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1494 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1494/1494 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3317 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/310 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 5000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1208/1208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 1207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 309 transition count 1207
Applied a total of 2 rules in 75 ms. Remains 309 /310 variables (removed 1) and now considering 1207/1208 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 309/310 places, 1207/1208 transitions.
RANDOM walk for 23104 steps (249 resets) in 382 ms. (60 steps per ms) remains 0/1 properties
Successfully simplified 45 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:23:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 15:23:56] [INFO ] Flatten gal took : 108 ms
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:23:56] [INFO ] Flatten gal took : 113 ms
[2024-06-01 15:23:57] [INFO ] Input system was already deterministic with 1342 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 1342/1342 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 444 transition count 1342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 440 transition count 1338
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 440 transition count 1338
Applied a total of 14 rules in 29 ms. Remains 440 /450 variables (removed 10) and now considering 1338/1342 (removed 4) transitions.
Running 1332 sub problems to find dead transitions.
[2024-06-01 15:23:57] [INFO ] Flow matrix only has 1314 transitions (discarded 24 similar events)
// Phase 1: matrix 1314 rows 440 cols
[2024-06-01 15:23:57] [INFO ] Computed 44 invariants in 50 ms
[2024-06-01 15:23:57] [INFO ] State equation strengthened by 112 read => feed constraints.
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 : PolyORBLF-PT-S06J04T04-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-12
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLFireability-2024-15

BK_STOP 1717255446824

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/697/ctl_0_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/697/ctl_1_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/697/ctl_2_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/697/ctl_3_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/697/ctl_4_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/697/ctl_5_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/697/ctl_6_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/697/ctl_7_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/697/ctl_8_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/697/ctl_9_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/697/ctl_10_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/697/ctl_11_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/697/ctl_12_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/697/ctl_13_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/697/ctl_14_
ctl formula name PolyORBLF-PT-S06J04T04-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/697/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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-171654446800314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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