Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772300636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 Dekker-PT-200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 06:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 25M May 10 09:33 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 Dekker-PT-200-LTLFireability-00
FORMULA_NAME Dekker-PT-200-LTLFireability-01
FORMULA_NAME Dekker-PT-200-LTLFireability-02
FORMULA_NAME Dekker-PT-200-LTLFireability-03
FORMULA_NAME Dekker-PT-200-LTLFireability-04
FORMULA_NAME Dekker-PT-200-LTLFireability-05
FORMULA_NAME Dekker-PT-200-LTLFireability-06
FORMULA_NAME Dekker-PT-200-LTLFireability-07
FORMULA_NAME Dekker-PT-200-LTLFireability-08
FORMULA_NAME Dekker-PT-200-LTLFireability-09
FORMULA_NAME Dekker-PT-200-LTLFireability-10
FORMULA_NAME Dekker-PT-200-LTLFireability-11
FORMULA_NAME Dekker-PT-200-LTLFireability-12
FORMULA_NAME Dekker-PT-200-LTLFireability-13
FORMULA_NAME Dekker-PT-200-LTLFireability-14
FORMULA_NAME Dekker-PT-200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652632817863

Running Version 202205111006
[2022-05-15 16:40:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2022-05-15 16:40:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:40:20] [INFO ] Load time of PNML (sax parser for PT used): 1290 ms
[2022-05-15 16:40:20] [INFO ] Transformed 1000 places.
[2022-05-15 16:40:20] [INFO ] Transformed 40400 transitions.
[2022-05-15 16:40:20] [INFO ] Found NUPN structural information;
[2022-05-15 16:40:20] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1590 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Dekker-PT-200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1070 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:40:22] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-05-15 16:40:22] [INFO ] Computed 600 place invariants in 67 ms
[2022-05-15 16:40:52] [INFO ] Implicit Places using invariants in 30461 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 199 places :
Implicit Place search using SMT only with invariants took 30545 ms to find 199 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 801/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 661 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 801/1000 places, 40400/40400 transitions.
Support contains 67 out of 801 places after structural reductions.
[2022-05-15 16:40:55] [INFO ] Flatten gal took : 1934 ms
[2022-05-15 16:40:57] [INFO ] Flatten gal took : 1603 ms
[2022-05-15 16:41:00] [INFO ] Input system was already deterministic with 40400 transitions.
Finished random walk after 1511 steps, including 0 resets, run visited all 30 properties in 255 ms. (steps per millisecond=5 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||p1))))'
Support contains 5 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 858 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:41:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:41:02] [INFO ] Computed 401 place invariants in 13 ms
[2022-05-15 16:41:09] [INFO ] Implicit Places using invariants in 6336 ms returned []
Implicit Place search using SMT only with invariants took 6338 ms to find 0 implicit places.
[2022-05-15 16:41:09] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:41:09] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-15 16:41:22] [INFO ] Dead Transitions using invariants and state equation in 13859 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NEQ s161 1) (NEQ s275 1) (NEQ s561 1)), p1:(AND (EQ s86 1) (EQ s486 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 299 steps with 0 reset in 30 ms.
FORMULA Dekker-PT-200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLFireability-00 finished in 21528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((F(p3)||p2)&&p1)||p0))))'
Support contains 9 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1621 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:41:24] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:41:24] [INFO ] Computed 401 place invariants in 7 ms
[2022-05-15 16:41:31] [INFO ] Implicit Places using invariants in 6761 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6796 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1503 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s249 0) (EQ s361 0) (EQ s648 0)), p1:(AND (EQ s81 1) (EQ s269 1) (EQ s480 1)), p3:(OR (EQ s249 0) (EQ s361 0) (EQ s648 0)), p2:(OR (EQ s49 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33 reset in 6564 ms.
Stack based approach found an accepted trace after 1673 steps with 0 reset with depth 1674 and stack size 1667 in 119 ms.
FORMULA Dekker-PT-200-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-02 finished in 16788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F((X(p0)||X(p1)||G(p2))))))'
Support contains 7 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1503 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:41:41] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:41:41] [INFO ] Computed 401 place invariants in 10 ms
[2022-05-15 16:41:47] [INFO ] Implicit Places using invariants in 6285 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6317 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1541 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s201 1) (EQ s287 1) (EQ s686 1)), p0:(OR (EQ s49 0) (EQ s199 0) (EQ s448 0)), p1:(OR (EQ s287 0) (EQ s331 0) (EQ s686 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 65 reset in 6018 ms.
Stack based approach found an accepted trace after 6661 steps with 1 reset with depth 2328 and stack size 2315 in 481 ms.
FORMULA Dekker-PT-200-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-03 finished in 16010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(F(p0)))))'
Support contains 3 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1493 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:41:57] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:41:57] [INFO ] Computed 401 place invariants in 6 ms
[2022-05-15 16:42:03] [INFO ] Implicit Places using invariants in 6079 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 1534 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLFireability-04 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:(AND (EQ s115 1) (EQ s391 1) (EQ s790 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]]
Product exploration explored 100000 steps with 267 reset in 6005 ms.
Stack based approach found an accepted trace after 63 steps with 0 reset with depth 64 and stack size 64 in 5 ms.
FORMULA Dekker-PT-200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-04 finished in 15287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((G(p0)||!p1)) U p0)||G(p2)))'
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 661 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:42:12] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:42:12] [INFO ] Computed 401 place invariants in 5 ms
[2022-05-15 16:42:18] [INFO ] Implicit Places using invariants in 6378 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6410 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 699 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(AND (EQ s145 1) (EQ s219 1) (EQ s544 1)), p1:(AND (EQ s7 1) (EQ s45 1) (EQ s406 1)), p2:(OR (AND (EQ s7 1) (EQ s45 1) (EQ s406 1)) (AND (EQ s145 1) (E...], 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 114 steps with 1 reset in 9 ms.
FORMULA Dekker-PT-200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLFireability-05 finished in 8108 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F((F(X(p2))&&p1))))))'
Support contains 9 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 740 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:42:20] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:42:20] [INFO ] Computed 401 place invariants in 6 ms
[2022-05-15 16:42:26] [INFO ] Implicit Places using invariants in 6704 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6746 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 686 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (OR (EQ s261 0) (EQ s365 0) (EQ s660 0)) (OR (EQ s137 0) (EQ s237 0) (EQ s636 0))), p2:(OR (EQ s33 0) (EQ s225 0) (EQ s624 0)), p1:(AND (EQ s33 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 11 ms.
FORMULA Dekker-PT-200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLFireability-06 finished in 8466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&F(X(p1))))'
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 675 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:42:28] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:42:28] [INFO ] Computed 401 place invariants in 1 ms
[2022-05-15 16:42:34] [INFO ] Implicit Places using invariants in 6128 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 696 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s95 0) (EQ s197 0) (EQ s596 0)), p0:(AND (OR (EQ s195 0) (EQ s385 0) (EQ s594 0)) (EQ s95 1) (EQ s197 1) (EQ s596 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6013 ms.
Stack based approach found an accepted trace after 402 steps with 0 reset with depth 403 and stack size 402 in 25 ms.
FORMULA Dekker-PT-200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-09 finished in 13791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((G(p1)||p0))))||(p2 U X(G(p3)))))'
Support contains 12 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 622 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:42:42] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:42:42] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-15 16:42:48] [INFO ] Implicit Places using invariants in 5869 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5915 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 659 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}, { cond=p3, acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 9}, { cond=p2, acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=9 dest: 7}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 12}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 13}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 14}], [{ cond=(NOT p3), acceptance={} source=11 dest: 6}, { cond=p3, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=12 dest: 7}, { cond=(AND p3 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p3 p1), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 11}, { cond=(AND p2 p3), acceptance={} source=13 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p2) p1), acceptance={} source=14 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND p2 p1), acceptance={} source=14 dest: 14}]], initial=0, aps=[p2:(AND (EQ s115 1) (EQ s157 1) (EQ s556 1)), p3:(AND (EQ s331 1) (EQ s341 1) (EQ s740 1)), p0:(OR (EQ s219 0) (EQ s273 0) (EQ s672 0)), p1:(OR (EQ s31 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, 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, false, false]]
Entered a terminal (fully accepting) state of product in 12569 steps with 2857 reset in 718 ms.
FORMULA Dekker-PT-200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLFireability-11 finished in 8473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((G(p0)||p0))) U p1)))'
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 645 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:42:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:42:50] [INFO ] Computed 401 place invariants in 3 ms
[2022-05-15 16:42:56] [INFO ] Implicit Places using invariants in 6035 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6085 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 781 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s279 1) (EQ s363 1) (EQ s762 1)) (AND (EQ s67 1) (EQ s285 1) (EQ s684 1) (NOT (AND (EQ s279 1) (EQ s363 1) (EQ s762 1))))), p0:(AND (EQ s6...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 251 reset in 5784 ms.
Stack based approach found an accepted trace after 248 steps with 2 reset with depth 66 and stack size 66 in 16 ms.
FORMULA Dekker-PT-200-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-12 finished in 13492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 651 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:43:04] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:43:04] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-15 16:43:10] [INFO ] Implicit Places using invariants in 6027 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6077 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 702 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s137 0) (EQ s255 0) (EQ s654 0)), p1:(AND (EQ s21 1) (EQ s299 1) (EQ s420 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][false, false, false, false]]
Product exploration explored 100000 steps with 129 reset in 5832 ms.
Stack based approach found an accepted trace after 1003 steps with 0 reset with depth 1004 and stack size 1002 in 61 ms.
FORMULA Dekker-PT-200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLFireability-13 finished in 13507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||(F(p2)&&X(F(p3)))||p0)))'
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 683 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-05-15 16:43:17] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 801 cols
[2022-05-15 16:43:17] [INFO ] Computed 401 place invariants in 2 ms
[2022-05-15 16:43:23] [INFO ] Implicit Places using invariants in 6039 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6076 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/801 places, 40400/40400 transitions.
Applied a total of 0 rules in 722 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 800/801 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Dekker-PT-200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s127 0) (EQ s444 0)), p1:(OR (NEQ s95 1) (NEQ s131 1) (NEQ s530 1)), p2:(OR (EQ s95 0) (EQ s131 0) (EQ s530 0)), p3:(OR (EQ s45 0) (...], 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]]
Product exploration explored 100000 steps with 50000 reset in 5416 ms.
Product exploration explored 100000 steps with 50000 reset in 5859 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Dekker-PT-200-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-200-LTLFireability-15 finished in 20260 ms.
All properties solved by simple procedures.
Total runtime 198482 ms.

BK_STOP 1652633017776

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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="Dekker-PT-200"
export BK_EXAMINATION="LTLFireability"
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 Dekker-PT-200, 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 r060-tall-165254772300636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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