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-171654446800316.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800316
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717255401182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:23:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:23:23] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2024-06-01 15:23:23] [INFO ] Transformed 454 places.
[2024-06-01 15:23:23] [INFO ] Transformed 6994 transitions.
[2024-06-01 15:23:23] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 179 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 169 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 452 transition count 1612
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 452 transition count 1612
Applied a total of 4 rules in 175 ms. Remains 452 /454 variables (removed 2) and now considering 1612/1614 (removed 2) transitions.
Running 1606 sub problems to find dead transitions.
[2024-06-01 15:23:25] [INFO ] Flow matrix only has 1588 transitions (discarded 24 similar events)
// Phase 1: matrix 1588 rows 452 cols
[2024-06-01 15:23:25] [INFO ] Computed 50 invariants in 120 ms
[2024-06-01 15:23:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 82 places in 457 ms of which 177 ms to minimize.
[2024-06-01 15:24:01] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/2040 variables, and 35 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 20129 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 4 (OVERLAPS) 5/445 variables, 5/40 constraints. Problems are: Problem set: 324 solved, 1282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/2040 variables, and 40 constraints, problems are : Problem set: 324 solved, 1282 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 2/2 constraints]
After SMT, in 59897ms problems are : Problem set: 324 solved, 1282 unsolved
Search for dead transitions found 324 dead transitions in 59976ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2024-06-01 15:24:24] [INFO ] Flow matrix only has 1264 transitions (discarded 24 similar events)
// Phase 1: matrix 1264 rows 452 cols
[2024-06-01 15:24:24] [INFO ] Computed 50 invariants in 41 ms
[2024-06-01 15:24:25] [INFO ] Implicit Places using invariants in 395 ms returned [42, 288, 351, 412]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 405 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1288/1614 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 1288/1288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60656 ms. Remains : 448/454 places, 1288/1614 transitions.
Support contains 169 out of 448 places after structural reductions.
[2024-06-01 15:24:25] [INFO ] Flatten gal took : 148 ms
[2024-06-01 15:24:25] [INFO ] Flatten gal took : 104 ms
[2024-06-01 15:24:26] [INFO ] Input system was already deterministic with 1288 transitions.
RANDOM walk for 27307 steps (154 resets) in 1936 ms. (14 steps per ms) remains 0/23 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(!p1))))'
Support contains 30 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 42 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-06-01 15:24:27] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 436 cols
[2024-06-01 15:24:27] [INFO ] Computed 40 invariants in 42 ms
[2024-06-01 15:24:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:24:41] [INFO ] Deduced a trap composed of 182 places in 246 ms of which 4 ms to minimize.
[2024-06-01 15:24:42] [INFO ] Deduced a trap composed of 74 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:24:42] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:24:44] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:24:44] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 3 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 202 places in 255 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 41 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:24:55] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:24:56] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 46986ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47003ms
[2024-06-01 15:25:14] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:25:14] [INFO ] Invariant cache hit.
[2024-06-01 15:25:14] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 15:25:14] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:25:14] [INFO ] Invariant cache hit.
[2024-06-01 15:25:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:25:24] [INFO ] Implicit Places using invariants and state equation in 10427 ms returned []
Implicit Place search using SMT with State Equation took 10909 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-06-01 15:25:24] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:25:24] [INFO ] Invariant cache hit.
[2024-06-01 15:25:24] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:25:41] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:25:42] [INFO ] Deduced a trap composed of 99 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:25:42] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2024-06-01 15:25:43] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:25:43] [INFO ] Deduced a trap composed of 202 places in 275 ms of which 3 ms to minimize.
[2024-06-01 15:25:44] [INFO ] Deduced a trap composed of 198 places in 293 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:26:01] [INFO ] Deduced a trap composed of 185 places in 237 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 40 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:26:08] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 248 places in 324 ms of which 3 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:26:12] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:26:16] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 68528ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68556ms
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126523 ms. Remains : 436/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 333 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-00
Product exploration explored 100000 steps with 40001 reset in 853 ms.
Product exploration explored 100000 steps with 40013 reset in 775 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 560 steps (7 resets) in 16 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1282/1282 transitions.
Applied a total of 0 rules in 20 ms. Remains 436 /436 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Running 1276 sub problems to find dead transitions.
[2024-06-01 15:26:36] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:26:36] [INFO ] Invariant cache hit.
[2024-06-01 15:26:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:26:52] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:26:52] [INFO ] Deduced a trap composed of 99 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:26:53] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2024-06-01 15:26:53] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 2 ms to minimize.
[2024-06-01 15:26:54] [INFO ] Deduced a trap composed of 202 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:26:54] [INFO ] Deduced a trap composed of 198 places in 259 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:27:06] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 191 places in 327 ms of which 4 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 185 places in 285 ms of which 3 ms to minimize.
[2024-06-01 15:27:07] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 4 ms to minimize.
[2024-06-01 15:27:08] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 210 places in 258 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 47543ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47571ms
[2024-06-01 15:27:24] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:27:24] [INFO ] Invariant cache hit.
[2024-06-01 15:27:24] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 15:27:24] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:27:24] [INFO ] Invariant cache hit.
[2024-06-01 15:27:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:27:35] [INFO ] Implicit Places using invariants and state equation in 10944 ms returned []
Implicit Place search using SMT with State Equation took 11358 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-06-01 15:27:35] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-06-01 15:27:35] [INFO ] Invariant cache hit.
[2024-06-01 15:27:35] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 99 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:27:53] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:27:53] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:27:54] [INFO ] Deduced a trap composed of 202 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:27:54] [INFO ] Deduced a trap composed of 198 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:28:12] [INFO ] Deduced a trap composed of 185 places in 248 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 40 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-06-01 15:28:19] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 3 ms to minimize.
[2024-06-01 15:28:24] [INFO ] Deduced a trap composed of 248 places in 391 ms of which 3 ms to minimize.
[2024-06-01 15:28:24] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:28:24] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-06-01 15:28:28] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 67786ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 67805ms
Finished structural reductions in LTL mode , in 1 iterations and 126764 ms. Remains : 436/436 places, 1282/1282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 505 steps (5 resets) in 20 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 39955 reset in 863 ms.
Product exploration explored 100000 steps with 39993 reset in 1036 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 234 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1282/1282 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 436 transition count 1282
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 26 place count 436 transition count 1330
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 56 place count 436 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 428 transition count 1322
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 428 transition count 1322
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 120 place count 428 transition count 1322
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 412 transition count 1306
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 412 transition count 1306
Deduced a syphon composed of 84 places in 2 ms
Applied a total of 152 rules in 251 ms. Remains 412 /436 variables (removed 24) and now considering 1306/1282 (removed -24) transitions.
Running 1300 sub problems to find dead transitions.
[2024-06-01 15:28:47] [INFO ] Flow matrix only has 1282 transitions (discarded 24 similar events)
// Phase 1: matrix 1282 rows 412 cols
[2024-06-01 15:28:47] [INFO ] Computed 40 invariants in 19 ms
[2024-06-01 15:28:47] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:29:11] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 2.0)
(s10 0.0)
(s11 0.0)
(s12 4.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 timeout
0.0)
(s17 0.0)
(s18 1.0)
(s19 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1694 variables, and 31 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-06-01 15:29:26] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1694 variables, and 32 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 3/3 constraints]
After SMT, in 48708ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 48727ms
[2024-06-01 15:29:35] [INFO ] Redundant transitions in 78 ms returned []
Running 1300 sub problems to find dead transitions.
[2024-06-01 15:29:35] [INFO ] Flow matrix only has 1282 transitions (discarded 24 similar events)
[2024-06-01 15:29:35] [INFO ] Invariant cache hit.
[2024-06-01 15:29:35] [INFO ] State equation strengthened by 160 read => feed constraints.
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLFireability-00
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLFireability-05
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLFireability-06
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLFireability-07
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-LTLFireability-09
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256476796

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-00
ltl formula formula --ltl=/tmp/988/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.150 real 0.410 user 0.360 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-01
ltl formula formula --ltl=/tmp/988/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.380 user 0.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7014 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 600.0 B/state, compr.: 32.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-02
ltl formula formula --ltl=/tmp/988/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.170 real 0.420 user 0.260 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7011 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~106!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 473
pnml2lts-mc( 0/ 4): unique transitions count: 1190
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 477
pnml2lts-mc( 0/ 4): - cum. max stack depth: 477
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 477 states 1218 transitions, fanout: 2.553
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4770, Transitions per second: 12180
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 53.7 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-03
ltl formula formula --ltl=/tmp/988/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.950 real 0.400 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~61!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 239
pnml2lts-mc( 0/ 4): unique transitions count: 790
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 242
pnml2lts-mc( 0/ 4): - cum. max stack depth: 242
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 242 states 812 transitions, fanout: 3.355
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4840, Transitions per second: 16240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 55.8 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-04
ltl formula formula --ltl=/tmp/988/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.030 real 0.370 user 0.280 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7066 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 6
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 28 transitions, fanout: 2.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 181.7 B/state, compr.: 10.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-05
ltl formula formula --ltl=/tmp/988/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.100 real 0.380 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6996 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~33 levels ~10000 states ~23912 transitions
pnml2lts-mc( 0/ 4): ~33 levels ~20000 states ~48472 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~40000 states ~121012 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~80000 states ~248844 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~160000 states ~509428 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~320000 states ~1043868 transitions
pnml2lts-mc( 2/ 4): ~42 levels ~640000 states ~2111644 transitions
pnml2lts-mc( 1/ 4): ~42 levels ~1280000 states ~3613256 transitions
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-06
ltl formula formula --ltl=/tmp/988/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.200 real 0.400 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7019 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~48 levels ~10000 states ~26496 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~20000 states ~57596 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~40000 states ~114684 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~80000 states ~241896 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~160000 states ~489160 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~320000 states ~996764 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~640000 states ~2045396 transitions
pnml2lts-mc( 3/ 4): ~48 levels ~1280000 states ~4170520 transitions
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-07
ltl formula formula --ltl=/tmp/988/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.080 real 0.350 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_7_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-08
ltl formula formula --ltl=/tmp/988/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.050 real 0.360 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6997 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~28!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 75
pnml2lts-mc( 0/ 4): unique transitions count: 368
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 79
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 79 states 396 transitions, fanout: 5.013
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7900, Transitions per second: 39600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 58.7 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-09
ltl formula formula --ltl=/tmp/988/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.050 real 0.410 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7000 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~284 levels ~10000 states ~24388 transitions
pnml2lts-mc( 3/ 4): ~284 levels ~20000 states ~61412 transitions
pnml2lts-mc( 3/ 4): ~936 levels ~40000 states ~126880 transitions
pnml2lts-mc( 3/ 4): ~1853 levels ~80000 states ~262672 transitions
pnml2lts-mc( 3/ 4): ~6407 levels ~160000 states ~516436 transitions
pnml2lts-mc( 0/ 4): ~8898 levels ~320000 states ~887680 transitions
pnml2lts-mc( 0/ 4): ~12048 levels ~640000 states ~1740592 transitions
pnml2lts-mc( 1/ 4): ~22287 levels ~1280000 states ~3879164 transitions
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-10
ltl formula formula --ltl=/tmp/988/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.090 real 0.420 user 0.310 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6995 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 600.0 B/state, compr.: 32.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-11
ltl formula formula --ltl=/tmp/988/ltl_11_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.020 real 0.360 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6999 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~127!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 509
pnml2lts-mc( 0/ 4): unique transitions count: 1369
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 513
pnml2lts-mc( 0/ 4): - cum. max stack depth: 513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 513 states 1397 transitions, fanout: 2.723
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5700, Transitions per second: 15522
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 54.1 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-12
ltl formula formula --ltl=/tmp/988/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.990 real 0.360 user 0.310 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6998 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~132!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 557
pnml2lts-mc( 0/ 4): unique transitions count: 1311
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 562
pnml2lts-mc( 0/ 4): - cum. max stack depth: 562
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 562 states 1345 transitions, fanout: 2.393
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5620, Transitions per second: 13450
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 53.2 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-13
ltl formula formula --ltl=/tmp/988/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.410 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~209!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 767
pnml2lts-mc( 0/ 4): unique transitions count: 1647
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 775
pnml2lts-mc( 0/ 4): - cum. max stack depth: 775
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 775 states 1694 transitions, fanout: 2.186
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.120 sec minimum, 0.123 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5962, Transitions per second: 13031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 52.7 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-14
ltl formula formula --ltl=/tmp/988/ltl_14_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.990 real 0.420 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 6998 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~127!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 328
pnml2lts-mc( 0/ 4): unique transitions count: 933
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 331
pnml2lts-mc( 0/ 4): - cum. max stack depth: 331
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 331 states 955 transitions, fanout: 2.885
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5517, Transitions per second: 15917
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 54.8 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S06J04T04-LTLFireability-15
ltl formula formula --ltl=/tmp/988/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 454 places, 6994 transitions and 59152 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBLF-PT-S06J04T04 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.010 real 0.340 user 0.330 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/988/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/988/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/988/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/988/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 480 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 455, there are 7009 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~87!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 394
pnml2lts-mc( 0/ 4): unique transitions count: 2039
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 397
pnml2lts-mc( 0/ 4): - cum. max stack depth: 397
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 397 states 2097 transitions, fanout: 5.282
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5671, Transitions per second: 29957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 36.8 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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="LTLFireability"
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 LTLFireability"
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-171654446800316"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;