About the Execution of LTSMin+red for ShieldIIPt-PT-005A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
558.907 | 28704.00 | 49902.00 | 54.10 | F??TFFTFTFFFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716800243.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-005A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800243
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.1K Feb 25 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 27K Mar 5 18:23 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 ShieldIIPt-PT-005A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-005A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679435212142
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-005A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:46:55] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-21 21:46:55] [INFO ] Transformed 98 places.
[2023-03-21 21:46:55] [INFO ] Transformed 73 transitions.
[2023-03-21 21:46:55] [INFO ] Found NUPN structural information;
[2023-03-21 21:46:55] [INFO ] Parsed PT model containing 98 places and 73 transitions and 306 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 21 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2023-03-21 21:46:55] [INFO ] Computed 46 place invariants in 83 ms
[2023-03-21 21:46:56] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-21 21:46:56] [INFO ] Invariant cache hit.
[2023-03-21 21:46:56] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-03-21 21:46:56] [INFO ] Invariant cache hit.
[2023-03-21 21:46:57] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1478 ms. Remains : 98/98 places, 72/72 transitions.
Support contains 26 out of 98 places after structural reductions.
[2023-03-21 21:46:57] [INFO ] Flatten gal took : 44 ms
[2023-03-21 21:46:57] [INFO ] Flatten gal took : 12 ms
[2023-03-21 21:46:57] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 1369 steps, including 0 resets, run visited all 17 properties in 80 ms. (steps per millisecond=17 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:46:57] [INFO ] Invariant cache hit.
[2023-03-21 21:46:57] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-21 21:46:57] [INFO ] Invariant cache hit.
[2023-03-21 21:46:58] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-21 21:46:58] [INFO ] Invariant cache hit.
[2023-03-21 21:46:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 982 ms. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-00 automaton TGBA Formula[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 s78 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-00 finished in 1420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0) U p1))))'
Support contains 1 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 71
Applied a total of 2 rules in 12 ms. Remains 97 /98 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 97 cols
[2023-03-21 21:46:59] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 21:46:59] [INFO ] Implicit Places using invariants in 161 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/98 places, 71/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 96 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 70
Applied a total of 2 rules in 9 ms. Remains 95 /96 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 95 cols
[2023-03-21 21:46:59] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 21:46:59] [INFO ] Implicit Places using invariants in 129 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/98 places, 70/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 93 transition count 69
Applied a total of 2 rules in 6 ms. Remains 93 /94 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 93 cols
[2023-03-21 21:46:59] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-21 21:46:59] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-21 21:46:59] [INFO ] Invariant cache hit.
[2023-03-21 21:46:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 93/98 places, 69/72 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 784 ms. Remains : 93/98 places, 69/72 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s85 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 19132 reset in 371 ms.
Product exploration explored 100000 steps with 19219 reset in 351 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
[2023-03-21 21:47:01] [INFO ] Invariant cache hit.
[2023-03-21 21:47:01] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2023-03-21 21:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:47:01] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-21 21:47:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:47:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-21 21:47:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:47:02] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-21 21:47:02] [INFO ] Computed and/alt/rep : 68/240/68 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 21:47:02] [INFO ] Added : 11 causal constraints over 4 iterations in 61 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-21 21:47:02] [INFO ] Invariant cache hit.
[2023-03-21 21:47:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-21 21:47:02] [INFO ] Invariant cache hit.
[2023-03-21 21:47:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-21 21:47:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:47:02] [INFO ] Invariant cache hit.
[2023-03-21 21:47:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 93/93 places, 69/69 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1)]
[2023-03-21 21:47:03] [INFO ] Invariant cache hit.
[2023-03-21 21:47:03] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-21 21:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:47:03] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-21 21:47:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:47:03] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-21 21:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:47:03] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-21 21:47:03] [INFO ] Computed and/alt/rep : 68/240/68 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 21:47:03] [INFO ] Added : 11 causal constraints over 4 iterations in 129 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18980 reset in 226 ms.
Product exploration explored 100000 steps with 19074 reset in 197 ms.
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 69/69 transitions.
Applied a total of 0 rules in 17 ms. Remains 93 /93 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-21 21:47:04] [INFO ] Invariant cache hit.
[2023-03-21 21:47:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-21 21:47:04] [INFO ] Invariant cache hit.
[2023-03-21 21:47:04] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-21 21:47:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:47:04] [INFO ] Invariant cache hit.
[2023-03-21 21:47:04] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 592 ms. Remains : 93/93 places, 69/69 transitions.
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-01 finished in 5816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0))||G(p1)))))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 15 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2023-03-21 21:47:04] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 21:47:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-21 21:47:05] [INFO ] Invariant cache hit.
[2023-03-21 21:47:05] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-21 21:47:05] [INFO ] Invariant cache hit.
[2023-03-21 21:47:05] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s60 0) (EQ s62 1)), p0:(OR (EQ s37 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19977 reset in 201 ms.
Product exploration explored 100000 steps with 20038 reset in 175 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 305 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Finished random walk after 3701 steps, including 1 resets, run visited all 6 properties in 36 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 634 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 525 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:47:08] [INFO ] Invariant cache hit.
[2023-03-21 21:47:08] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-21 21:47:08] [INFO ] Invariant cache hit.
[2023-03-21 21:47:09] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-21 21:47:09] [INFO ] Invariant cache hit.
[2023-03-21 21:47:09] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 98/98 places, 72/72 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 393 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 496 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Finished random walk after 1236 steps, including 0 resets, run visited all 6 properties in 13 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 484 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 515 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 19998 reset in 220 ms.
Product exploration explored 100000 steps with 20029 reset in 181 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 98 transition count 72
Deduced a syphon composed of 1 places in 4 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 34 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:47:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 72 rows 98 cols
[2023-03-21 21:47:13] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-21 21:47:13] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 72/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 98/98 places, 72/72 transitions.
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2023-03-21 21:47:13] [INFO ] Computed 46 place invariants in 0 ms
[2023-03-21 21:47:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-21 21:47:13] [INFO ] Invariant cache hit.
[2023-03-21 21:47:13] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-21 21:47:13] [INFO ] Invariant cache hit.
[2023-03-21 21:47:13] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 98/98 places, 72/72 transitions.
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-02 finished in 8685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:47:13] [INFO ] Invariant cache hit.
[2023-03-21 21:47:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-21 21:47:13] [INFO ] Invariant cache hit.
[2023-03-21 21:47:13] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-21 21:47:13] [INFO ] Invariant cache hit.
[2023-03-21 21:47:13] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-04 automaton TGBA Formula[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:(AND (EQ s21 0) (EQ s39 1)), p1:(OR (EQ s39 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 223 reset in 252 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-04 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:47:14] [INFO ] Invariant cache hit.
[2023-03-21 21:47:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 21:47:14] [INFO ] Invariant cache hit.
[2023-03-21 21:47:15] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-21 21:47:15] [INFO ] Invariant cache hit.
[2023-03-21 21:47:15] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 959 ms. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (NEQ s8 0) (NEQ s61 1)), p0:(AND (EQ s62 0) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1191 reset in 182 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-05 finished in 1353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 95 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 95 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 94 transition count 69
Applied a total of 5 rules in 6 ms. Remains 94 /98 variables (removed 4) and now considering 69/72 (removed 3) transitions.
// Phase 1: matrix 69 rows 94 cols
[2023-03-21 21:47:15] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 21:47:15] [INFO ] Implicit Places using invariants in 93 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/98 places, 69/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 68
Applied a total of 2 rules in 3 ms. Remains 92 /93 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 92 cols
[2023-03-21 21:47:15] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-21 21:47:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-21 21:47:16] [INFO ] Invariant cache hit.
[2023-03-21 21:47:16] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/98 places, 68/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 92/98 places, 68/72 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s85 0) (EQ s72 0) (EQ s83 1)) (AND (EQ s72 0) (EQ s83 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 723 reset in 186 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-07 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 97 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 95 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 93 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 68
Applied a total of 8 rules in 19 ms. Remains 92 /98 variables (removed 6) and now considering 68/72 (removed 4) transitions.
// Phase 1: matrix 68 rows 92 cols
[2023-03-21 21:47:16] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-21 21:47:16] [INFO ] Implicit Places using invariants in 118 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/98 places, 68/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 67
Applied a total of 2 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 90 cols
[2023-03-21 21:47:16] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-21 21:47:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-21 21:47:16] [INFO ] Invariant cache hit.
[2023-03-21 21:47:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/98 places, 67/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 90/98 places, 67/72 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s15 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 207 ms.
Stack based approach found an accepted trace after 200 steps with 0 reset with depth 201 and stack size 194 in 1 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-09 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 98 transition count 71
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 70
Applied a total of 4 rules in 5 ms. Remains 96 /98 variables (removed 2) and now considering 70/72 (removed 2) transitions.
// Phase 1: matrix 70 rows 96 cols
[2023-03-21 21:47:16] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 21:47:17] [INFO ] Implicit Places using invariants in 113 ms returned [88, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 70/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 94 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 93 transition count 69
Applied a total of 2 rules in 4 ms. Remains 93 /94 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 93 cols
[2023-03-21 21:47:17] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-21 21:47:17] [INFO ] Implicit Places using invariants in 127 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/98 places, 69/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 91 transition count 68
Applied a total of 2 rules in 4 ms. Remains 91 /92 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 91 cols
[2023-03-21 21:47:17] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-21 21:47:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-21 21:47:17] [INFO ] Invariant cache hit.
[2023-03-21 21:47:17] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 91/98 places, 68/72 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 513 ms. Remains : 91/98 places, 68/72 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s55 0) (EQ s38 1)), p1:(AND (EQ s5 0) (EQ s43 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 250 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-10 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))||G(p2)))'
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 98 cols
[2023-03-21 21:47:17] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 21:47:17] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-21 21:47:17] [INFO ] Invariant cache hit.
[2023-03-21 21:47:18] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-21 21:47:18] [INFO ] Invariant cache hit.
[2023-03-21 21:47:18] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 98/98 places, 72/72 transitions.
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s74 0), p1:(AND (EQ s70 0) (EQ s60 1)), p2:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 226 ms.
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-005A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-12 finished in 1478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 72/72 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 98 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 71
Applied a total of 2 rules in 9 ms. Remains 97 /98 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 97 cols
[2023-03-21 21:47:19] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 21:47:19] [INFO ] Implicit Places using invariants in 138 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/98 places, 71/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 96/98 places, 71/72 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s88 0) (NEQ s95 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 1585 reset in 234 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 38 and stack size 38 in 1 ms.
FORMULA ShieldIIPt-PT-005A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005A-LTLCardinality-14 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0))||G(p1)))))'
[2023-03-21 21:47:20] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:47:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 21:47:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 72 transitions and 304 arcs took 1 ms.
Total runtime 24924 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1260/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1260/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-005A-LTLCardinality-01
Could not compute solution for formula : ShieldIIPt-PT-005A-LTLCardinality-02
BK_STOP 1679435240846
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-005A-LTLCardinality-01
ltl formula formula --ltl=/tmp/1260/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 98 places, 72 transitions and 304 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1260/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1260/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1260/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1260/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x561d3137b3f4]
1: pnml2lts-mc(+0xa2496) [0x561d3137b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fb6aa1f4140]
3: pnml2lts-mc(+0x405be5) [0x561d316debe5]
4: pnml2lts-mc(+0x16b3f9) [0x561d314443f9]
5: pnml2lts-mc(+0x164ac4) [0x561d3143dac4]
6: pnml2lts-mc(+0x272e0a) [0x561d3154be0a]
7: pnml2lts-mc(+0xb61f0) [0x561d3138f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fb6aa0474d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fb6aa04767a]
10: pnml2lts-mc(+0xa1581) [0x561d3137a581]
11: pnml2lts-mc(+0xa1910) [0x561d3137a910]
12: pnml2lts-mc(+0xa32a2) [0x561d3137c2a2]
13: pnml2lts-mc(+0xa50f4) [0x561d3137e0f4]
14: pnml2lts-mc(+0xa516b) [0x561d3137e16b]
15: pnml2lts-mc(+0x3f34b3) [0x561d316cc4b3]
16: pnml2lts-mc(+0x7c63d) [0x561d3135563d]
17: pnml2lts-mc(+0x67d86) [0x561d31340d86]
18: pnml2lts-mc(+0x60a8a) [0x561d31339a8a]
19: pnml2lts-mc(+0x5eb15) [0x561d31337b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fb6aa02fd0a]
21: pnml2lts-mc(+0x6075e) [0x561d3133975e]
ltl formula name ShieldIIPt-PT-005A-LTLCardinality-02
ltl formula formula --ltl=/tmp/1260/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 98 places, 72 transitions and 304 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1260/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1260/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1260/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1260/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="ShieldIIPt-PT-005A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-005A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716800243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005A.tgz
mv ShieldIIPt-PT-005A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;