fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r425-tajo-167905977700108
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldRVs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
502.647 37193.00 61550.00 103.90 FFTFTFF??FFFFF?F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977700108.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 244K 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 ShieldRVs-PT-020B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679298770612

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:52:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-20 07:52:52] [INFO ] Transformed 803 places.
[2023-03-20 07:52:52] [INFO ] Transformed 903 transitions.
[2023-03-20 07:52:52] [INFO ] Found NUPN structural information;
[2023-03-20 07:52:52] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-020B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 669 transition count 769
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 669 transition count 769
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 668 transition count 768
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 668 transition count 768
Applied a total of 270 rules in 125 ms. Remains 668 /803 variables (removed 135) and now considering 768/903 (removed 135) transitions.
// Phase 1: matrix 768 rows 668 cols
[2023-03-20 07:52:52] [INFO ] Computed 81 place invariants in 22 ms
[2023-03-20 07:52:52] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-20 07:52:52] [INFO ] Invariant cache hit.
[2023-03-20 07:52:53] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-20 07:52:53] [INFO ] Invariant cache hit.
[2023-03-20 07:52:53] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 668/803 places, 768/903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1339 ms. Remains : 668/803 places, 768/903 transitions.
Support contains 46 out of 668 places after structural reductions.
[2023-03-20 07:52:54] [INFO ] Flatten gal took : 83 ms
[2023-03-20 07:52:54] [INFO ] Flatten gal took : 50 ms
[2023-03-20 07:52:54] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 44 out of 668 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 07:52:54] [INFO ] Invariant cache hit.
[2023-03-20 07:52:54] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:52:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-20 07:52:55] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:52:55] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 10 ms to minimize.
[2023-03-20 07:52:55] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2023-03-20 07:52:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:52:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1194 ms
[2023-03-20 07:52:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:52:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:52:57] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:52:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-20 07:52:57] [INFO ] After 2004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 07:52:57] [INFO ] After 2311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 124 ms.
Support contains 9 out of 668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 668/668 places, 768/768 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 668 transition count 687
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 587 transition count 687
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 587 transition count 587
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 487 transition count 587
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 368 place count 481 transition count 581
Iterating global reduction 2 with 6 rules applied. Total rules applied 374 place count 481 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 374 place count 481 transition count 580
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 480 transition count 580
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Deduced a syphon composed of 197 places in 3 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 770 place count 283 transition count 383
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 811 place count 283 transition count 383
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 812 place count 282 transition count 382
Applied a total of 812 rules in 133 ms. Remains 282 /668 variables (removed 386) and now considering 382/768 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 282/668 places, 382/768 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Finished Best-First random walk after 1045 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=209 )
Computed a total of 162 stabilizing places and 162 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' '!(F(G(p0)))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 667 transition count 687
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 587 transition count 687
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 587 transition count 587
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 487 transition count 587
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 366 place count 481 transition count 581
Iterating global reduction 2 with 6 rules applied. Total rules applied 372 place count 481 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 372 place count 481 transition count 580
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 374 place count 480 transition count 580
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 3 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 766 place count 284 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 768 place count 282 transition count 382
Applied a total of 768 rules in 103 ms. Remains 282 /668 variables (removed 386) and now considering 382/768 (removed 386) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:52:58] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:52:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-20 07:52:58] [INFO ] Invariant cache hit.
[2023-03-20 07:52:58] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-20 07:52:58] [INFO ] Redundant transitions in 73 ms returned [381]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2023-03-20 07:52:58] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:52:58] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/668 places, 381/768 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 691 ms. Remains : 282/668 places, 381/768 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s159 1) (EQ s161 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-00 finished in 876 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(p0)))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 662 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 662 transition count 762
Applied a total of 12 rules in 37 ms. Remains 662 /668 variables (removed 6) and now considering 762/768 (removed 6) transitions.
// Phase 1: matrix 762 rows 662 cols
[2023-03-20 07:52:58] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 07:52:58] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-20 07:52:58] [INFO ] Invariant cache hit.
[2023-03-20 07:52:59] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-20 07:52:59] [INFO ] Invariant cache hit.
[2023-03-20 07:52:59] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/668 places, 762/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1124 ms. Remains : 662/668 places, 762/768 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s256 1) (EQ s260 1) (EQ s268 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-01 finished in 1211 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(F(p1))))))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 663 transition count 763
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 663 transition count 763
Applied a total of 10 rules in 21 ms. Remains 663 /668 variables (removed 5) and now considering 763/768 (removed 5) transitions.
// Phase 1: matrix 763 rows 663 cols
[2023-03-20 07:53:00] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-20 07:53:00] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-20 07:53:00] [INFO ] Invariant cache hit.
[2023-03-20 07:53:00] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-20 07:53:00] [INFO ] Invariant cache hit.
[2023-03-20 07:53:00] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/668 places, 763/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1001 ms. Remains : 663/668 places, 763/768 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s69 1) (EQ s80 1)), p0:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 880 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-03 finished in 1132 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(p0)||X(X((p1||X(F(p2)))))))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 662 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 662 transition count 762
Applied a total of 12 rules in 24 ms. Remains 662 /668 variables (removed 6) and now considering 762/768 (removed 6) transitions.
// Phase 1: matrix 762 rows 662 cols
[2023-03-20 07:53:01] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 07:53:01] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-20 07:53:01] [INFO ] Invariant cache hit.
[2023-03-20 07:53:01] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-20 07:53:01] [INFO ] Invariant cache hit.
[2023-03-20 07:53:02] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/668 places, 762/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1125 ms. Remains : 662/668 places, 762/768 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(EQ s26 0), p2:(AND (EQ s81 0) (EQ s26 0)), p0:(EQ s315 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 407 ms.
Product exploration explored 100000 steps with 33333 reset in 367 ms.
Computed a total of 159 stabilizing places and 159 stable transitions
Computed a total of 159 stabilizing places and 159 stable transitions
Detected a total of 159/662 stabilizing places and 159/762 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-020B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020B-LTLFireability-04 finished in 2267 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(F(((p0 U G(p1))||X(p2))))))'
Support contains 6 out of 668 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 662 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 662 transition count 762
Applied a total of 12 rules in 21 ms. Remains 662 /668 variables (removed 6) and now considering 762/768 (removed 6) transitions.
[2023-03-20 07:53:03] [INFO ] Invariant cache hit.
[2023-03-20 07:53:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 07:53:03] [INFO ] Invariant cache hit.
[2023-03-20 07:53:04] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2023-03-20 07:53:04] [INFO ] Invariant cache hit.
[2023-03-20 07:53:04] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/668 places, 762/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 662/668 places, 762/768 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s63 1) (EQ s85 1)), p2:(AND (EQ s605 1) (EQ s640 1) (EQ s660 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]]
Stuttering criterion allowed to conclude after 11154 steps with 33 reset in 42 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-05 finished in 1288 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(p1)&&p0)))'
Support contains 5 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 662 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 662 transition count 762
Applied a total of 12 rules in 23 ms. Remains 662 /668 variables (removed 6) and now considering 762/768 (removed 6) transitions.
[2023-03-20 07:53:04] [INFO ] Invariant cache hit.
[2023-03-20 07:53:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-20 07:53:04] [INFO ] Invariant cache hit.
[2023-03-20 07:53:05] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-20 07:53:05] [INFO ] Invariant cache hit.
[2023-03-20 07:53:05] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 662/668 places, 762/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1041 ms. Remains : 662/668 places, 762/768 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s541 0) (EQ s575 0) (EQ s597 0)), p0:(AND (EQ s101 1) (EQ s112 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-06 finished in 1154 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))||G((G(p1)||(p2&&G(p3))))))'
Support contains 3 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 667 transition count 686
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 586 transition count 686
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 162 place count 586 transition count 587
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 360 place count 487 transition count 587
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 365 place count 482 transition count 582
Iterating global reduction 2 with 5 rules applied. Total rules applied 370 place count 482 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 370 place count 482 transition count 581
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 372 place count 481 transition count 581
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 762 place count 286 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 764 place count 284 transition count 384
Applied a total of 764 rules in 62 ms. Remains 284 /668 variables (removed 384) and now considering 384/768 (removed 384) transitions.
// Phase 1: matrix 384 rows 284 cols
[2023-03-20 07:53:05] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-20 07:53:06] [INFO ] Invariant cache hit.
[2023-03-20 07:53:06] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-20 07:53:06] [INFO ] Redundant transitions in 62 ms returned [383]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 383 rows 284 cols
[2023-03-20 07:53:06] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 07:53:06] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/668 places, 383/768 transitions.
Applied a total of 0 rules in 28 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 661 ms. Remains : 284/668 places, 383/768 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s148 1), p3:(EQ s266 1), p0:(EQ s266 0), p1:(EQ s143 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3268 reset in 314 ms.
Product exploration explored 100000 steps with 3486 reset in 497 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/284 stabilizing places and 3/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT (AND p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))))), (X p0), (X (X (NOT (AND p2 p3)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT p1)), (X p1), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 18 factoid took 818 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT (AND p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))))), (X p0), (X (X (NOT (AND p2 p3)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT p1)), (X p1), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 721 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 284 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 : 284/284 places, 383/383 transitions.
Applied a total of 0 rules in 19 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:53:09] [INFO ] Invariant cache hit.
[2023-03-20 07:53:09] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 07:53:09] [INFO ] Invariant cache hit.
[2023-03-20 07:53:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-20 07:53:09] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 07:53:09] [INFO ] Invariant cache hit.
[2023-03-20 07:53:09] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 583 ms. Remains : 284/284 places, 383/383 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 43 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3371 reset in 271 ms.
Product exploration explored 100000 steps with 3511 reset in 314 ms.
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 383/383 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 281 transition count 380
Applied a total of 3 rules in 19 ms. Remains 281 /284 variables (removed 3) and now considering 380/383 (removed 3) transitions.
// Phase 1: matrix 380 rows 281 cols
[2023-03-20 07:53:10] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-20 07:53:10] [INFO ] Invariant cache hit.
[2023-03-20 07:53:11] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-20 07:53:11] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 07:53:11] [INFO ] Invariant cache hit.
[2023-03-20 07:53:11] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/284 places, 380/383 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 623 ms. Remains : 281/284 places, 380/383 transitions.
Treatment of property ShieldRVs-PT-020B-LTLFireability-07 finished in 5657 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)&&F(G(p1)))))'
Support contains 4 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 667 transition count 687
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 587 transition count 687
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 587 transition count 587
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 487 transition count 587
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 365 place count 482 transition count 582
Iterating global reduction 2 with 5 rules applied. Total rules applied 370 place count 482 transition count 582
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 762 place count 286 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 764 place count 284 transition count 384
Applied a total of 764 rules in 55 ms. Remains 284 /668 variables (removed 384) and now considering 384/768 (removed 384) transitions.
// Phase 1: matrix 384 rows 284 cols
[2023-03-20 07:53:11] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:11] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-20 07:53:11] [INFO ] Invariant cache hit.
[2023-03-20 07:53:11] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-20 07:53:12] [INFO ] Redundant transitions in 94 ms returned [383]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 383 rows 284 cols
[2023-03-20 07:53:12] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:12] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/668 places, 383/768 transitions.
Applied a total of 0 rules in 7 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 284/668 places, 383/768 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s70 0) (EQ s81 0)), p1:(NEQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 361 reset in 320 ms.
Product exploration explored 100000 steps with 362 reset in 361 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/284 stabilizing places and 2/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 7122 steps, including 25 resets, run visited all 2 properties in 42 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 383/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:53:13] [INFO ] Invariant cache hit.
[2023-03-20 07:53:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-20 07:53:13] [INFO ] Invariant cache hit.
[2023-03-20 07:53:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-20 07:53:14] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-20 07:53:14] [INFO ] Invariant cache hit.
[2023-03-20 07:53:14] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 576 ms. Remains : 284/284 places, 383/383 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/284 stabilizing places and 2/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1379 steps, including 4 resets, run visited all 2 properties in 6 ms. (steps per millisecond=229 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 364 reset in 286 ms.
Product exploration explored 100000 steps with 364 reset in 329 ms.
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 383/383 transitions.
Applied a total of 0 rules in 18 ms. Remains 284 /284 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:53:15] [INFO ] Invariant cache hit.
[2023-03-20 07:53:15] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 07:53:15] [INFO ] Invariant cache hit.
[2023-03-20 07:53:16] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-20 07:53:16] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-20 07:53:16] [INFO ] Invariant cache hit.
[2023-03-20 07:53:16] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 284/284 places, 383/383 transitions.
Treatment of property ShieldRVs-PT-020B-LTLFireability-08 finished in 5077 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(p0))'
Support contains 1 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 663 transition count 763
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 663 transition count 763
Applied a total of 10 rules in 27 ms. Remains 663 /668 variables (removed 5) and now considering 763/768 (removed 5) transitions.
// Phase 1: matrix 763 rows 663 cols
[2023-03-20 07:53:16] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 07:53:16] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-20 07:53:16] [INFO ] Invariant cache hit.
[2023-03-20 07:53:17] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-20 07:53:17] [INFO ] Invariant cache hit.
[2023-03-20 07:53:17] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/668 places, 763/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1166 ms. Remains : 663/668 places, 763/768 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-09 finished in 1252 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((p0||F(G(p1)))))'
Support contains 2 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 663 transition count 763
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 663 transition count 763
Applied a total of 10 rules in 20 ms. Remains 663 /668 variables (removed 5) and now considering 763/768 (removed 5) transitions.
// Phase 1: matrix 763 rows 663 cols
[2023-03-20 07:53:17] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 07:53:18] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-20 07:53:18] [INFO ] Invariant cache hit.
[2023-03-20 07:53:18] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-20 07:53:18] [INFO ] Invariant cache hit.
[2023-03-20 07:53:18] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/668 places, 763/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 663/668 places, 763/768 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s535 1), p1:(EQ s260 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 860 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-10 finished in 1140 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 1 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 667 transition count 686
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 586 transition count 686
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 586 transition count 586
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 486 transition count 586
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 368 place count 480 transition count 580
Iterating global reduction 2 with 6 rules applied. Total rules applied 374 place count 480 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 374 place count 480 transition count 579
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 479 transition count 579
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 768 place count 283 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 770 place count 281 transition count 381
Applied a total of 770 rules in 61 ms. Remains 281 /668 variables (removed 387) and now considering 381/768 (removed 387) transitions.
// Phase 1: matrix 381 rows 281 cols
[2023-03-20 07:53:19] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:19] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-20 07:53:19] [INFO ] Invariant cache hit.
[2023-03-20 07:53:19] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-20 07:53:19] [INFO ] Redundant transitions in 67 ms returned [380]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 380 rows 281 cols
[2023-03-20 07:53:19] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:19] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/668 places, 380/768 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 709 ms. Remains : 281/668 places, 380/768 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s206 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]]
Stuttering criterion allowed to conclude after 983 steps with 11 reset in 3 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-12 finished in 752 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||G((p1&&F(p2))))))'
Support contains 4 out of 668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 667 transition count 686
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 586 transition count 686
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 586 transition count 586
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 486 transition count 586
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 368 place count 480 transition count 580
Iterating global reduction 2 with 6 rules applied. Total rules applied 374 place count 480 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 374 place count 480 transition count 579
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 479 transition count 579
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 764 place count 285 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 766 place count 283 transition count 383
Applied a total of 766 rules in 55 ms. Remains 283 /668 variables (removed 385) and now considering 383/768 (removed 385) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:53:19] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:19] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-20 07:53:19] [INFO ] Invariant cache hit.
[2023-03-20 07:53:20] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-20 07:53:20] [INFO ] Redundant transitions in 76 ms returned [382]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2023-03-20 07:53:20] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 07:53:20] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/668 places, 382/768 transitions.
Applied a total of 0 rules in 7 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 668 ms. Remains : 283/668 places, 382/768 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-14 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=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s185 0), p0:(EQ s185 1), p2:(OR (EQ s75 0) (EQ s77 0) (EQ s81 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27199 reset in 336 ms.
Product exploration explored 100000 steps with 27221 reset in 367 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/283 stabilizing places and 2/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 9 factoid took 368 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-20 07:53:21] [INFO ] Invariant cache hit.
[2023-03-20 07:53:21] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:53:21] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 07:53:21] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 508 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 382/382 transitions.
Applied a total of 0 rules in 10 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:53:22] [INFO ] Invariant cache hit.
[2023-03-20 07:53:22] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-20 07:53:22] [INFO ] Invariant cache hit.
[2023-03-20 07:53:23] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-20 07:53:23] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-20 07:53:23] [INFO ] Invariant cache hit.
[2023-03-20 07:53:23] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 283/283 places, 382/382 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/283 stabilizing places and 2/382 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 3536 steps, including 12 resets, run visited all 2 properties in 16 ms. (steps per millisecond=221 )
Knowledge obtained : [(AND (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 27044 reset in 328 ms.
Product exploration explored 100000 steps with 27114 reset in 351 ms.
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 382/382 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:53:24] [INFO ] Invariant cache hit.
[2023-03-20 07:53:24] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-20 07:53:24] [INFO ] Invariant cache hit.
[2023-03-20 07:53:25] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-20 07:53:25] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-20 07:53:25] [INFO ] Invariant cache hit.
[2023-03-20 07:53:25] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 620 ms. Remains : 283/283 places, 382/382 transitions.
Treatment of property ShieldRVs-PT-020B-LTLFireability-14 finished in 5614 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((p0&&F(p1)&&G((F(p0)&&F(G(p2)))))))'
Support contains 5 out of 668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 668/668 places, 768/768 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 663 transition count 763
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 663 transition count 763
Applied a total of 10 rules in 25 ms. Remains 663 /668 variables (removed 5) and now considering 763/768 (removed 5) transitions.
// Phase 1: matrix 763 rows 663 cols
[2023-03-20 07:53:25] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:53:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-20 07:53:25] [INFO ] Invariant cache hit.
[2023-03-20 07:53:26] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-20 07:53:26] [INFO ] Invariant cache hit.
[2023-03-20 07:53:26] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/668 places, 763/768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 663/668 places, 763/768 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s637 1), p1:(AND (EQ s416 1) (EQ s420 1) (EQ s427 1)), p2:(EQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020B-LTLFireability-15 finished in 1239 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))||G((G(p1)||(p2&&G(p3))))))'
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)&&F(G(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' '!(F((p0||G((p1&&F(p2))))))'
[2023-03-20 07:53:26] [INFO ] Flatten gal took : 34 ms
[2023-03-20 07:53:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 07:53:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 668 places, 768 transitions and 2610 arcs took 6 ms.
Total runtime 34739 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1636/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1636/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1636/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-020B-LTLFireability-07
Could not compute solution for formula : ShieldRVs-PT-020B-LTLFireability-08
Could not compute solution for formula : ShieldRVs-PT-020B-LTLFireability-14

BK_STOP 1679298807805

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-020B-LTLFireability-07
ltl formula formula --ltl=/tmp/1636/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 668 places, 768 transitions and 2610 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1636/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1636/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1636/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1636/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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)
ltl formula name ShieldRVs-PT-020B-LTLFireability-08
ltl formula formula --ltl=/tmp/1636/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
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 668 places, 768 transitions and 2610 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1636/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1636/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1636/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1636/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
ltl formula name ShieldRVs-PT-020B-LTLFireability-14
ltl formula formula --ltl=/tmp/1636/ltl_2_
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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 668 places, 768 transitions and 2610 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1636/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1636/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1636/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1636/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
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:

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="ShieldRVs-PT-020B"
export BK_EXAMINATION="LTLFireability"
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 ShieldRVs-PT-020B, 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 r425-tajo-167905977700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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