Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267800052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267800052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 150K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 653K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 468K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 215K Mar 25 11:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 832K Mar 25 11:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M May 5 16:51 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 PhilosophersDyn-PT-10-00
FORMULA_NAME PhilosophersDyn-PT-10-01
FORMULA_NAME PhilosophersDyn-PT-10-02
FORMULA_NAME PhilosophersDyn-PT-10-03
FORMULA_NAME PhilosophersDyn-PT-10-04
FORMULA_NAME PhilosophersDyn-PT-10-05
FORMULA_NAME PhilosophersDyn-PT-10-06
FORMULA_NAME PhilosophersDyn-PT-10-07
FORMULA_NAME PhilosophersDyn-PT-10-08
FORMULA_NAME PhilosophersDyn-PT-10-09
FORMULA_NAME PhilosophersDyn-PT-10-10
FORMULA_NAME PhilosophersDyn-PT-10-11
FORMULA_NAME PhilosophersDyn-PT-10-12
FORMULA_NAME PhilosophersDyn-PT-10-13
FORMULA_NAME PhilosophersDyn-PT-10-14
FORMULA_NAME PhilosophersDyn-PT-10-15

=== Now, execution of the tool begins

BK_START 1621179353728

Running Version 0
[2021-05-16 15:35:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 15:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 15:35:58] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2021-05-16 15:35:58] [INFO ] Transformed 170 places.
[2021-05-16 15:35:58] [INFO ] Transformed 2310 transitions.
[2021-05-16 15:35:58] [INFO ] Parsed PT model containing 170 places and 2310 transitions in 368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 15:35:58] [INFO ] Initial state test concluded for 5 properties.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 158 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 63 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2021-05-16 15:35:58] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2021-05-16 15:35:58] [INFO ] Computed 39 place invariants in 113 ms
[2021-05-16 15:36:00] [INFO ] Dead Transitions using invariants and state equation in 1370 ms returned [7, 9, 16, 24, 27, 29, 40, 41, 54, 59, 68, 69, 72, 85, 101, 115, 116, 123, 124, 137, 140, 155, 157, 167, 169, 171, 190, 199, 210, 211, 217, 226, 228, 248, 259, 261, 269, 270, 271, 272, 284, 285, 293, 297, 303, 326, 336, 338, 348, 351, 360, 363, 370, 375, 378, 381, 391, 397, 408, 412, 419, 422, 437, 454, 460, 465, 472, 477, 478, 482, 488, 503, 504, 505, 506, 513, 516, 519, 521, 530, 542, 545, 546, 551, 555, 556, 558, 560, 564, 573, 575, 576, 577, 579, 590, 593, 599, 605, 621, 625, 632, 636, 641, 643, 649, 656, 659, 661, 664, 665, 669, 678, 683, 686, 696, 706, 715, 724, 737, 745, 750, 751, 753, 754, 755, 763, 775, 782, 790, 793, 800, 803, 806, 810, 838, 850, 852, 857, 859, 863, 871, 873, 878, 881, 887, 888, 889, 894, 897, 913, 922, 929, 938, 940, 941, 951, 952, 955, 957, 965, 970, 972, 978, 979, 985, 1015, 1016, 1027, 1030, 1035, 1038, 1059, 1061, 1065, 1068, 1075, 1079, 1080, 1088, 1089, 1091, 1100, 1105, 1110, 1118, 1134, 1136, 1139, 1140, 1144, 1145, 1154, 1158, 1161, 1167, 1190, 1195, 1201, 1202, 1203, 1205, 1212, 1213, 1228, 1236, 1244, 1252, 1272, 1299, 1307, 1308, 1309, 1318, 1319, 1322, 1332, 1335, 1337, 1338, 1345, 1349, 1354, 1355, 1360, 1364, 1365, 1373, 1384, 1386, 1406, 1408, 1414, 1428, 1433, 1436, 1443, 1444, 1452, 1453, 1464, 1481, 1487, 1499, 1505, 1522, 1527, 1529, 1535, 1540, 1545, 1547, 1555, 1558, 1560, 1561, 1563, 1564, 1567, 1570, 1572, 1573, 1575, 1579, 1580, 1585, 1589, 1592, 1593, 1599, 1603, 1612, 1613, 1622, 1628, 1629, 1635, 1641, 1659, 1662, 1664, 1671, 1680, 1684, 1704, 1708, 1718, 1732, 1733, 1737, 1738, 1739, 1748, 1753, 1754, 1761, 1763, 1764, 1772, 1775, 1782, 1784, 1787, 1791, 1806, 1816, 1818, 1822, 1827, 1830, 1841, 1851, 1859, 1872, 1877, 1899, 1901, 1908, 1909, 1916, 1920, 1925, 1926, 1934, 1942, 1947, 1971, 1978, 1984, 1988, 1999, 2001, 2004, 2008, 2010, 2011, 2025, 2032, 2034, 2038, 2039, 2046, 2059, 2061, 2065, 2069, 2071, 2079, 2080, 2096, 2101, 2105, 2108, 2111, 2117, 2118, 2126, 2134, 2139, 2140, 2155, 2157, 2163, 2171, 2175, 2179, 2180, 2186, 2194, 2197, 2200, 2202, 2209, 2220, 2222, 2225, 2228, 2229, 2233, 2242, 2259]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2259, 2242, 2233, 2229, 2228, 2225, 2222, 2220, 2209, 2202, 2200, 2197, 2194, 2186, 2180, 2179, 2175, 2171, 2163, 2157, 2155, 2140, 2139, 2134, 2126, 2118, 2117, 2111, 2108, 2105, 2101, 2096, 2080, 2079, 2071, 2069, 2065, 2061, 2059, 2046, 2039, 2038, 2034, 2032, 2025, 2011, 2010, 2008, 2004, 2001, 1999, 1988, 1984, 1978, 1971, 1947, 1942, 1934, 1926, 1925, 1920, 1916, 1909, 1908, 1901, 1899, 1877, 1872, 1859, 1851, 1841, 1830, 1827, 1822, 1818, 1816, 1806, 1791, 1787, 1784, 1782, 1775, 1772, 1764, 1763, 1761, 1754, 1753, 1748, 1739, 1738, 1737, 1733, 1732, 1718, 1708, 1704, 1684, 1680, 1671, 1664, 1662, 1659, 1641, 1635, 1629, 1628, 1622, 1613, 1612, 1603, 1599, 1593, 1592, 1589, 1585, 1580, 1579, 1575, 1573, 1572, 1570, 1567, 1564, 1563, 1561, 1560, 1558, 1555, 1547, 1545, 1540, 1535, 1529, 1527, 1522, 1505, 1499, 1487, 1481, 1464, 1453, 1452, 1444, 1443, 1436, 1433, 1428, 1414, 1408, 1406, 1386, 1384, 1373, 1365, 1364, 1360, 1355, 1354, 1349, 1345, 1338, 1337, 1335, 1332, 1322, 1319, 1318, 1309, 1308, 1307, 1299, 1272, 1252, 1244, 1236, 1228, 1213, 1212, 1205, 1203, 1202, 1201, 1195, 1190, 1167, 1161, 1158, 1154, 1145, 1144, 1140, 1139, 1136, 1134, 1118, 1110, 1105, 1100, 1091, 1089, 1088, 1080, 1079, 1075, 1068, 1065, 1061, 1059, 1038, 1035, 1030, 1027, 1016, 1015, 985, 979, 978, 972, 970, 965, 957, 955, 952, 951, 941, 940, 938, 929, 922, 913, 897, 894, 889, 888, 887, 881, 878, 873, 871, 863, 859, 857, 852, 850, 838, 810, 806, 803, 800, 793, 790, 782, 775, 763, 755, 754, 753, 751, 750, 745, 737, 724, 715, 706, 696, 686, 683, 678, 669, 665, 664, 661, 659, 656, 649, 643, 641, 636, 632, 625, 621, 605, 599, 593, 590, 579, 577, 576, 575, 573, 564, 560, 558, 556, 555, 551, 546, 545, 542, 530, 521, 519, 516, 513, 506, 505, 504, 503, 488, 482, 478, 477, 472, 465, 460, 454, 437, 422, 419, 412, 408, 397, 391, 381, 378, 375, 370, 363, 360, 351, 348, 338, 336, 326, 303, 297, 293, 285, 284, 272, 271, 270, 269, 261, 259, 248, 228, 226, 217, 211, 210, 199, 190, 171, 169, 167, 157, 155, 140, 137, 124, 123, 116, 115, 101, 85, 72, 69, 68, 59, 54, 41, 40, 29, 27, 24, 16, 9, 7]
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:00] [INFO ] Computed 39 place invariants in 63 ms
[2021-05-16 15:36:00] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:00] [INFO ] Computed 39 place invariants in 81 ms
[2021-05-16 15:36:00] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:36:01] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:01] [INFO ] Computed 39 place invariants in 41 ms
[2021-05-16 15:36:02] [INFO ] Dead Transitions using invariants and state equation in 1090 ms returned []
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:02] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:36:03] [INFO ] Dead Transitions using invariants and state equation in 1124 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
[2021-05-16 15:36:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 15:36:04] [INFO ] Flatten gal took : 418 ms
FORMULA PhilosophersDyn-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 15:36:04] [INFO ] Flatten gal took : 259 ms
[2021-05-16 15:36:05] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 100000 steps, including 11931 resets, run finished after 1671 ms. (steps per millisecond=59 ) properties (out of 22) seen :17
Running SMT prover for 5 properties.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:07] [INFO ] Computed 39 place invariants in 48 ms
[2021-05-16 15:36:07] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-16 15:36:07] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:07] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2021-05-16 15:36:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:36:08] [INFO ] [Real]Added 1010 Read/Feed constraints in 406 ms returned sat
[2021-05-16 15:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2021-05-16 15:36:08] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 5 ms returned sat
[2021-05-16 15:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:08] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2021-05-16 15:36:09] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1240 ms returned sat
[2021-05-16 15:36:10] [INFO ] Deduced a trap composed of 72 places in 713 ms of which 2 ms to minimize.
[2021-05-16 15:36:11] [INFO ] Deduced a trap composed of 80 places in 738 ms of which 1 ms to minimize.
[2021-05-16 15:36:12] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 1 ms to minimize.
[2021-05-16 15:36:12] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 1 ms to minimize.
[2021-05-16 15:36:12] [INFO ] Deduced a trap composed of 73 places in 516 ms of which 0 ms to minimize.
[2021-05-16 15:36:13] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 0 ms to minimize.
[2021-05-16 15:36:14] [INFO ] Deduced a trap composed of 76 places in 579 ms of which 0 ms to minimize.
[2021-05-16 15:36:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4870 ms
[2021-05-16 15:36:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 479 ms.
[2021-05-16 15:36:15] [INFO ] Added : 0 causal constraints over 0 iterations in 666 ms. Result :sat
[2021-05-16 15:36:15] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:15] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 31 ms returned sat
[2021-05-16 15:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:16] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-16 15:36:16] [INFO ] [Real]Added 1010 Read/Feed constraints in 252 ms returned sat
[2021-05-16 15:36:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2021-05-16 15:36:16] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-16 15:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:16] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2021-05-16 15:36:17] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1083 ms returned sat
[2021-05-16 15:36:18] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 2 ms to minimize.
[2021-05-16 15:36:18] [INFO ] Deduced a trap composed of 81 places in 348 ms of which 26 ms to minimize.
[2021-05-16 15:36:19] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 0 ms to minimize.
[2021-05-16 15:36:19] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 0 ms to minimize.
[2021-05-16 15:36:20] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 0 ms to minimize.
[2021-05-16 15:36:22] [INFO ] Deduced a trap composed of 58 places in 1886 ms of which 0 ms to minimize.
[2021-05-16 15:36:22] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 1 ms to minimize.
[2021-05-16 15:36:25] [INFO ] Deduced a trap composed of 60 places in 2699 ms of which 1 ms to minimize.
[2021-05-16 15:36:28] [INFO ] Deduced a trap composed of 76 places in 3060 ms of which 0 ms to minimize.
[2021-05-16 15:36:29] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 1 ms to minimize.
[2021-05-16 15:36:29] [INFO ] Deduced a trap composed of 46 places in 356 ms of which 1 ms to minimize.
[2021-05-16 15:36:29] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 0 ms to minimize.
[2021-05-16 15:36:30] [INFO ] Deduced a trap composed of 69 places in 260 ms of which 0 ms to minimize.
[2021-05-16 15:36:30] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 0 ms to minimize.
[2021-05-16 15:36:31] [INFO ] Deduced a trap composed of 87 places in 400 ms of which 1 ms to minimize.
[2021-05-16 15:36:31] [INFO ] Deduced a trap composed of 68 places in 398 ms of which 21 ms to minimize.
[2021-05-16 15:36:32] [INFO ] Deduced a trap composed of 46 places in 1091 ms of which 0 ms to minimize.
[2021-05-16 15:36:33] [INFO ] Deduced a trap composed of 51 places in 364 ms of which 0 ms to minimize.
[2021-05-16 15:36:33] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 1 ms to minimize.
[2021-05-16 15:36:34] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 0 ms to minimize.
[2021-05-16 15:36:34] [INFO ] Deduced a trap composed of 56 places in 362 ms of which 1 ms to minimize.
[2021-05-16 15:36:35] [INFO ] Deduced a trap composed of 71 places in 447 ms of which 1 ms to minimize.
[2021-05-16 15:36:35] [INFO ] Deduced a trap composed of 48 places in 351 ms of which 1 ms to minimize.
[2021-05-16 15:36:39] [INFO ] Deduced a trap composed of 48 places in 3882 ms of which 13 ms to minimize.
[2021-05-16 15:36:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-16 15:36:40] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-16 15:36:40] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned unsat
[2021-05-16 15:36:40] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-16 15:36:40] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 30 ms returned sat
[2021-05-16 15:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:40] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2021-05-16 15:36:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 15:36:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-16 15:36:40] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2021-05-16 15:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 15:36:41] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-16 15:36:42] [INFO ] [Nat]Added 1010 Read/Feed constraints in 982 ms returned sat
[2021-05-16 15:36:42] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 1 ms to minimize.
[2021-05-16 15:36:42] [INFO ] Deduced a trap composed of 76 places in 243 ms of which 0 ms to minimize.
[2021-05-16 15:36:43] [INFO ] Deduced a trap composed of 60 places in 582 ms of which 1 ms to minimize.
[2021-05-16 15:36:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1588 ms
[2021-05-16 15:36:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 154 ms.
[2021-05-16 15:36:43] [INFO ] Added : 0 causal constraints over 0 iterations in 337 ms. Result :sat
[2021-05-16 15:36:44] [INFO ] [Real]Absence check using 12 positive place invariants in 78 ms returned sat
[2021-05-16 15:36:44] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 159 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2021-05-16 15:36:44] [INFO ] Initial state test concluded for 1 properties.
FORMULA PhilosophersDyn-PT-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 100 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 69 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:44] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:36:44] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:45] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:36:45] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:45] [INFO ] Computed 39 place invariants in 44 ms
[2021-05-16 15:36:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:36:48] [INFO ] Implicit Places using invariants and state equation in 3401 ms returned []
Implicit Place search using SMT with State Equation took 3666 ms to find 0 implicit places.
[2021-05-16 15:36:48] [INFO ] Redundant transitions in 145 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:48] [INFO ] Computed 39 place invariants in 34 ms
[2021-05-16 15:36:49] [INFO ] Dead Transitions using invariants and state equation in 913 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 2 (ADD s1 s5 s6 s7 s8 s9 s10 s14 s15 s17 s18 s20 s23 s25 s27 s28 s29 s32 s33 s34 s36 s37 s40 s44 s45 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s60 s61 s62 s64 s67 s69 s70 s73 s74 s76 s78 s79 s80 s82 s84 s85 s88 s89 s90 s91 s92 s93 s95 s100 s101 s103 s104 s105 s110 s111 s113 s114 s117 s118 s119 s121 s122 s123 s126 s128 s129 s130 s131 s132 s133 s134 s135 s137 s139 s142 s143 s147 s148 s149 s150 s151 s154 s156 s158 s162 s163 s164 s167 s168 s169))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-01 finished in 5778 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 40 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:50] [INFO ] Computed 39 place invariants in 52 ms
[2021-05-16 15:36:50] [INFO ] Dead Transitions using invariants and state equation in 641 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:50] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:36:51] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:51] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:36:51] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:36:57] [INFO ] Implicit Places using invariants and state equation in 5882 ms returned []
Implicit Place search using SMT with State Equation took 6297 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:36:57] [INFO ] Computed 39 place invariants in 22 ms
[2021-05-16 15:36:57] [INFO ] Dead Transitions using invariants and state equation in 761 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT 1 (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146)), p0:(GT 3 (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13281 reset in 1323 ms.
Product exploration explored 100000 steps with 13298 reset in 1396 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13319 reset in 1016 ms.
Product exploration explored 100000 steps with 13275 reset in 1002 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 20 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 121 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:04] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:37:05] [INFO ] Dead Transitions using invariants and state equation in 786 ms returned []
[2021-05-16 15:37:05] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:05] [INFO ] Computed 39 place invariants in 30 ms
[2021-05-16 15:37:05] [INFO ] Dead Transitions using invariants and state equation in 588 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Product exploration explored 100000 steps with 13235 reset in 1779 ms.
Product exploration explored 100000 steps with 13304 reset in 1409 ms.
[2021-05-16 15:37:09] [INFO ] Flatten gal took : 120 ms
[2021-05-16 15:37:09] [INFO ] Flatten gal took : 109 ms
[2021-05-16 15:37:09] [INFO ] Time to serialize gal into /tmp/LTL8859555398398926606.gal : 48 ms
[2021-05-16 15:37:09] [INFO ] Time to serialize properties into /tmp/LTL17160266419081430299.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8859555398398926606.gal, -t, CGAL, -LTL, /tmp/LTL17160266419081430299.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8859555398398926606.gal -t CGAL -LTL /tmp/LTL17160266419081430299.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((HasLeft_6+HasLeft_1)+HasLeft_8)+HasLeft_9)+HasLeft_3)+HasLeft_10)+HasLeft_2)+HasLeft_5)+HasLeft_4)+HasLeft_7)<3)"))||(X(F("((((((((((Forks_10+Forks_8)+Forks_1)+Forks_7)+Forks_6)+Forks_5)+Forks_4)+Forks_3)+Forks_9)+Forks_2)<1)")))))
Formula 0 simplified : !(G"((((((((((HasLeft_6+HasLeft_1)+HasLeft_8)+HasLeft_9)+HasLeft_3)+HasLeft_10)+HasLeft_2)+HasLeft_5)+HasLeft_4)+HasLeft_7)<3)" | XF"((((((((((Forks_10+Forks_8)+Forks_1)+Forks_7)+Forks_6)+Forks_5)+Forks_4)+Forks_3)+Forks_9)+Forks_2)<1)")
Detected timeout of ITS tools.
[2021-05-16 15:37:24] [INFO ] Flatten gal took : 83 ms
[2021-05-16 15:37:24] [INFO ] Applying decomposition
[2021-05-16 15:37:25] [INFO ] Flatten gal took : 147 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10332964350228724014.txt, -o, /tmp/graph10332964350228724014.bin, -w, /tmp/graph10332964350228724014.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10332964350228724014.bin, -l, -1, -v, -w, /tmp/graph10332964350228724014.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:37:25] [INFO ] Decomposing Gal with order
[2021-05-16 15:37:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:37:26] [INFO ] Removed a total of 4651 redundant transitions.
[2021-05-16 15:37:26] [INFO ] Flatten gal took : 1080 ms
[2021-05-16 15:37:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 68 ms.
[2021-05-16 15:37:27] [INFO ] Time to serialize gal into /tmp/LTL14908904045131006093.gal : 21 ms
[2021-05-16 15:37:27] [INFO ] Time to serialize properties into /tmp/LTL15777155587339247705.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14908904045131006093.gal, -t, CGAL, -LTL, /tmp/LTL15777155587339247705.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14908904045131006093.gal -t CGAL -LTL /tmp/LTL15777155587339247705.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((gu6.HasLeft_6+gu6.HasLeft_1)+gu6.HasLeft_8)+gu6.HasLeft_9)+gu6.HasLeft_3)+gu6.HasLeft_10)+gu6.HasLeft_2)+gu6.HasLeft_5)+gu6.HasLeft_4)+gu6.HasLeft_7)<3)"))||(X(F("((((((((((gu1.Forks_10+gu1.Forks_8)+gu1.Forks_1)+gu1.Forks_7)+gu1.Forks_6)+gu1.Forks_5)+gu1.Forks_4)+gu1.Forks_3)+gu1.Forks_9)+gu1.Forks_2)<1)")))))
Formula 0 simplified : !(G"((((((((((gu6.HasLeft_6+gu6.HasLeft_1)+gu6.HasLeft_8)+gu6.HasLeft_9)+gu6.HasLeft_3)+gu6.HasLeft_10)+gu6.HasLeft_2)+gu6.HasLeft_5)+gu6.HasLeft_4)+gu6.HasLeft_7)<3)" | XF"((((((((((gu1.Forks_10+gu1.Forks_8)+gu1.Forks_1)+gu1.Forks_7)+gu1.Forks_6)+gu1.Forks_5)+gu1.Forks_4)+gu1.Forks_3)+gu1.Forks_9)+gu1.Forks_2)<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8812273582288724545
[2021-05-16 15:37:42] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8812273582288724545
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8812273582288724545]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8812273582288724545] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8812273582288724545] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PhilosophersDyn-PT-10-02 finished in 53224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 22 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:43] [INFO ] Computed 39 place invariants in 108 ms
[2021-05-16 15:37:45] [INFO ] Dead Transitions using invariants and state equation in 2151 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:45] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:37:45] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:45] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:37:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:37:52] [INFO ] Implicit Places using invariants and state equation in 6455 ms returned []
Implicit Place search using SMT with State Equation took 6878 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:52] [INFO ] Computed 39 place invariants in 38 ms
[2021-05-16 15:37:53] [INFO ] Dead Transitions using invariants and state equation in 1104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-06 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146)), p1:(GT 1 (ADD s4 s11 s21 s22 s41 s46 s58 s72 s86 s136))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12577 reset in 1050 ms.
Stack based approach found an accepted trace after 6041 steps with 761 reset with depth 6 and stack size 6 in 62 ms.
FORMULA PhilosophersDyn-PT-10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-06 finished in 11524 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&((G(p1)||F(p2)) U X(p0))))))], workingDir=/home/mcc/execution]
Support contains 50 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:54] [INFO ] Computed 39 place invariants in 38 ms
[2021-05-16 15:37:56] [INFO ] Dead Transitions using invariants and state equation in 1610 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:56] [INFO ] Computed 39 place invariants in 78 ms
[2021-05-16 15:37:56] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:37:56] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:37:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:03] [INFO ] Implicit Places using invariants and state equation in 6693 ms returned []
Implicit Place search using SMT with State Equation took 7013 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:03] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:38:06] [INFO ] Dead Transitions using invariants and state equation in 3028 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 451 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 3 (ADD s4 s11 s21 s22 s41 s46 s58 s72 s86 s136)), p1:(LEQ 2 (ADD s26 s39 s42 s68 s75 s96 s98 s120 s157 s165)), p2:(OR (LEQ (ADD s2 s38 s59 s77 s94 s102 s112 s116 s145 s166) (ADD s0 s19 s43 s63 s83 s107 s115 s152 s153 s155)) (LEQ (ADD s3 s13 s31 s35 s47 s97 s108 s127 s140 s146) (ADD s4 s11 s21 s22 s41 s46 s58 s72 s86 s136)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-07 finished in 12157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 130 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:07] [INFO ] Computed 39 place invariants in 51 ms
[2021-05-16 15:38:08] [INFO ] Dead Transitions using invariants and state equation in 1034 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:08] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 15:38:08] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:08] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:38:08] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:14] [INFO ] Implicit Places using invariants and state equation in 6144 ms returned []
Implicit Place search using SMT with State Equation took 6538 ms to find 0 implicit places.
[2021-05-16 15:38:14] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:14] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:38:15] [INFO ] Dead Transitions using invariants and state equation in 1002 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s99), p1:(OR (LEQ 1 s99) (LEQ 3 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-08 finished in 9000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:16] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:38:17] [INFO ] Dead Transitions using invariants and state equation in 1044 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:17] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:38:21] [INFO ] Implicit Places using invariants in 4827 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:22] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:38:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:30] [INFO ] Implicit Places using invariants and state equation in 8978 ms returned []
Implicit Place search using SMT with State Equation took 13843 ms to find 0 implicit places.
[2021-05-16 15:38:31] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:31] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:38:35] [INFO ] Dead Transitions using invariants and state equation in 4351 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s86)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-10 finished in 19484 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 166 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:35] [INFO ] Computed 39 place invariants in 33 ms
[2021-05-16 15:38:36] [INFO ] Dead Transitions using invariants and state equation in 666 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:36] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:38:36] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:36] [INFO ] Computed 39 place invariants in 22 ms
[2021-05-16 15:38:38] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:44] [INFO ] Implicit Places using invariants and state equation in 7673 ms returned []
Implicit Place search using SMT with State Equation took 8033 ms to find 0 implicit places.
[2021-05-16 15:38:44] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:44] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 15:38:45] [INFO ] Dead Transitions using invariants and state equation in 917 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s87) (GT s108 s75))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-11 finished in 9896 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 147 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:45] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 15:38:46] [INFO ] Dead Transitions using invariants and state equation in 870 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:46] [INFO ] Computed 39 place invariants in 37 ms
[2021-05-16 15:38:46] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:46] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:38:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:38:55] [INFO ] Implicit Places using invariants and state equation in 9086 ms returned []
Implicit Place search using SMT with State Equation took 9425 ms to find 0 implicit places.
[2021-05-16 15:38:55] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:55] [INFO ] Computed 39 place invariants in 37 ms
[2021-05-16 15:38:56] [INFO ] Dead Transitions using invariants and state equation in 598 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s39 s45), p0:(GT s24 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-12 finished in 11258 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F((p1&&X(X(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:56] [INFO ] Computed 39 place invariants in 38 ms
[2021-05-16 15:38:57] [INFO ] Dead Transitions using invariants and state equation in 1196 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:57] [INFO ] Computed 39 place invariants in 47 ms
[2021-05-16 15:38:58] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:38:58] [INFO ] Computed 39 place invariants in 28 ms
[2021-05-16 15:38:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:04] [INFO ] Implicit Places using invariants and state equation in 6135 ms returned []
Implicit Place search using SMT with State Equation took 6586 ms to find 0 implicit places.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:04] [INFO ] Computed 39 place invariants in 25 ms
[2021-05-16 15:39:05] [INFO ] Dead Transitions using invariants and state equation in 889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 417 ms :[false, p0, (OR (NOT p1) p0), p0, p0, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p0), acceptance={} source=7 dest: 2}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(LEQ s16 s30), p1:(LEQ s112 s65)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 4 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-13 finished in 9152 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 84 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:05] [INFO ] Computed 39 place invariants in 36 ms
[2021-05-16 15:39:06] [INFO ] Dead Transitions using invariants and state equation in 788 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:06] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 15:39:07] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:07] [INFO ] Computed 39 place invariants in 26 ms
[2021-05-16 15:39:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:13] [INFO ] Implicit Places using invariants and state equation in 6235 ms returned []
Implicit Place search using SMT with State Equation took 6640 ms to find 0 implicit places.
[2021-05-16 15:39:13] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:13] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:39:13] [INFO ] Dead Transitions using invariants and state equation in 550 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s43 s114), p1:(LEQ s107 s140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-14 finished in 8286 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 102 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:14] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 15:39:14] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:14] [INFO ] Computed 39 place invariants in 29 ms
[2021-05-16 15:39:15] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:15] [INFO ] Computed 39 place invariants in 23 ms
[2021-05-16 15:39:15] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2021-05-16 15:39:21] [INFO ] Implicit Places using invariants and state equation in 6114 ms returned []
Implicit Place search using SMT with State Equation took 6602 ms to find 0 implicit places.
[2021-05-16 15:39:21] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2021-05-16 15:39:21] [INFO ] Computed 39 place invariants in 24 ms
[2021-05-16 15:39:22] [INFO ] Dead Transitions using invariants and state equation in 634 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s99 s31) (LEQ s71 s155) (LEQ 1 s75))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-15 finished in 8092 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17916824473523662708
[2021-05-16 15:39:22] [INFO ] Too many transitions (1885) to apply POR reductions. Disabling POR matrices.
[2021-05-16 15:39:22] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17916824473523662708
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17916824473523662708]
[2021-05-16 15:39:22] [INFO ] Applying decomposition
[2021-05-16 15:39:22] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16787444480201359639.txt, -o, /tmp/graph16787444480201359639.bin, -w, /tmp/graph16787444480201359639.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16787444480201359639.bin, -l, -1, -v, -w, /tmp/graph16787444480201359639.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 15:39:22] [INFO ] Decomposing Gal with order
[2021-05-16 15:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 15:39:23] [INFO ] Removed a total of 4512 redundant transitions.
[2021-05-16 15:39:23] [INFO ] Flatten gal took : 359 ms
[2021-05-16 15:39:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 36 ms.
[2021-05-16 15:39:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality5931895928766995337.gal : 11 ms
[2021-05-16 15:39:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality11709752725426756727.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5931895928766995337.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11709752725426756727.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5931895928766995337.gal -t CGAL -LTL /tmp/LTLCardinality11709752725426756727.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((((((((((gu6.HasLeft_6+gu6.HasLeft_1)+gu6.HasLeft_8)+gu6.HasLeft_9)+gu6.HasLeft_3)+gu6.HasLeft_10)+gu6.HasLeft_2)+gu6.HasLeft_5)+gu6.HasLeft_4)+gu6.HasLeft_7)<3)"))||(X(F("((((((((((gu1.Forks_10+gu1.Forks_8)+gu1.Forks_1)+gu1.Forks_7)+gu1.Forks_6)+gu1.Forks_5)+gu1.Forks_4)+gu1.Forks_3)+gu1.Forks_9)+gu1.Forks_2)<1)")))))
Formula 0 simplified : !(G"((((((((((gu6.HasLeft_6+gu6.HasLeft_1)+gu6.HasLeft_8)+gu6.HasLeft_9)+gu6.HasLeft_3)+gu6.HasLeft_10)+gu6.HasLeft_2)+gu6.HasLeft_5)+gu6.HasLeft_4)+gu6.HasLeft_7)<3)" | XF"((((((((((gu1.Forks_10+gu1.Forks_8)+gu1.Forks_1)+gu1.Forks_7)+gu1.Forks_6)+gu1.Forks_5)+gu1.Forks_4)+gu1.Forks_3)+gu1.Forks_9)+gu1.Forks_2)<1)")
Compilation finished in 23241 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17916824473523662708]
Link finished in 144 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17916824473523662708]
LTSmin run took 12790 ms.
FORMULA PhilosophersDyn-PT-10-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621179598758

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089267800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;