Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r131-smll-171624288600203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DLCshifumi-PT-4a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288600203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 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 DLCshifumi-PT-4a-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-4a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716407245920

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-4a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 19:47:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 19:47:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:47:30] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2024-05-22 19:47:30] [INFO ] Transformed 1178 places.
[2024-05-22 19:47:30] [INFO ] Transformed 7504 transitions.
[2024-05-22 19:47:30] [INFO ] Found NUPN structural information;
[2024-05-22 19:47:30] [INFO ] Parsed PT model containing 1178 places and 7504 transitions and 28610 arcs in 1004 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 924 transitions
Reduce redundant transitions removed 924 transitions.
FORMULA DLCshifumi-PT-4a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-4a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 6580/6580 transitions.
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 148 place count 1030 transition count 5615
Iterating global reduction 0 with 148 rules applied. Total rules applied 296 place count 1030 transition count 5615
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 368 place count 1030 transition count 5543
Drop transitions removed 1926 transitions
Redundant transition composition rules discarded 1926 transitions
Iterating global reduction 1 with 1926 rules applied. Total rules applied 2294 place count 1030 transition count 3617
Applied a total of 2294 rules in 916 ms. Remains 1030 /1178 variables (removed 148) and now considering 3617/6580 (removed 2963) transitions.
[2024-05-22 19:47:31] [INFO ] Flow matrix only has 596 transitions (discarded 3021 similar events)
// Phase 1: matrix 596 rows 1030 cols
[2024-05-22 19:47:31] [INFO ] Computed 691 invariants in 35 ms
[2024-05-22 19:47:33] [INFO ] Implicit Places using invariants in 1435 ms returned []
[2024-05-22 19:47:33] [INFO ] Flow matrix only has 596 transitions (discarded 3021 similar events)
[2024-05-22 19:47:33] [INFO ] Invariant cache hit.
[2024-05-22 19:47:34] [INFO ] State equation strengthened by 175 read => feed constraints.
[2024-05-22 19:47:47] [INFO ] Implicit Places using invariants and state equation in 14902 ms returned [418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 525, 526, 527, 528, 529, 530, 531, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 612, 613, 614, 615, 616, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 676, 677, 678, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 812, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029]
Discarding 589 places :
Ensure Unique test removed 2709 transitions
Reduce isomorphic transitions removed 2709 transitions.
Implicit Place search using SMT with State Equation took 16407 ms to find 589 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/1178 places, 908/6580 transitions.
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 137 place count 441 transition count 771
Applied a total of 137 rules in 24 ms. Remains 441 /441 variables (removed 0) and now considering 771/908 (removed 137) transitions.
[2024-05-22 19:47:47] [INFO ] Flow matrix only has 596 transitions (discarded 175 similar events)
// Phase 1: matrix 596 rows 441 cols
[2024-05-22 19:47:47] [INFO ] Computed 102 invariants in 4 ms
[2024-05-22 19:47:48] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 19:47:48] [INFO ] Flow matrix only has 596 transitions (discarded 175 similar events)
[2024-05-22 19:47:48] [INFO ] Invariant cache hit.
[2024-05-22 19:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:48] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 441/1178 places, 771/6580 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17961 ms. Remains : 441/1178 places, 771/6580 transitions.
Support contains 50 out of 441 places after structural reductions.
[2024-05-22 19:47:49] [INFO ] Flatten gal took : 156 ms
[2024-05-22 19:47:49] [INFO ] Flatten gal took : 66 ms
[2024-05-22 19:47:49] [INFO ] Input system was already deterministic with 771 transitions.
Finished random walk after 2697 steps, including 0 resets, run visited all 27 properties in 357 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 1 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 1 stable transitions
Graph (complete) has 872 edges and 441 vertex of which 418 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X(p1))))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 420 transition count 771
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 412 transition count 755
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 412 transition count 755
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 412 transition count 753
Applied a total of 39 rules in 28 ms. Remains 412 /441 variables (removed 29) and now considering 753/771 (removed 18) transitions.
[2024-05-22 19:47:50] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
// Phase 1: matrix 586 rows 412 cols
[2024-05-22 19:47:50] [INFO ] Computed 81 invariants in 3 ms
[2024-05-22 19:47:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 19:47:50] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2024-05-22 19:47:50] [INFO ] Invariant cache hit.
[2024-05-22 19:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:50] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-22 19:47:50] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2024-05-22 19:47:50] [INFO ] Invariant cache hit.
[2024-05-22 19:47:51] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/441 places, 753/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 412/441 places, 753/771 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s385 1) (EQ s410 1)), p1:(AND (EQ s242 1) (EQ s411 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-01 finished in 1555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Graph (trivial) has 763 edges and 441 vertex of which 413 / 441 are part of one of the 79 SCC in 5 ms
Free SCC test removed 334 places
Ensure Unique test removed 683 transitions
Reduce isomorphic transitions removed 683 transitions.
Graph (complete) has 189 edges and 107 vertex of which 85 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 77 place count 10 transition count 13
Iterating global reduction 0 with 75 rules applied. Total rules applied 152 place count 10 transition count 13
Applied a total of 152 rules in 19 ms. Remains 10 /441 variables (removed 431) and now considering 13/771 (removed 758) transitions.
[2024-05-22 19:47:51] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
// Phase 1: matrix 9 rows 10 cols
[2024-05-22 19:47:51] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 19:47:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 19:47:51] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 19:47:51] [INFO ] Invariant cache hit.
[2024-05-22 19:47:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:51] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-22 19:47:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:47:51] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 19:47:51] [INFO ] Invariant cache hit.
[2024-05-22 19:47:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/441 places, 13/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 10/441 places, 13/771 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-02 automaton TGBA Formula[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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s9 0)), p1:(EQ s6 1), p2:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-02 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(!p1))&&p0)||G(!p1))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 420 transition count 771
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 412 transition count 755
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 412 transition count 755
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 412 transition count 752
Applied a total of 40 rules in 50 ms. Remains 412 /441 variables (removed 29) and now considering 752/771 (removed 19) transitions.
[2024-05-22 19:47:52] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
// Phase 1: matrix 585 rows 412 cols
[2024-05-22 19:47:52] [INFO ] Computed 81 invariants in 5 ms
[2024-05-22 19:47:52] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 19:47:52] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2024-05-22 19:47:52] [INFO ] Invariant cache hit.
[2024-05-22 19:47:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:52] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-22 19:47:52] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2024-05-22 19:47:52] [INFO ] Invariant cache hit.
[2024-05-22 19:47:53] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/441 places, 752/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1211 ms. Remains : 412/441 places, 752/771 transitions.
Stuttering acceptance computed with spot in 217 ms :[p1, p1, p1, p1]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p0:(AND (EQ s378 1) (EQ s410 1)), p1:(AND (EQ s385 1) (EQ s411 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 6 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-04 finished in 1454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&F(p2))||(X(!p3) U ((!p0&&X(!p3))||X(G(!p3))))))'
Support contains 8 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 422 transition count 771
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 28 place count 413 transition count 753
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 413 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 413 transition count 750
Applied a total of 40 rules in 28 ms. Remains 413 /441 variables (removed 28) and now considering 750/771 (removed 21) transitions.
[2024-05-22 19:47:53] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
// Phase 1: matrix 584 rows 413 cols
[2024-05-22 19:47:53] [INFO ] Computed 83 invariants in 4 ms
[2024-05-22 19:47:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 19:47:53] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:47:53] [INFO ] Invariant cache hit.
[2024-05-22 19:47:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:54] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-22 19:47:54] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:47:54] [INFO ] Invariant cache hit.
[2024-05-22 19:47:54] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 413/441 places, 750/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1112 ms. Remains : 413/441 places, 750/771 transitions.
Stuttering acceptance computed with spot in 631 ms :[true, (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p1) p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), (AND p3 (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), p3, (OR (NOT p1) (NOT p2)), (AND p3 (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p3), acceptance={} source=1 dest: 11}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 0}, { cond=(AND p1 p3), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=4 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 p3), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=5 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 12}], [{ cond=p3, acceptance={} source=8 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 10}, { cond=(AND p0 p3), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 0}, { cond=p1, acceptance={} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={} source=12 dest: 0}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=2, aps=[p1:(AND (EQ s268 1) (EQ s409 1)), p3:(AND (EQ s404 1) (EQ s411 1)), p2:(AND (EQ s407 1) (EQ s412 1)), p0:(AND (EQ s399 1) (EQ s410 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1572 ms.
Product exploration explored 100000 steps with 50000 reset in 1367 ms.
Computed a total of 5 stabilizing places and 1 stable transitions
Graph (complete) has 832 edges and 413 vertex of which 409 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (AND (NOT p0) (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p1 (NOT p2) p3)))), true, (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 51 factoid took 39 ms. Reduced automaton from 13 states, 54 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-4a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-4a-LTLFireability-06 finished in 4782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Graph (trivial) has 764 edges and 441 vertex of which 412 / 441 are part of one of the 78 SCC in 2 ms
Free SCC test removed 334 places
Ensure Unique test removed 683 transitions
Reduce isomorphic transitions removed 683 transitions.
Graph (complete) has 189 edges and 107 vertex of which 84 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 86
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 82 transition count 85
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 84 place count 5 transition count 8
Iterating global reduction 2 with 77 rules applied. Total rules applied 161 place count 5 transition count 8
Applied a total of 161 rules in 19 ms. Remains 5 /441 variables (removed 436) and now considering 8/771 (removed 763) transitions.
[2024-05-22 19:47:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 19:47:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 19:47:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 19:47:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 19:47:58] [INFO ] Invariant cache hit.
[2024-05-22 19:47:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 19:47:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:47:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 19:47:58] [INFO ] Invariant cache hit.
[2024-05-22 19:47:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/441 places, 8/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 5/441 places, 8/771 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-09 automaton TGBA Formula[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:(EQ s4 1)], 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 6 steps with 2 reset in 1 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-09 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 8 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 422 transition count 771
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 28 place count 413 transition count 753
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 413 transition count 753
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 413 transition count 751
Applied a total of 39 rules in 27 ms. Remains 413 /441 variables (removed 28) and now considering 751/771 (removed 20) transitions.
[2024-05-22 19:47:58] [INFO ] Flow matrix only has 585 transitions (discarded 166 similar events)
// Phase 1: matrix 585 rows 413 cols
[2024-05-22 19:47:58] [INFO ] Computed 83 invariants in 3 ms
[2024-05-22 19:47:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 19:47:58] [INFO ] Flow matrix only has 585 transitions (discarded 166 similar events)
[2024-05-22 19:47:58] [INFO ] Invariant cache hit.
[2024-05-22 19:47:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:47:59] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-22 19:47:59] [INFO ] Flow matrix only has 585 transitions (discarded 166 similar events)
[2024-05-22 19:47:59] [INFO ] Invariant cache hit.
[2024-05-22 19:48:00] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 413/441 places, 751/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1402 ms. Remains : 413/441 places, 751/771 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s391 1) (EQ s410 1)), p1:(OR (AND (OR (AND (EQ s286 1) (EQ s409 1)) (AND (EQ s391 1) (EQ s410 1))) (EQ s389 1) (EQ s411 1)) (AND (EQ s235 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-10 finished in 1554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&F(p1)))&&F(p2)))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 421 transition count 771
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 412 transition count 753
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 412 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 412 transition count 750
Applied a total of 41 rules in 14 ms. Remains 412 /441 variables (removed 29) and now considering 750/771 (removed 21) transitions.
[2024-05-22 19:48:00] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
// Phase 1: matrix 584 rows 412 cols
[2024-05-22 19:48:00] [INFO ] Computed 82 invariants in 2 ms
[2024-05-22 19:48:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 19:48:00] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:48:00] [INFO ] Invariant cache hit.
[2024-05-22 19:48:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:48:00] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-22 19:48:00] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:48:00] [INFO ] Invariant cache hit.
[2024-05-22 19:48:01] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/441 places, 750/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 412/441 places, 750/771 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s408 1) (EQ s411 1)), p1:(AND (EQ s392 1) (EQ s409 1)), p0:(AND (EQ s396 1) (EQ s410 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-12 finished in 1555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(F(p2)&&p1)))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 421 transition count 771
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 412 transition count 753
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 412 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 412 transition count 750
Applied a total of 41 rules in 21 ms. Remains 412 /441 variables (removed 29) and now considering 750/771 (removed 21) transitions.
[2024-05-22 19:48:01] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
// Phase 1: matrix 584 rows 412 cols
[2024-05-22 19:48:01] [INFO ] Computed 82 invariants in 6 ms
[2024-05-22 19:48:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 19:48:01] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:48:01] [INFO ] Invariant cache hit.
[2024-05-22 19:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:48:02] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-22 19:48:02] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2024-05-22 19:48:02] [INFO ] Invariant cache hit.
[2024-05-22 19:48:02] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/441 places, 750/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 412/441 places, 750/771 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s399 0) (EQ s410 0)), p1:(AND (EQ s175 1) (EQ s409 1)), p2:(OR (EQ s396 0) (EQ s411 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1544 ms.
Product exploration explored 100000 steps with 50000 reset in 1181 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 831 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-4a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-4a-LTLFireability-13 finished in 4253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((!p0||G(p1))))||(F((!p0||G(p1)))&&F(p2))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Graph (trivial) has 761 edges and 441 vertex of which 411 / 441 are part of one of the 80 SCC in 2 ms
Free SCC test removed 331 places
Ensure Unique test removed 676 transitions
Reduce isomorphic transitions removed 676 transitions.
Graph (complete) has 196 edges and 110 vertex of which 89 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 89 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 88 transition count 94
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 80 place count 12 transition count 18
Iterating global reduction 2 with 76 rules applied. Total rules applied 156 place count 12 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 12 transition count 16
Applied a total of 158 rules in 9 ms. Remains 12 /441 variables (removed 429) and now considering 16/771 (removed 755) transitions.
[2024-05-22 19:48:05] [INFO ] Flow matrix only has 11 transitions (discarded 5 similar events)
// Phase 1: matrix 11 rows 12 cols
[2024-05-22 19:48:05] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 19:48:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 19:48:05] [INFO ] Flow matrix only has 11 transitions (discarded 5 similar events)
[2024-05-22 19:48:05] [INFO ] Invariant cache hit.
[2024-05-22 19:48:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:48:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 19:48:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:48:06] [INFO ] Flow matrix only has 11 transitions (discarded 5 similar events)
[2024-05-22 19:48:06] [INFO ] Invariant cache hit.
[2024-05-22 19:48:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/441 places, 16/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 12/441 places, 16/771 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1)), p1:(NEQ s2 1), p2:(AND (EQ s9 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-4a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-4a-LTLFireability-14 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||G(F(p2))||G(p0))))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 771/771 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 420 transition count 771
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 412 transition count 755
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 412 transition count 755
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 412 transition count 753
Applied a total of 39 rules in 21 ms. Remains 412 /441 variables (removed 29) and now considering 753/771 (removed 18) transitions.
[2024-05-22 19:48:06] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
// Phase 1: matrix 586 rows 412 cols
[2024-05-22 19:48:06] [INFO ] Computed 81 invariants in 3 ms
[2024-05-22 19:48:06] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 19:48:06] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2024-05-22 19:48:06] [INFO ] Invariant cache hit.
[2024-05-22 19:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:48:07] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-22 19:48:07] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2024-05-22 19:48:07] [INFO ] Invariant cache hit.
[2024-05-22 19:48:07] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 412/441 places, 753/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 412/441 places, 753/771 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DLCshifumi-PT-4a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s401 1) (EQ s410 1)), p1:(AND (EQ s381 1) (EQ s411 1)), p2:(EQ s276 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-4a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-4a-LTLFireability-15 finished in 1895 ms.
All properties solved by simple procedures.
Total runtime 39037 ms.

BK_STOP 1716407289384

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCshifumi-PT-4a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DLCshifumi-PT-4a, 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 r131-smll-171624288600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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