fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772300628
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Dekker-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1097.867 88500.00 114066.00 452.70 FFFFTFTFFFFFFFTF normal

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-165254772300628.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-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 05:16 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.7K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.9M 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-100-LTLFireability-00
FORMULA_NAME Dekker-PT-100-LTLFireability-01
FORMULA_NAME Dekker-PT-100-LTLFireability-02
FORMULA_NAME Dekker-PT-100-LTLFireability-03
FORMULA_NAME Dekker-PT-100-LTLFireability-04
FORMULA_NAME Dekker-PT-100-LTLFireability-05
FORMULA_NAME Dekker-PT-100-LTLFireability-06
FORMULA_NAME Dekker-PT-100-LTLFireability-07
FORMULA_NAME Dekker-PT-100-LTLFireability-08
FORMULA_NAME Dekker-PT-100-LTLFireability-09
FORMULA_NAME Dekker-PT-100-LTLFireability-10
FORMULA_NAME Dekker-PT-100-LTLFireability-11
FORMULA_NAME Dekker-PT-100-LTLFireability-12
FORMULA_NAME Dekker-PT-100-LTLFireability-13
FORMULA_NAME Dekker-PT-100-LTLFireability-14
FORMULA_NAME Dekker-PT-100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631922736

Running Version 202205111006
[2022-05-15 16:25:23] [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:25:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:25:24] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2022-05-15 16:25:24] [INFO ] Transformed 500 places.
[2022-05-15 16:25:24] [INFO ] Transformed 10200 transitions.
[2022-05-15 16:25:24] [INFO ] Found NUPN structural information;
[2022-05-15 16:25:24] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 611 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Dekker-PT-100-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 166 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 216 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:24] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 16:25:24] [INFO ] Computed 300 place invariants in 31 ms
[2022-05-15 16:25:26] [INFO ] Implicit Places using invariants in 1504 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1545 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 230 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 400/500 places, 10200/10200 transitions.
Support contains 166 out of 400 places after structural reductions.
[2022-05-15 16:25:27] [INFO ] Flatten gal took : 636 ms
[2022-05-15 16:25:28] [INFO ] Flatten gal took : 450 ms
[2022-05-15 16:25:28] [INFO ] Input system was already deterministic with 10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 28) seen :27
Finished Best-First random walk after 101 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=12 )
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)||p0)))&&(F(p1) U !p0)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 118 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:29] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:29] [INFO ] Computed 200 place invariants in 8 ms
[2022-05-15 16:25:31] [INFO ] Implicit Places using invariants in 1563 ms returned []
Implicit Place search using SMT only with invariants took 1564 ms to find 0 implicit places.
[2022-05-15 16:25:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:31] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 16:25:34] [INFO ] Dead Transitions using invariants and state equation in 3260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), true]
Running random walk in product with property : Dekker-PT-100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s77 1) (EQ s276 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-00 finished in 5240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(X(p0))))||(p1 U F(G(X(p1))))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 814 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:35] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:35] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:25:37] [INFO ] Implicit Places using invariants in 1417 ms returned []
Implicit Place search using SMT only with invariants took 1419 ms to find 0 implicit places.
[2022-05-15 16:25:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:37] [INFO ] Computed 200 place invariants in 7 ms
[2022-05-15 16:25:40] [INFO ] Dead Transitions using invariants and state equation in 3149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s131 1) (EQ s193 1) (EQ s392 1)), p0:(OR (EQ s25 0) (EQ s121 0) (EQ s224 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 358 reset in 2387 ms.
Stack based approach found an accepted trace after 500 steps with 1 reset with depth 295 and stack size 294 in 14 ms.
FORMULA Dekker-PT-100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-01 finished in 7928 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (p2||G(!p1))))))'
Support contains 103 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 93 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:43] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:43] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-15 16:25:44] [INFO ] Implicit Places using invariants in 1306 ms returned []
Implicit Place search using SMT only with invariants took 1307 ms to find 0 implicit places.
[2022-05-15 16:25:44] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:44] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 16:25:47] [INFO ] Dead Transitions using invariants and state equation in 3148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), true]
Running random walk in product with property : Dekker-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s151 1) (EQ s165 1) (EQ s364 1)), p2:(AND (NOT (AND (EQ s151 1) (EQ s165 1) (EQ s364 1))) (NOT (AND (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (E...], 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]]
Entered a terminal (fully accepting) state of product in 40983 steps with 403 reset in 872 ms.
FORMULA Dekker-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-02 finished in 5653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))||G(F(G(p1)))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 632 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:49] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:49] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:25:50] [INFO ] Implicit Places using invariants in 1356 ms returned []
Implicit Place search using SMT only with invariants took 1358 ms to find 0 implicit places.
[2022-05-15 16:25:50] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:50] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:25:53] [INFO ] Dead Transitions using invariants and state equation in 3081 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s39 1) (EQ s161 1) (EQ s360 1) (EQ s169 1) (EQ s175 1) (EQ s374 1)), p0:(AND (OR (EQ s39 0) (EQ s161 0) (EQ s360 0)) (EQ s9 1) (EQ s89 1) (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2204 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 2 ms.
FORMULA Dekker-PT-100-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-03 finished in 7546 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(p1)))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 90 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:25:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:56] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:25:57] [INFO ] Implicit Places using invariants in 1416 ms returned []
Implicit Place search using SMT only with invariants took 1417 ms to find 0 implicit places.
[2022-05-15 16:25:57] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:25:57] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:00] [INFO ] Dead Transitions using invariants and state equation in 3049 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s147 0) (EQ s197 0) (EQ s346 0)), p1:(AND (EQ s133 1) (EQ s191 1) (EQ s390 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1717 ms.
Product exploration explored 100000 steps with 50000 reset in 1750 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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Dekker-PT-100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-100-LTLFireability-04 finished in 8343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 448 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:04] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 16:26:06] [INFO ] Implicit Places using invariants in 1417 ms returned []
Implicit Place search using SMT only with invariants took 1418 ms to find 0 implicit places.
[2022-05-15 16:26:06] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:06] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:09] [INFO ] Dead Transitions using invariants and state equation in 3069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-05 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:(OR (NEQ s113 1) (NEQ s167 1) (NEQ s312 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 382 reset in 2062 ms.
Stack based approach found an accepted trace after 174 steps with 1 reset with depth 125 and stack size 124 in 4 ms.
FORMULA Dekker-PT-100-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-05 finished in 7092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((p0&&(!(p2 U p3)||p1))))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 94 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:11] [INFO ] Computed 200 place invariants in 20 ms
[2022-05-15 16:26:13] [INFO ] Implicit Places using invariants in 1337 ms returned []
Implicit Place search using SMT only with invariants took 1338 ms to find 0 implicit places.
[2022-05-15 16:26:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:13] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:16] [INFO ] Dead Transitions using invariants and state equation in 3032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) p3)), (OR (NOT p0) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s79 0) (EQ s278 0)), p1:(OR (EQ s105 0) (EQ s175 0) (EQ s304 0)), p3:(AND (EQ s49 1) (EQ s65 1) (EQ s264 1)), p2:(AND (EQ s53 1) (EQ...], 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 1744 ms.
Product exploration explored 100000 steps with 50000 reset in 1758 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 (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (OR (NOT p0) (AND (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p1) p3)))))]
False Knowledge obtained : [(X (X (OR (NOT p0) (AND (NOT p1) p3)))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) p3))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p3) (NOT p2))
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Dekker-PT-100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-100-LTLFireability-06 finished in 8420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U X(p1)))&&F(p2)))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:20] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:20] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:26:21] [INFO ] Implicit Places using invariants in 1380 ms returned []
Implicit Place search using SMT only with invariants took 1381 ms to find 0 implicit places.
[2022-05-15 16:26:21] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:21] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:24] [INFO ] Dead Transitions using invariants and state equation in 3016 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) p1), p1, (NOT p2), p1, true]
Running random walk in product with property : Dekker-PT-100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s25 1) (EQ s119 1) (EQ s224 1)), p0:(AND (EQ s67 1) (EQ s151 1) (EQ s350 1)), p1:(AND (EQ s129 1) (EQ s143 1) (EQ s328 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 910 reset in 2120 ms.
Stack based approach found an accepted trace after 329 steps with 4 reset with depth 33 and stack size 33 in 7 ms.
FORMULA Dekker-PT-100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-07 finished in 6776 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p1)&&p0))))'
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 97 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:26] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 16:26:28] [INFO ] Implicit Places using invariants in 1433 ms returned []
Implicit Place search using SMT only with invariants took 1435 ms to find 0 implicit places.
[2022-05-15 16:26:28] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:28] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:31] [INFO ] Dead Transitions using invariants and state equation in 3194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s63 1) (EQ s77 1) (EQ s262 1) (OR (EQ s69 0) (EQ s73 0) (EQ s268 0))), p1:(OR (EQ s69 0) (EQ s73 0) (EQ s268 0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-08 finished in 4853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 468 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:32] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 16:26:33] [INFO ] Implicit Places using invariants in 1425 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2022-05-15 16:26:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:33] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:36] [INFO ] Dead Transitions using invariants and state equation in 3133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s107 1) (EQ s306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2161 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 1 ms.
FORMULA Dekker-PT-100-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-11 finished in 7246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(p0 U p1)||G(p2)||p2))))'
Support contains 9 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 464 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:39] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:40] [INFO ] Implicit Places using invariants in 1377 ms returned []
Implicit Place search using SMT only with invariants took 1379 ms to find 0 implicit places.
[2022-05-15 16:26:40] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:40] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:43] [INFO ] Dead Transitions using invariants and state equation in 3088 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Dekker-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s37 1) (EQ s236 1)), p1:(AND (EQ s69 1) (EQ s159 1) (EQ s358 1)), p0:(AND (EQ s67 1) (EQ s141 1) (EQ s340 1))], 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 339 reset in 2120 ms.
Stack based approach found an accepted trace after 1775 steps with 7 reset with depth 18 and stack size 18 in 38 ms.
FORMULA Dekker-PT-100-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-100-LTLFireability-12 finished in 7198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(p0)))&&G((!p1 U p2))))'
Support contains 8 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 489 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 16:26:46] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:46] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:47] [INFO ] Implicit Places using invariants in 1367 ms returned []
Implicit Place search using SMT only with invariants took 1369 ms to find 0 implicit places.
[2022-05-15 16:26:47] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 16:26:47] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 16:26:50] [INFO ] Dead Transitions using invariants and state equation in 3002 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p0)]
Running random walk in product with property : Dekker-PT-100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s127 1) (EQ s326 1)), p1:(AND (EQ s11 1) (EQ s89 1) (EQ s288 1)), p0:(AND (EQ s1 1) (EQ s77 1) (EQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 5 ms.
FORMULA Dekker-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-100-LTLFireability-15 finished in 5084 ms.
All properties solved by simple procedures.
Total runtime 87367 ms.

BK_STOP 1652632011236

--------------------
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-100"
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-100, 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-165254772300628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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