fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r064-tall-162038397700765
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
547.088 28951.00 32625.00 3376.30 TFFFFFTFFFFFFFFF normal

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.r064-tall-162038397700765.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397700765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-015-00
FORMULA_NAME Dekker-PT-015-01
FORMULA_NAME Dekker-PT-015-02
FORMULA_NAME Dekker-PT-015-03
FORMULA_NAME Dekker-PT-015-04
FORMULA_NAME Dekker-PT-015-05
FORMULA_NAME Dekker-PT-015-06
FORMULA_NAME Dekker-PT-015-07
FORMULA_NAME Dekker-PT-015-08
FORMULA_NAME Dekker-PT-015-09
FORMULA_NAME Dekker-PT-015-10
FORMULA_NAME Dekker-PT-015-11
FORMULA_NAME Dekker-PT-015-12
FORMULA_NAME Dekker-PT-015-13
FORMULA_NAME Dekker-PT-015-14
FORMULA_NAME Dekker-PT-015-15

=== Now, execution of the tool begins

BK_START 1620569505254

Running Version 0
[2021-05-09 14:11:48] [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-09 14:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:11:48] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-09 14:11:48] [INFO ] Transformed 75 places.
[2021-05-09 14:11:48] [INFO ] Transformed 255 transitions.
[2021-05-09 14:11:48] [INFO ] Found NUPN structural information;
[2021-05-09 14:11:48] [INFO ] Parsed PT model containing 75 places and 255 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:11:48] [INFO ] Initial state test concluded for 5 properties.
FORMULA Dekker-PT-015-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:48] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2021-05-09 14:11:48] [INFO ] Computed 45 place invariants in 10 ms
[2021-05-09 14:11:48] [INFO ] Implicit Places using invariants in 152 ms returned [30, 33, 36, 42, 45, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 179 ms to find 13 implicit places.
[2021-05-09 14:11:48] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:48] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:11:49] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Starting structural reductions, iteration 1 : 62/75 places, 255/255 transitions.
Applied a total of 0 rules in 22 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:49] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:49] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:11:49] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 2 iterations. Remains : 62/75 places, 255/255 transitions.
[2021-05-09 14:11:49] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 14:11:49] [INFO ] Flatten gal took : 56 ms
FORMULA Dekker-PT-015-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:11:49] [INFO ] Flatten gal took : 24 ms
[2021-05-09 14:11:49] [INFO ] Input system was already deterministic with 255 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 30) seen :26
Running SMT prover for 4 properties.
[2021-05-09 14:11:50] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:50] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:11:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 14:11:50] [INFO ] [Real]Added 15 Read/Feed constraints in 15 ms returned sat
[2021-05-09 14:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2021-05-09 14:11:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 15 transitions) in 9 ms.
[2021-05-09 14:11:50] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Added 15 Read/Feed constraints in 7 ms returned sat
[2021-05-09 14:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 2 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 62 ms
[2021-05-09 14:11:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 15 transitions) in 7 ms.
[2021-05-09 14:11:50] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 70 ms
[2021-05-09 14:11:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 15 transitions) in 15 ms.
[2021-05-09 14:11:50] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 14:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 3 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:11:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 14:11:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 1 ms returned sat
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 5 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 9 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Deduced a trap composed of 4 places in 8 ms of which 0 ms to minimize.
[2021-05-09 14:11:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 71 ms
[2021-05-09 14:11:50] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 15 transitions) in 8 ms.
[2021-05-09 14:11:50] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1))&&F((p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 10 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 39 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:53] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:11:53] [INFO ] Implicit Places using invariants in 155 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
[2021-05-09 14:11:53] [INFO ] Redundant transitions in 21 ms returned []
[2021-05-09 14:11:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2021-05-09 14:11:53] [INFO ] Computed 31 place invariants in 1 ms
[2021-05-09 14:11:53] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Starting structural reductions, iteration 1 : 61/62 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:53] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 14:11:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2021-05-09 14:11:53] [INFO ] Computed 31 place invariants in 0 ms
[2021-05-09 14:11:53] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Dekker-PT-015-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s17 1) (NEQ s47 1)), p1:(OR (NEQ s12 1) (NEQ s42 1)), p3:(AND (OR (NEQ s1 1) (NEQ s3 1) (NEQ s32 1)) (OR (NEQ s1 1) (NEQ s9 1) (NEQ s30 1))), p2:(OR (NEQ s1 1) (NEQ s9 1) (NEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-015-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-01 finished in 3374 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:54] [INFO ] Computed 32 place invariants in 3 ms
[2021-05-09 14:11:54] [INFO ] Implicit Places using invariants in 71 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
[2021-05-09 14:11:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:54] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:54] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:54] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:54] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:54] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s19 0) (EQ s49 0))], 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 385 ms.
Product exploration explored 100000 steps with 0 reset in 522 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 359 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:56] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 14:11:56] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:56] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:56] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 255/255 transitions.
Product exploration explored 100000 steps with 0 reset in 442 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
[2021-05-09 14:11:57] [INFO ] Flatten gal took : 22 ms
[2021-05-09 14:11:57] [INFO ] Flatten gal took : 19 ms
[2021-05-09 14:11:57] [INFO ] Time to serialize gal into /tmp/LTL915781598956360629.gal : 32 ms
[2021-05-09 14:11:57] [INFO ] Time to serialize properties into /tmp/LTL11093933244901527018.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL915781598956360629.gal, -t, CGAL, -LTL, /tmp/LTL11093933244901527018.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/LTL915781598956360629.gal -t CGAL -LTL /tmp/LTL11093933244901527018.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G("((flag_1_9==0)||(p3_9==0))"))))
Formula 0 simplified : !XG"((flag_1_9==0)||(p3_9==0))"
Reverse transition relation is NOT exact ! Due to transitions t16, t33, t50, t67, t84, t101, t118, t135, t152, t169, t186, t203, t220, t237, t254, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/240/15/255
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
26 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,0.313787,25828,1,0,567,60455,539,273,4382,40304,616
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-015-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Dekker-PT-015-02 finished in 3805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 15 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:58] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:58] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-09 14:11:58] [INFO ] Implicit Places using invariants in 66 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
[2021-05-09 14:11:58] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:11:58] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:58] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:58] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:58] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:11:58] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:58] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:58] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s32 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 1 reset in 360 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 11 in 0 ms.
FORMULA Dekker-PT-015-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-03 finished in 748 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))||(G(p1)&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:58] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:11:58] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:11:58] [INFO ] Implicit Places using invariants in 49 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
[2021-05-09 14:11:59] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:59] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:59] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:11:59] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:11:59] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:11:59] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 5073 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s27 0) (EQ s56 0)), p0:(AND (EQ s9 1) (EQ s17 1) (EQ s38 1)), p2:(OR (NEQ s21 1) (NEQ s29 1) (NEQ s58 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]]
Product exploration explored 100000 steps with 3226 reset in 434 ms.
Stack based approach found an accepted trace after 173 steps with 5 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Dekker-PT-015-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-04 finished in 5782 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0 U (p1||G(p0))))&&F((p2&&(p3 U (p4||G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 11 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:04] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:04] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:04] [INFO ] Implicit Places using invariants in 53 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
[2021-05-09 14:12:04] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:12:04] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:04] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:04] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:04] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:04] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:05] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : Dekker-PT-015-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (NEQ s1 1) (NEQ s13 1) (NEQ s42 1)) (OR (NEQ s23 1) (NEQ s27 1) (NEQ s56 1))), p0:(OR (NEQ s23 1) (NEQ s27 1) (NEQ s56 1)), p2:(OR (NEQ s1 1) (NEQ s13 1) (NEQ s42 1)), p4:(AND (OR (NEQ s11 1) (NEQ s21 1) (NEQ s50 1)) (OR (NEQ s13 1) (NEQ s17 1) (NEQ s46 1))), p3:(OR (NEQ s13 1) (NEQ s17 1) (NEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3754 reset in 421 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Dekker-PT-015-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-05 finished in 861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U (p1||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 21 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:05] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:05] [INFO ] Implicit Places using invariants in 50 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
[2021-05-09 14:12:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:05] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:05] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:05] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:05] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-07 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s5 1) (EQ s27 1) (EQ s34 1)), p1:(AND (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s50 1)), p0:(AND (EQ s9 1) (EQ s15 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 348 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 Dekker-PT-015-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-07 finished in 707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:06] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:06] [INFO ] Implicit Places using invariants in 62 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:06] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:06] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:06] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:06] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-08 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:(AND (EQ s1 1) (EQ s3 1) (EQ s30 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 2 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-08 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:06] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:06] [INFO ] Implicit Places using invariants in 53 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
[2021-05-09 14:12:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:06] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:06] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:06] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:06] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p1)]
Running random walk in product with property : Dekker-PT-015-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s17 1) (EQ s47 1)), p0:(OR (EQ s15 0) (EQ s45 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 388 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Dekker-PT-015-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-09 finished in 709 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:07] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:07] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:07] [INFO ] Implicit Places using invariants in 66 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
[2021-05-09 14:12:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:07] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:07] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:07] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:07] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:07] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:07] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s15 1) (EQ s34 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 373 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Dekker-PT-015-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-10 finished in 705 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:08] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-09 14:12:08] [INFO ] Implicit Places using invariants in 57 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
[2021-05-09 14:12:08] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:08] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:08] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:08] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s25 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3213 reset in 364 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Dekker-PT-015-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-11 finished in 676 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:08] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:08] [INFO ] Implicit Places using invariants in 54 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:08] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:08] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:08] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:08] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:09] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s1 1) (NEQ s27 1) (NEQ s30 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 32669 reset in 296 ms.
Stack based approach found an accepted trace after 307 steps with 99 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Dekker-PT-015-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-12 finished in 638 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(G((X(G(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:09] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-09 14:12:09] [INFO ] Implicit Places using invariants in 69 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
[2021-05-09 14:12:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2021-05-09 14:12:09] [INFO ] Computed 31 place invariants in 0 ms
[2021-05-09 14:12:09] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 61/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 61 cols
[2021-05-09 14:12:09] [INFO ] Computed 31 place invariants in 17 ms
[2021-05-09 14:12:09] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : Dekker-PT-015-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s36 1)), p1:(AND (EQ s23 1) (EQ s29 1) (EQ s59 1)), p2:(AND (EQ s29 1) (EQ s60 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 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-13 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:09] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:09] [INFO ] Implicit Places using invariants in 63 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
[2021-05-09 14:12:09] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:12:09] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:09] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:09] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:10] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:12:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:10] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:10] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s11 1) (EQ s40 1)), p0:(AND (EQ s9 1) (EQ s15 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 359 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Dekker-PT-015-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-14 finished in 712 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0||(X(G(p1)) U (X(G(p1))&&p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 62 cols
[2021-05-09 14:12:10] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-09 14:12:10] [INFO ] Implicit Places using invariants in 61 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
[2021-05-09 14:12:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:10] [INFO ] Computed 30 place invariants in 0 ms
[2021-05-09 14:12:10] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 60/62 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2021-05-09 14:12:10] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2021-05-09 14:12:10] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-09 14:12:10] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/62 places, 255/255 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1))]
Running random walk in product with property : Dekker-PT-015-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s23 1) (EQ s27 1) (EQ s56 1)), p0:(OR (NEQ s23 1) (NEQ s27 1) (NEQ s56 1)), p1:(AND (EQ s11 1) (EQ s23 1) (EQ s40 1) (EQ s5 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3160 reset in 407 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA Dekker-PT-015-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-15 finished in 789 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620569534205

--------------------
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="Dekker-PT-015"
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-015, 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 r064-tall-162038397700765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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