fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331100085
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-14a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
483.724 37960.00 77568.00 491.50 FFFFFTFFTFFFFFTT 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.r102-smll-162075331100085.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 FlexibleBarrier-PT-14a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331100085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 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 169K 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 FlexibleBarrier-PT-14a-00
FORMULA_NAME FlexibleBarrier-PT-14a-01
FORMULA_NAME FlexibleBarrier-PT-14a-02
FORMULA_NAME FlexibleBarrier-PT-14a-03
FORMULA_NAME FlexibleBarrier-PT-14a-04
FORMULA_NAME FlexibleBarrier-PT-14a-05
FORMULA_NAME FlexibleBarrier-PT-14a-06
FORMULA_NAME FlexibleBarrier-PT-14a-07
FORMULA_NAME FlexibleBarrier-PT-14a-08
FORMULA_NAME FlexibleBarrier-PT-14a-09
FORMULA_NAME FlexibleBarrier-PT-14a-10
FORMULA_NAME FlexibleBarrier-PT-14a-11
FORMULA_NAME FlexibleBarrier-PT-14a-12
FORMULA_NAME FlexibleBarrier-PT-14a-13
FORMULA_NAME FlexibleBarrier-PT-14a-14
FORMULA_NAME FlexibleBarrier-PT-14a-15

=== Now, execution of the tool begins

BK_START 1621143284504

