Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564800309.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 109K May 5 16:52 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 ShieldRVt-PT-040A-00
FORMULA_NAME ShieldRVt-PT-040A-01
FORMULA_NAME ShieldRVt-PT-040A-02
FORMULA_NAME ShieldRVt-PT-040A-03
FORMULA_NAME ShieldRVt-PT-040A-04
FORMULA_NAME ShieldRVt-PT-040A-05
FORMULA_NAME ShieldRVt-PT-040A-06
FORMULA_NAME ShieldRVt-PT-040A-07
FORMULA_NAME ShieldRVt-PT-040A-08
FORMULA_NAME ShieldRVt-PT-040A-09
FORMULA_NAME ShieldRVt-PT-040A-10
FORMULA_NAME ShieldRVt-PT-040A-11
FORMULA_NAME ShieldRVt-PT-040A-12
FORMULA_NAME ShieldRVt-PT-040A-13
FORMULA_NAME ShieldRVt-PT-040A-14
FORMULA_NAME ShieldRVt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1621275483513

Running Version 0
[2021-05-17 18:18:05] [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]
[2021-05-17 18:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:18:06] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-17 18:18:06] [INFO ] Transformed 323 places.
[2021-05-17 18:18:06] [INFO ] Transformed 323 transitions.
[2021-05-17 18:18:06] [INFO ] Found NUPN structural information;
[2021-05-17 18:18:06] [INFO ] Parsed PT model containing 323 places and 323 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 18:18:06] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 66 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 58 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:06] [INFO ] Computed 161 place invariants in 31 ms
[2021-05-17 18:18:06] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:06] [INFO ] Computed 161 place invariants in 11 ms
[2021-05-17 18:18:07] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:07] [INFO ] Computed 161 place invariants in 18 ms
[2021-05-17 18:18:07] [INFO ] Dead Transitions using invariants and state equation in 490 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
[2021-05-17 18:18:08] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 18:18:08] [INFO ] Flatten gal took : 105 ms
FORMULA ShieldRVt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 18:18:08] [INFO ] Flatten gal took : 52 ms
[2021-05-17 18:18:08] [INFO ] Input system was already deterministic with 322 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 29) seen :20
Running SMT prover for 9 properties.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:09] [INFO ] Computed 161 place invariants in 4 ms
[2021-05-17 18:18:09] [INFO ] [Real]Absence check using 161 positive place invariants in 42 ms returned sat
[2021-05-17 18:18:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:09] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-17 18:18:09] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 39 ms.
[2021-05-17 18:18:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 51 ms returned sat
[2021-05-17 18:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:10] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-17 18:18:10] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 44 ms.
[2021-05-17 18:18:13] [INFO ] Added : 311 causal constraints over 64 iterations in 3264 ms. Result :sat
[2021-05-17 18:18:13] [INFO ] [Real]Absence check using 161 positive place invariants in 43 ms returned sat
[2021-05-17 18:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:13] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-17 18:18:13] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-17 18:18:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2021-05-17 18:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:14] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-17 18:18:14] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 18:18:17] [INFO ] Added : 302 causal constraints over 62 iterations in 2870 ms. Result :sat
[2021-05-17 18:18:17] [INFO ] [Real]Absence check using 161 positive place invariants in 50 ms returned sat
[2021-05-17 18:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:17] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-17 18:18:17] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-17 18:18:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2021-05-17 18:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:17] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-17 18:18:17] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 18:18:20] [INFO ] Added : 288 causal constraints over 59 iterations in 2276 ms. Result :sat
[2021-05-17 18:18:20] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2021-05-17 18:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:20] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-17 18:18:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 18:18:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 43 ms returned sat
[2021-05-17 18:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:20] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-17 18:18:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 18:18:23] [INFO ] Added : 293 causal constraints over 60 iterations in 2360 ms. Result :sat
[2021-05-17 18:18:23] [INFO ] [Real]Absence check using 161 positive place invariants in 39 ms returned sat
[2021-05-17 18:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:23] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-17 18:18:23] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-17 18:18:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 41 ms returned sat
[2021-05-17 18:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:23] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-17 18:18:23] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 18:18:26] [INFO ] Added : 310 causal constraints over 64 iterations in 2815 ms. Result :sat
[2021-05-17 18:18:26] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2021-05-17 18:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:26] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-17 18:18:26] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-17 18:18:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:27] [INFO ] [Nat]Absence check using 161 positive place invariants in 49 ms returned sat
[2021-05-17 18:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:27] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-17 18:18:27] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-17 18:18:30] [INFO ] Added : 314 causal constraints over 65 iterations in 3063 ms. Result :sat
[2021-05-17 18:18:30] [INFO ] [Real]Absence check using 161 positive place invariants in 63 ms returned sat
[2021-05-17 18:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:30] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-17 18:18:30] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-17 18:18:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2021-05-17 18:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:31] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-17 18:18:31] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-17 18:18:34] [INFO ] Added : 303 causal constraints over 64 iterations in 3311 ms. Result :sat
[2021-05-17 18:18:34] [INFO ] [Real]Absence check using 161 positive place invariants in 52 ms returned sat
[2021-05-17 18:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:34] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-17 18:18:34] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-17 18:18:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2021-05-17 18:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:35] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-17 18:18:35] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-17 18:18:38] [INFO ] Added : 313 causal constraints over 70 iterations in 3607 ms. Result :sat
[2021-05-17 18:18:38] [INFO ] [Real]Absence check using 161 positive place invariants in 52 ms returned sat
[2021-05-17 18:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:39] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-17 18:18:39] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-17 18:18:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:18:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 41 ms returned sat
[2021-05-17 18:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:18:39] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-17 18:18:39] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-17 18:18:41] [INFO ] Added : 279 causal constraints over 60 iterations in 2416 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 70 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:42] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 18:18:42] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:42] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 18:18:42] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2021-05-17 18:18:42] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:42] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-17 18:18:43] [INFO ] Dead Transitions using invariants and state equation in 366 ms returned []
Finished structural reductions, in 1 iterations. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s182 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 610 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldRVt-PT-040A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-00 finished in 1988 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(F(p0)) U p1)) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 16 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:44] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:18:44] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:44] [INFO ] Computed 161 place invariants in 3 ms
[2021-05-17 18:18:44] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:44] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:18:45] [INFO ] Dead Transitions using invariants and state equation in 314 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-01 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s268 1) (EQ s269 1) (EQ s272 1)), p1:(AND (NEQ s268 0) (NEQ s269 0) (NEQ s272 0)), p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 628 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldRVt-PT-040A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-01 finished in 2024 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 83 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:46] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 18:18:46] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:46] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-17 18:18:46] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2021-05-17 18:18:46] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2021-05-17 18:18:46] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 18:18:47] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Finished structural reductions, in 1 iterations. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s260 1), p0:(EQ s282 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 355 reset in 760 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldRVt-PT-040A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-03 finished in 2038 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(X(p1) U ((p1&&X(p1))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:48] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:18:48] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:48] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:18:48] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:48] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:18:49] [INFO ] Dead Transitions using invariants and state equation in 360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-05 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s171 1) (NEQ s180 1) (NEQ s186 1)), p1:(OR (NEQ s198 1) (NEQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2060 ms.
Product exploration explored 100000 steps with 50000 reset in 1894 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 1793 ms.
Product exploration explored 100000 steps with 50000 reset in 1851 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 5 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 322
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 45 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2021-05-17 18:18:57] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:18:57] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:18:57] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Product exploration explored 100000 steps with 50000 reset in 3078 ms.
Product exploration explored 100000 steps with 50000 reset in 2998 ms.
[2021-05-17 18:19:04] [INFO ] Flatten gal took : 42 ms
[2021-05-17 18:19:04] [INFO ] Flatten gal took : 42 ms
[2021-05-17 18:19:04] [INFO ] Time to serialize gal into /tmp/LTL3987380032177559289.gal : 20 ms
[2021-05-17 18:19:04] [INFO ] Time to serialize properties into /tmp/LTL1965191345560327387.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3987380032177559289.gal, -t, CGAL, -LTL, /tmp/LTL1965191345560327387.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3987380032177559289.gal -t CGAL -LTL /tmp/LTL1965191345560327387.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(((p171==0)||(p180==0))||(p186==0))"))||((X("((p198==0)||(p201==0))"))U((("((p198==0)||(p201==0))")&&(X("((p198==0)||(p201==0))")))||(X(G("((p198==0)||(p201==0))")))))))
Formula 0 simplified : !(G"(((p171==0)||(p180==0))||(p186==0))" | (X"((p198==0)||(p201==0))" U (("((p198==0)||(p201==0))" & X"((p198==0)||(p201==0))") | XG"((p198==0)||(p201==0))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
96 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.03598,32940,1,0,6,84425,23,0,8831,23415,18
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-040A-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-040A-05 finished in 17264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:05] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:05] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:05] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:06] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:06] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:06] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 743 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-040A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-06 finished in 2055 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p1)&&p0))||F(p2)))], workingDir=/home/mcc/execution]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 42 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2021-05-17 18:19:07] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:07] [INFO ] Implicit Places using invariants in 297 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 300 ms to find 1 implicit places.
[2021-05-17 18:19:07] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 321 rows 321 cols
[2021-05-17 18:19:07] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 18:19:08] [INFO ] Dead Transitions using invariants and state equation in 795 ms returned []
Starting structural reductions, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2021-05-17 18:19:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 321 rows 321 cols
[2021-05-17 18:19:08] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 18:19:09] [INFO ] Dead Transitions using invariants and state equation in 566 ms returned []
Finished structural reductions, in 2 iterations. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040A-07 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s166 1) (EQ s169 1)), p2:(AND (EQ s260 1) (EQ s261 1) (EQ s264 1)), p1:(AND (EQ s126 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 123 reset in 502 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-07 finished in 2400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(X(F(p1))||(p2&&G(p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:09] [INFO ] Computed 161 place invariants in 3 ms
[2021-05-17 18:19:10] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:10] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:10] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:10] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:10] [INFO ] Dead Transitions using invariants and state equation in 393 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-040A-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (NEQ s316 1) (NEQ s317 1) (NEQ s320 1)), p0:(OR (EQ s316 0) (EQ s317 0) (EQ s320 0)), p2:(OR (EQ s190 0) (EQ s193 0)), p3:(NEQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1906 ms.
Product exploration explored 100000 steps with 33333 reset in 1798 ms.
Knowledge obtained : [p1, p0, p2, p3]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33333 reset in 1671 ms.
Product exploration explored 100000 steps with 33333 reset in 1422 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 14 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2021-05-17 18:19:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:18] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:18] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Product exploration explored 100000 steps with 33333 reset in 3138 ms.
Product exploration explored 100000 steps with 33333 reset in 3160 ms.
[2021-05-17 18:19:25] [INFO ] Flatten gal took : 35 ms
[2021-05-17 18:19:25] [INFO ] Flatten gal took : 32 ms
[2021-05-17 18:19:25] [INFO ] Time to serialize gal into /tmp/LTL12632849803877347686.gal : 12 ms
[2021-05-17 18:19:25] [INFO ] Time to serialize properties into /tmp/LTL9038041339177021623.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12632849803877347686.gal, -t, CGAL, -LTL, /tmp/LTL9038041339177021623.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12632849803877347686.gal -t CGAL -LTL /tmp/LTL9038041339177021623.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((p316==0)||(p317==0))||(p320==0))")&&((X(F("(((p316==0)||(p317==0))||(p320==0))")))||((G("(p105==0)"))&&("((p190==0)||(p193==0))"))))))
Formula 0 simplified : !X("(((p316==0)||(p317==0))||(p320==0))" & (XF"(((p316==0)||(p317==0))||(p320==0))" | ("((p190==0)||(p193==0))" & G"(p105==0)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
121 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.30621,33056,1,0,7,84432,37,0,9051,23415,19
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-040A-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-040A-08 finished in 16840 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:26] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:26] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:26] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:27] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:27] [INFO ] Computed 161 place invariants in 2 ms
[2021-05-17 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 331 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s147 1), p2:(AND (EQ s87 1) (EQ s101 1)), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 455 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA ShieldRVt-PT-040A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-09 finished in 1654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(!p0))||(p1 U X(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:28] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:28] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:28] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:28] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:28] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:29] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), p0]
Running random walk in product with property : ShieldRVt-PT-040A-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s13 1) (EQ s16 1)), p0:(OR (NEQ s171 1) (NEQ s180 1) (NEQ s186 1)), p2:(EQ s259 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-040A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-10 finished in 1588 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:29] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:30] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:30] [INFO ] Computed 161 place invariants in 5 ms
[2021-05-17 18:19:30] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:30] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:30] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s309 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-11 finished in 1109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&(p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:30] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:31] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:31] [INFO ] Computed 161 place invariants in 0 ms
[2021-05-17 18:19:31] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:31] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldRVt-PT-040A-12 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s240 1) (EQ s242 1) (EQ s247 1) (EQ s299 1) (EQ s308 1) (EQ s314 1)), p1:(AND (EQ s240 1) (EQ s242 1) (EQ s247 1)), p0:(EQ s159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-12 finished in 1111 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 22 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2021-05-17 18:19:32] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:32] [INFO ] Implicit Places using invariants in 198 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
[2021-05-17 18:19:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 321 rows 321 cols
[2021-05-17 18:19:32] [INFO ] Computed 160 place invariants in 1 ms
[2021-05-17 18:19:32] [INFO ] Dead Transitions using invariants and state equation in 301 ms returned []
Starting structural reductions, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2021-05-17 18:19:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 321 rows 321 cols
[2021-05-17 18:19:32] [INFO ] Computed 160 place invariants in 0 ms
[2021-05-17 18:19:32] [INFO ] Dead Transitions using invariants and state equation in 315 ms returned []
Finished structural reductions, in 2 iterations. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s318 1) (NEQ s320 1)) (OR (NEQ s108 1) (NEQ s109 1) (NEQ s112 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 497 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-14 finished in 1506 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(G(F(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:33] [INFO ] Computed 161 place invariants in 3 ms
[2021-05-17 18:19:33] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:33] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:34] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2021-05-17 18:19:34] [INFO ] Computed 161 place invariants in 1 ms
[2021-05-17 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 300 ms returned []
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldRVt-PT-040A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s64 1) (EQ s66 1) (EQ s71 1)), p2:(AND (EQ s214 1) (EQ s217 1)), p0:(AND (EQ s182 1) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 460 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldRVt-PT-040A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-15 finished in 1596 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621275576348

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040A"
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 ShieldRVt-PT-040A, 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 r235-smll-162106564800309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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