Running Version 0
[2021-05-16 05:34:47] [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-16 05:34:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 05:34:48] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2021-05-16 05:34:48] [INFO ] Transformed 171 places.
[2021-05-16 05:34:48] [INFO ] Transformed 578 transitions.
[2021-05-16 05:34:48] [INFO ] Found NUPN structural information;
[2021-05-16 05:34:48] [INFO ] Parsed PT model containing 171 places and 578 transitions in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 05:34:48] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 50 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:48] [INFO ] Computed 16 place invariants in 29 ms
[2021-05-16 05:34:48] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:49] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-16 05:34:49] [INFO ] State equation strengthened by 253 read => feed constraints.
[2021-05-16 05:34:49] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:49] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-16 05:34:49] [INFO ] Dead Transitions using invariants and state equation in 391 ms returned []
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 394/408 transitions.
[2021-05-16 05:34:50] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-16 05:34:50] [INFO ] Flatten gal took : 127 ms
FORMULA FlexibleBarrier-PT-14a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 05:34:50] [INFO ] Flatten gal took : 68 ms
[2021-05-16 05:34:50] [INFO ] Input system was already deterministic with 394 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=207 ) properties (out of 23) seen :21
Running SMT prover for 2 properties.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:51] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-16 05:34:51] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned unsat
[2021-05-16 05:34:51] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA FlexibleBarrier-PT-14a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 7 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 130 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 6 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 109 transition count 296
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 130 place count 109 transition count 251
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 109 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 107 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 107 transition count 249
Applied a total of 136 rules in 180 ms. Remains 107 /171 variables (removed 64) and now considering 249/394 (removed 145) transitions.
[2021-05-16 05:34:51] [INFO ] Flow matrix only has 152 transitions (discarded 97 similar events)
// Phase 1: matrix 152 rows 107 cols
[2021-05-16 05:34:51] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2021-05-16 05:34:51] [INFO ] Flow matrix only has 152 transitions (discarded 97 similar events)
// Phase 1: matrix 152 rows 107 cols
[2021-05-16 05:34:51] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-16 05:34:51] [INFO ] State equation strengthened by 119 read => feed constraints.
[2021-05-16 05:34:52] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2021-05-16 05:34:52] [INFO ] Redundant transitions in 141 ms returned [75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138]
Found 64 redundant transitions using SMT.
Drop transitions removed 64 transitions
Redundant transitions reduction (with SMT) removed 64 transitions :[138, 137, 136, 135, 134, 133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75]
[2021-05-16 05:34:52] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 107 cols
[2021-05-16 05:34:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:52] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Starting structural reductions, iteration 1 : 107/171 places, 185/394 transitions.
Applied a total of 0 rules in 16 ms. Remains 107 /107 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2021-05-16 05:34:52] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-16 05:34:52] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 107 cols
[2021-05-16 05:34:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:52] [INFO ] Dead Transitions using invariants and state equation in 227 ms returned []
Finished structural reductions, in 2 iterations. Remains : 107/171 places, 185/394 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), 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 s18 1) (EQ s81 1) (EQ s105 1) (OR (EQ s34 0) (EQ s106 0))), p0:(AND (EQ s9 1) (EQ s89 1) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-14a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-00 finished in 1555 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 130 edges and 171 vertex of which 30 / 171 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 109 transition count 296
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 130 place count 109 transition count 251
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 109 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 107 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 107 transition count 249
Applied a total of 136 rules in 86 ms. Remains 107 /171 variables (removed 64) and now considering 249/394 (removed 145) transitions.
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 152 transitions (discarded 97 similar events)
// Phase 1: matrix 152 rows 107 cols
[2021-05-16 05:34:53] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-16 05:34:53] [INFO ] Implicit Places using invariants in 159 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
[2021-05-16 05:34:53] [INFO ] Redundant transitions in 138 ms returned [75, 76, 77, 78, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162]
Found 64 redundant transitions using SMT.
Drop transitions removed 64 transitions
Redundant transitions reduction (with SMT) removed 64 transitions :[162, 161, 160, 159, 158, 157, 156, 155, 154, 153, 152, 151, 150, 149, 148, 147, 146, 145, 144, 143, 142, 141, 140, 139, 126, 125, 124, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 78, 77, 76, 75]
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 146 transitions (discarded 39 similar events)
// Phase 1: matrix 146 rows 106 cols
[2021-05-16 05:34:53] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-16 05:34:53] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Starting structural reductions, iteration 1 : 106/171 places, 185/394 transitions.
Graph (trivial) has 136 edges and 106 vertex of which 30 / 106 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 86 transition count 131
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 72 transition count 131
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 72 transition count 117
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 58 transition count 117
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 93 place count 40 transition count 99
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 40 transition count 87
Applied a total of 105 rules in 29 ms. Remains 40 /106 variables (removed 66) and now considering 87/185 (removed 98) transitions.
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 54 transitions (discarded 33 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-16 05:34:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:34:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 54 transitions (discarded 33 similar events)
// Phase 1: matrix 54 rows 40 cols
[2021-05-16 05:34:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:34:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2021-05-16 05:34:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 40/171 places, 87/394 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-02 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}]], initial=1, aps=[p0:(AND (OR (NEQ s15 1) (NEQ s18 1) (NEQ s39 1)) (OR (EQ s9 0) (EQ s36 0) (EQ s39 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-02 finished in 821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 132 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 106 transition count 274
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 0 with 66 rules applied. Total rules applied 149 place count 106 transition count 208
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 151 place count 106 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 152 place count 105 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 153 place count 105 transition count 207
Applied a total of 153 rules in 63 ms. Remains 105 /171 variables (removed 66) and now considering 207/394 (removed 187) transitions.
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 137 transitions (discarded 70 similar events)
// Phase 1: matrix 137 rows 105 cols
[2021-05-16 05:34:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2021-05-16 05:34:53] [INFO ] Flow matrix only has 137 transitions (discarded 70 similar events)
// Phase 1: matrix 137 rows 105 cols
[2021-05-16 05:34:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:54] [INFO ] State equation strengthened by 105 read => feed constraints.
[2021-05-16 05:34:54] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2021-05-16 05:34:54] [INFO ] Redundant transitions in 46 ms returned [75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122]
Found 36 redundant transitions using SMT.
Drop transitions removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions :[122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75]
[2021-05-16 05:34:54] [INFO ] Flow matrix only has 136 transitions (discarded 35 similar events)
// Phase 1: matrix 136 rows 105 cols
[2021-05-16 05:34:54] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:54] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 105/171 places, 171/394 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2021-05-16 05:34:54] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-16 05:34:54] [INFO ] Flow matrix only has 136 transitions (discarded 35 similar events)
// Phase 1: matrix 136 rows 105 cols
[2021-05-16 05:34:54] [INFO ] Computed 16 place invariants in 8 ms
[2021-05-16 05:34:54] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 105/171 places, 171/394 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s33 1) (NEQ s104 1)), p2:(OR (NEQ s49 1) (NEQ s104 1)), p1:(OR (NEQ s87 1) (NEQ s94 1) (NEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1012 steps with 0 reset in 34 ms.
FORMULA FlexibleBarrier-PT-14a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-03 finished in 784 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(!p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:54] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-16 05:34:54] [INFO ] Implicit Places using invariants in 179 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:54] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-16 05:34:55] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Starting structural reductions, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:55] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-16 05:34:55] [INFO ] Dead Transitions using invariants and state equation in 318 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (NEQ s71 1) (NEQ s96 1) (NEQ s169 1)), p1:(OR (NEQ s144 1) (NEQ s155 1) (NEQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2564 reset in 1068 ms.
Stack based approach found an accepted trace after 162 steps with 6 reset with depth 106 and stack size 104 in 3 ms.
FORMULA FlexibleBarrier-PT-14a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-04 finished in 2071 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:56] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-16 05:34:56] [INFO ] Implicit Places using invariants in 120 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:56] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-16 05:34:57] [INFO ] Dead Transitions using invariants and state equation in 295 ms returned []
Starting structural reductions, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:57] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-16 05:34:57] [INFO ] Dead Transitions using invariants and state equation in 328 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s101 0), p1:(AND (NEQ s18 0) (NEQ s169 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 228 reset in 766 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA FlexibleBarrier-PT-14a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-06 finished in 1644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 5 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 85 place count 105 transition count 273
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 0 with 66 rules applied. Total rules applied 151 place count 105 transition count 207
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 105 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 104 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 104 transition count 206
Applied a total of 154 rules in 59 ms. Remains 104 /171 variables (removed 67) and now considering 206/394 (removed 188) transitions.
[2021-05-16 05:34:58] [INFO ] Flow matrix only has 136 transitions (discarded 70 similar events)
// Phase 1: matrix 136 rows 104 cols
[2021-05-16 05:34:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:58] [INFO ] Implicit Places using invariants in 149 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
[2021-05-16 05:34:58] [INFO ] Redundant transitions in 61 ms returned [73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108]
Found 36 redundant transitions using SMT.
Drop transitions removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions :[108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 73]
[2021-05-16 05:34:58] [INFO ] Flow matrix only has 135 transitions (discarded 35 similar events)
// Phase 1: matrix 135 rows 103 cols
[2021-05-16 05:34:58] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-16 05:34:58] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Starting structural reductions, iteration 1 : 103/171 places, 170/394 transitions.
Graph (trivial) has 138 edges and 103 vertex of which 36 / 103 are part of one of the 12 SCC in 7 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 79 transition count 108
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 65 transition count 108
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 65 transition count 94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 51 transition count 94
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 89 place count 35 transition count 78
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 35 transition count 65
Applied a total of 102 rules in 22 ms. Remains 35 /103 variables (removed 68) and now considering 65/170 (removed 105) transitions.
[2021-05-16 05:34:58] [INFO ] Flow matrix only has 40 transitions (discarded 25 similar events)
// Phase 1: matrix 40 rows 35 cols
[2021-05-16 05:34:58] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:34:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-16 05:34:58] [INFO ] Flow matrix only has 40 transitions (discarded 25 similar events)
// Phase 1: matrix 40 rows 35 cols
[2021-05-16 05:34:58] [INFO ] Computed 15 place invariants in 5 ms
[2021-05-16 05:34:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-16 05:34:58] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 35/171 places, 65/394 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14a-07 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:(OR (NEQ s5 1) (NEQ s30 1) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-07 finished in 663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(p0))&&(F(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:34:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:34:59] [INFO ] Implicit Places using invariants in 116 ms returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:59] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-16 05:34:59] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Starting structural reductions, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:34:59] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:34:59] [INFO ] Dead Transitions using invariants and state equation in 219 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-14a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (NEQ s120 1) (NEQ s155 1) (NEQ s169 1)), p2:(OR (NEQ s84 1) (NEQ s107 1) (NEQ s169 1)), p0:(NEQ s77 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1249 ms.
Product exploration explored 100000 steps with 25000 reset in 899 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 1082 ms.
Product exploration explored 100000 steps with 25000 reset in 875 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Support contains 6 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 170/170 places, 394/394 transitions.
Graph (trivial) has 198 edges and 170 vertex of which 88 / 170 are part of one of the 14 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 96 transition count 264
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 19 place count 96 transition count 264
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 96 transition count 264
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 96 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 94 transition count 264
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 94 transition count 264
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 58 place count 94 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 90 transition count 292
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 90 transition count 292
Deduced a syphon composed of 47 places in 1 ms
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 1 with 80 rules applied. Total rules applied 146 place count 90 transition count 212
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 78 transition count 198
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 78 transition count 198
Deduced a syphon composed of 35 places in 1 ms
Applied a total of 170 rules in 54 ms. Remains 78 /170 variables (removed 92) and now considering 198/394 (removed 196) transitions.
[2021-05-16 05:35:04] [INFO ] Redundant transitions in 120 ms returned [50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137]
Found 64 redundant transitions using SMT.
Drop transitions removed 64 transitions
Redundant transitions reduction (with SMT) removed 64 transitions :[137, 136, 135, 134, 133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 73, 72, 71, 70, 69, 68, 67, 66, 65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50]
[2021-05-16 05:35:05] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 78 cols
[2021-05-16 05:35:05] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:35:05] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 78/170 places, 134/394 transitions.
Deduced a syphon composed of 35 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2021-05-16 05:35:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 05:35:05] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 78 cols
[2021-05-16 05:35:05] [INFO ] Computed 15 place invariants in 7 ms
[2021-05-16 05:35:05] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 2 iterations. Remains : 78/170 places, 134/394 transitions.
Product exploration explored 100000 steps with 25000 reset in 1239 ms.
Product exploration explored 100000 steps with 25000 reset in 1295 ms.
[2021-05-16 05:35:07] [INFO ] Flatten gal took : 32 ms
[2021-05-16 05:35:07] [INFO ] Flatten gal took : 29 ms
[2021-05-16 05:35:07] [INFO ] Time to serialize gal into /tmp/LTL8205436209083663671.gal : 13 ms
[2021-05-16 05:35:07] [INFO ] Time to serialize properties into /tmp/LTL12620042383404302299.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/LTL8205436209083663671.gal, -t, CGAL, -LTL, /tmp/LTL12620042383404302299.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/LTL8205436209083663671.gal -t CGAL -LTL /tmp/LTL12620042383404302299.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(p77==0)")))&&((F("(((p120==0)||(p155==0))||(p169==0))"))||(G("(((p84==0)||(p107==0))||(p169==0))"))))))
Formula 0 simplified : !X(XX"(p77==0)" & (F"(((p120==0)||(p155==0))||(p169==0))" | G"(((p84==0)||(p107==0))||(p169==0))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
743 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,7.50545,153716,1,0,8,879416,24,0,5714,240937,17
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-14a-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-14a-08 finished in 17096 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&G((G(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 171 cols
[2021-05-16 05:35:16] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-16 05:35:16] [INFO ] Implicit Places using invariants in 229 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:35:16] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-16 05:35:16] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Starting structural reductions, iteration 1 : 170/171 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 170 cols
[2021-05-16 05:35:16] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-16 05:35:17] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/171 places, 394/394 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s139 1) (NEQ s169 1) (NEQ s11 1)), p2:(OR (NEQ s139 1) (NEQ s169 1)), p0:(NEQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 352 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-14a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14a-12 finished in 1301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G((F(p2)||(p3 U (p4||G(p3)))||p1))||(p5&&F(p2))||(p5&&(p3 U (p4||G(p3))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 130 edges and 171 vertex of which 33 / 171 are part of one of the 11 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 108 transition count 286
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 138 place count 108 transition count 231
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 108 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 107 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 107 transition count 230
Applied a total of 141 rules in 43 ms. Remains 107 /171 variables (removed 64) and now considering 230/394 (removed 164) transitions.
[2021-05-16 05:35:17] [INFO ] Flow matrix only has 145 transitions (discarded 85 similar events)
// Phase 1: matrix 145 rows 107 cols
[2021-05-16 05:35:17] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-16 05:35:17] [INFO ] Implicit Places using invariants in 162 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
[2021-05-16 05:35:17] [INFO ] Redundant transitions in 94 ms returned [76, 77, 78, 79, 80, 81, 82, 83, 84, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions :[144, 143, 142, 141, 140, 139, 138, 137, 136, 135, 134, 133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 84, 83, 82, 81, 80, 79, 78, 77, 76]
[2021-05-16 05:35:17] [INFO ] Flow matrix only has 143 transitions (discarded 42 similar events)
// Phase 1: matrix 143 rows 106 cols
[2021-05-16 05:35:17] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-16 05:35:17] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Starting structural reductions, iteration 1 : 106/171 places, 185/394 transitions.
Graph (trivial) has 136 edges and 106 vertex of which 33 / 106 are part of one of the 11 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 127
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 70 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 29 place count 70 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 57 place count 56 transition count 113
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 91 place count 39 transition count 96
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 39 transition count 84
Applied a total of 103 rules in 12 ms. Remains 39 /106 variables (removed 67) and now considering 84/185 (removed 101) transitions.
[2021-05-16 05:35:17] [INFO ] Flow matrix only has 50 transitions (discarded 34 similar events)
// Phase 1: matrix 50 rows 39 cols
[2021-05-16 05:35:17] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-16 05:35:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2021-05-16 05:35:17] [INFO ] Flow matrix only has 50 transitions (discarded 34 similar events)
// Phase 1: matrix 50 rows 39 cols
[2021-05-16 05:35:17] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-16 05:35:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-16 05:35:17] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 39/171 places, 84/394 transitions.
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Running random walk in product with property : FlexibleBarrier-PT-14a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p2) p1 (NOT p5) (NOT p0)) (AND (NOT p2) (NOT p5) (NOT p0) p4)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p5) (NOT p0) (NOT p4)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) p1 (NOT p0) (NOT p4)) (AND (NOT p2) p1 (NOT p5) (NOT p0)) (AND (NOT p2) (NOT p5) (NOT p0) p4)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p5) (NOT p0) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 p1 p5 (NOT p0) (NOT p4)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) p5 (NOT p0) (NOT p4)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p5) (NOT p0) p4), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p5) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p3 p5 (NOT p0) (NOT p4)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3 p1 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s16 1), p3:(OR (NEQ s11 1) (NEQ s18 1) (NEQ s38 1)), p0:(AND (OR (NEQ s17 1) (NEQ s31 1) (NEQ s38 1)) (OR (NEQ s17 1) (NEQ s31 1) (NEQ s38 1))), p4:(AND (NEQ s16 1) (OR (NEQ s11 1) (NEQ s18 1) (NEQ s38 1))), p1:(OR (NEQ s17 1) (NEQ s31 1) (NEQ s38 1)), p5:(OR (NEQ s17 1) (NEQ s31 1) (NEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 503 ms.
Product exploration explored 100000 steps with 0 reset in 666 ms.
Knowledge obtained : [p2, p3, p0, p4, p1, p5]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 516 ms.
[2021-05-16 05:35:21] [INFO ] Flatten gal took : 12 ms
[2021-05-16 05:35:21] [INFO ] Flatten gal took : 9 ms
[2021-05-16 05:35:21] [INFO ] Time to serialize gal into /tmp/LTL11582190965109510627.gal : 2 ms
[2021-05-16 05:35:21] [INFO ] Time to serialize properties into /tmp/LTL17802548721390447283.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/LTL11582190965109510627.gal, -t, CGAL, -LTL, /tmp/LTL17802548721390447283.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/LTL11582190965109510627.gal -t CGAL -LTL /tmp/LTL17802548721390447283.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((((G((("(((p71!=1)||(p132!=1))||(p169!=1))")||(F("(p70!=1)")))||(("(((p59!=1)||(p72!=1))||(p169!=1))")U(("((p70!=1)&&(((p59!=1)||(p72!=1))||(p169!=1)))")||(G("(((p59!=1)||(p72!=1))||(p169!=1))"))))))||("(((p71!=1)||(p132!=1))||(p169!=1))"))||((F("(p70!=1)"))&&("(((p71!=1)||(p132!=1))||(p169!=1))")))||((("(((p59!=1)||(p72!=1))||(p169!=1))")U(("((p70!=1)&&(((p59!=1)||(p72!=1))||(p169!=1)))")||(G("(((p59!=1)||(p72!=1))||(p169!=1))"))))&&("(((p71!=1)||(p132!=1))||(p169!=1))"))))))
Formula 0 simplified : !GF("(((p71!=1)||(p132!=1))||(p169!=1))" | G("(((p71!=1)||(p132!=1))||(p169!=1))" | F"(p70!=1)" | ("(((p59!=1)||(p72!=1))||(p169!=1))" U ("((p70!=1)&&(((p59!=1)||(p72!=1))||(p169!=1)))" | G"(((p59!=1)||(p72!=1))||(p169!=1))"))) | ("(((p71!=1)||(p132!=1))||(p169!=1))" & F"(p70!=1)") | ("(((p71!=1)||(p132!=1))||(p169!=1))" & ("(((p59!=1)||(p72!=1))||(p169!=1))" U ("((p70!=1)&&(((p59!=1)||(p72!=1))||(p169!=1)))" | G"(((p59!=1)||(p72!=1))||(p169!=1))"))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.072052,19348,1,0,6,6834,37,0,1229,2400,23
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-14a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FlexibleBarrier-PT-14a-15 finished in 4114 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621143322464

--------------------
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="FlexibleBarrier-PT-14a"
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 FlexibleBarrier-PT-14a, 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 r102-smll-162075331100085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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