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-167905977700092.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-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:26 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.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 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 122K 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-010B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679295329633

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-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 06:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 06:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 06:55:31] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-20 06:55:31] [INFO ] Transformed 403 places.
[2023-03-20 06:55:31] [INFO ] Transformed 453 transitions.
[2023-03-20 06:55:31] [INFO ] Found NUPN structural information;
[2023-03-20 06:55:31] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 130 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-010B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 453/453 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 344 transition count 394
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 344 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 343 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 343 transition count 393
Applied a total of 120 rules in 59 ms. Remains 343 /403 variables (removed 60) and now considering 393/453 (removed 60) transitions.
// Phase 1: matrix 393 rows 343 cols
[2023-03-20 06:55:31] [INFO ] Computed 41 place invariants in 17 ms
[2023-03-20 06:55:31] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-20 06:55:31] [INFO ] Invariant cache hit.
[2023-03-20 06:55:32] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-20 06:55:32] [INFO ] Invariant cache hit.
[2023-03-20 06:55:32] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/403 places, 393/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 343/403 places, 393/453 transitions.
Support contains 49 out of 343 places after structural reductions.
[2023-03-20 06:55:32] [INFO ] Flatten gal took : 66 ms
[2023-03-20 06:55:32] [INFO ] Flatten gal took : 37 ms
[2023-03-20 06:55:32] [INFO ] Input system was already deterministic with 393 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 06:55:33] [INFO ] Invariant cache hit.
[2023-03-20 06:55:33] [INFO ] [Real]Absence check using 41 positive place invariants in 42 ms returned sat
[2023-03-20 06:55:33] [INFO ] After 299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 06:55:33] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 5 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 1 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2023-03-20 06:55:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-20 06:55:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2124 ms
[2023-03-20 06:55:35] [INFO ] After 2456ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 06:55:35] [INFO ] After 2680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 06:55:36] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-20 06:55:36] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 06:55:36] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2023-03-20 06:55:36] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 0 ms to minimize.
[2023-03-20 06:55:36] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-20 06:55:36] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-03-20 06:55:36] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2023-03-20 06:55:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1600 ms
[2023-03-20 06:55:38] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 13 ms to minimize.
[2023-03-20 06:55:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-20 06:55:38] [INFO ] After 1911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 06:55:38] [INFO ] After 2115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 393/393 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 343 transition count 352
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 302 transition count 352
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 302 transition count 302
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 252 transition count 302
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 242 transition count 292
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 242 transition count 292
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 202 place count 242 transition count 289
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 239 transition count 289
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 400 place count 143 transition count 193
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 422 place count 143 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 142 transition count 192
Applied a total of 423 rules in 111 ms. Remains 142 /343 variables (removed 201) and now considering 192/393 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 142/343 places, 192/393 transitions.
Finished random walk after 713 steps, including 5 resets, run visited all 2 properties in 5 ms. (steps per millisecond=142 )
Computed a total of 83 stabilizing places and 83 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' '!((p0 U X(X(X(G(p0))))))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 19 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2023-03-20 06:55:38] [INFO ] Computed 41 place invariants in 9 ms
[2023-03-20 06:55:38] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-20 06:55:38] [INFO ] Invariant cache hit.
[2023-03-20 06:55:39] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-20 06:55:39] [INFO ] Invariant cache hit.
[2023-03-20 06:55:39] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-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=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s4 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-00 finished in 1030 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 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 342 transition count 352
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 302 transition count 352
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 80 place count 302 transition count 302
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 252 transition count 302
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 189 place count 243 transition count 293
Iterating global reduction 2 with 9 rules applied. Total rules applied 198 place count 243 transition count 293
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 198 place count 243 transition count 291
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 202 place count 241 transition count 291
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 388 place count 148 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 146 transition count 196
Applied a total of 390 rules in 52 ms. Remains 146 /343 variables (removed 197) and now considering 196/393 (removed 197) transitions.
// Phase 1: matrix 196 rows 146 cols
[2023-03-20 06:55:39] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:55:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 06:55:39] [INFO ] Invariant cache hit.
[2023-03-20 06:55:40] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-20 06:55:40] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-20 06:55:40] [INFO ] Invariant cache hit.
[2023-03-20 06:55:40] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/343 places, 196/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 570 ms. Remains : 146/343 places, 196/393 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s127 1) (EQ s51 1) (EQ s139 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 38410 reset in 572 ms.
Product exploration explored 100000 steps with 38336 reset in 394 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-20 06:55:41] [INFO ] Invariant cache hit.
[2023-03-20 06:55:42] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-20 06:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:42] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-20 06:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:55:42] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-20 06:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:42] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-20 06:55:42] [INFO ] Computed and/alt/rep : 168/705/168 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-20 06:55:43] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-20 06:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-20 06:55:43] [INFO ] Added : 163 causal constraints over 33 iterations in 936 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 12 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-20 06:55:43] [INFO ] Invariant cache hit.
[2023-03-20 06:55:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-20 06:55:43] [INFO ] Invariant cache hit.
[2023-03-20 06:55:43] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-20 06:55:43] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 06:55:43] [INFO ] Invariant cache hit.
[2023-03-20 06:55:43] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 146/146 places, 196/196 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-20 06:55:44] [INFO ] Invariant cache hit.
[2023-03-20 06:55:44] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-20 06:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:44] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-20 06:55:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:55:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-20 06:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:44] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-20 06:55:44] [INFO ] Computed and/alt/rep : 168/705/168 causal constraints (skipped 25 transitions) in 18 ms.
[2023-03-20 06:55:45] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-20 06:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-20 06:55:45] [INFO ] Added : 163 causal constraints over 33 iterations in 662 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 38592 reset in 297 ms.
Product exploration explored 100000 steps with 38591 reset in 251 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-20 06:55:45] [INFO ] Invariant cache hit.
[2023-03-20 06:55:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-20 06:55:45] [INFO ] Invariant cache hit.
[2023-03-20 06:55:46] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-20 06:55:46] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 06:55:46] [INFO ] Invariant cache hit.
[2023-03-20 06:55:46] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 146/146 places, 196/196 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-01 finished in 6498 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)))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 7 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2023-03-20 06:55:46] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:55:46] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-20 06:55:46] [INFO ] Invariant cache hit.
[2023-03-20 06:55:47] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-20 06:55:47] [INFO ] Invariant cache hit.
[2023-03-20 06:55:47] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s38 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][false, false]]
Product exploration explored 100000 steps with 315 reset in 287 ms.
Product exploration explored 100000 steps with 312 reset in 298 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Finished random walk after 310 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=155 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-20 06:55:48] [INFO ] Invariant cache hit.
[2023-03-20 06:55:48] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2023-03-20 06:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:49] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-20 06:55:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:55:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-20 06:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:49] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-20 06:55:49] [INFO ] Computed and/alt/rep : 381/1194/381 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-20 06:55:56] [INFO ] Added : 380 causal constraints over 83 iterations in 6808 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 332/332 places, 382/382 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 331 transition count 340
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 290 transition count 340
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 82 place count 290 transition count 292
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 178 place count 242 transition count 292
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 372 place count 145 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 374 place count 143 transition count 193
Applied a total of 374 rules in 61 ms. Remains 143 /332 variables (removed 189) and now considering 193/382 (removed 189) transitions.
// Phase 1: matrix 193 rows 143 cols
[2023-03-20 06:55:56] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:55:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-20 06:55:56] [INFO ] Invariant cache hit.
[2023-03-20 06:55:56] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-20 06:55:56] [INFO ] Redundant transitions in 58 ms returned [192]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 192 rows 143 cols
[2023-03-20 06:55:56] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:55:57] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/332 places, 192/382 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 614 ms. Remains : 143/332 places, 192/382 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-20 06:55:57] [INFO ] Invariant cache hit.
[2023-03-20 06:55:57] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-20 06:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:57] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-20 06:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:55:57] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2023-03-20 06:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:55:58] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-20 06:55:58] [INFO ] Computed and/alt/rep : 173/725/173 causal constraints (skipped 17 transitions) in 17 ms.
[2023-03-20 06:55:58] [INFO ] Added : 171 causal constraints over 35 iterations in 792 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 912 reset in 263 ms.
Product exploration explored 100000 steps with 913 reset in 299 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-20 06:55:59] [INFO ] Invariant cache hit.
[2023-03-20 06:55:59] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-20 06:55:59] [INFO ] Invariant cache hit.
[2023-03-20 06:55:59] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-20 06:55:59] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 06:55:59] [INFO ] Invariant cache hit.
[2023-03-20 06:55:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 143/143 places, 192/192 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-02 finished in 13772 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 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 342 transition count 351
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 301 transition count 351
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 301 transition count 301
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 251 transition count 301
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 241 transition count 291
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 241 transition count 291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 202 place count 241 transition count 288
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 238 transition count 288
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 396 place count 144 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 398 place count 142 transition count 192
Applied a total of 398 rules in 69 ms. Remains 142 /343 variables (removed 201) and now considering 192/393 (removed 201) transitions.
// Phase 1: matrix 192 rows 142 cols
[2023-03-20 06:56:00] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:56:00] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-20 06:56:00] [INFO ] Invariant cache hit.
[2023-03-20 06:56:00] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-20 06:56:00] [INFO ] Redundant transitions in 44 ms returned [191]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2023-03-20 06:56:00] [INFO ] Computed 41 place invariants in 9 ms
[2023-03-20 06:56:00] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/343 places, 191/393 transitions.
Applied a total of 0 rules in 17 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 577 ms. Remains : 142/343 places, 191/393 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-05 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:(EQ s42 0)], 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 709 reset in 397 ms.
Product exploration explored 100000 steps with 708 reset in 328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 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 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2277 steps, including 15 resets, run visited all 1 properties in 8 ms. (steps per millisecond=284 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 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 111 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-20 06:56:02] [INFO ] Invariant cache hit.
[2023-03-20 06:56:02] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-20 06:56:02] [INFO ] Invariant cache hit.
[2023-03-20 06:56:02] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-20 06:56:02] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-20 06:56:02] [INFO ] Invariant cache hit.
[2023-03-20 06:56:02] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 142/142 places, 191/191 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 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 p0), (NOT p0)]
Finished random walk after 1202 steps, including 8 resets, run visited all 1 properties in 5 ms. (steps per millisecond=240 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 707 reset in 265 ms.
Product exploration explored 100000 steps with 711 reset in 299 ms.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-20 06:56:04] [INFO ] Invariant cache hit.
[2023-03-20 06:56:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-20 06:56:04] [INFO ] Invariant cache hit.
[2023-03-20 06:56:04] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-20 06:56:04] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-20 06:56:04] [INFO ] Invariant cache hit.
[2023-03-20 06:56:04] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 515 ms. Remains : 142/142 places, 191/191 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-05 finished in 4706 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((G((p0 U p1))&&(p2||G(p0))))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 7 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:04] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-20 06:56:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-20 06:56:04] [INFO ] Invariant cache hit.
[2023-03-20 06:56:05] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-20 06:56:05] [INFO ] Invariant cache hit.
[2023-03-20 06:56:05] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p1 p2) p0), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s194 1), p0:(EQ s13 1), p2:(EQ s182 1)], nbAcceptance=2, 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]]
Stuttering criterion allowed to conclude after 433 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-06 finished in 1169 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))))'
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 6 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:05] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:56:06] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-20 06:56:06] [INFO ] Invariant cache hit.
[2023-03-20 06:56:06] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-20 06:56:06] [INFO ] Invariant cache hit.
[2023-03-20 06:56:06] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s212 1) (AND (EQ s147 1) (EQ s183 1) (EQ s202 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 439 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-07 finished in 919 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' '!(((p0 U X(G(p1)))||F(G(p2))))'
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 7 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:06] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:56:07] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-20 06:56:07] [INFO ] Invariant cache hit.
[2023-03-20 06:56:07] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-20 06:56:07] [INFO ] Invariant cache hit.
[2023-03-20 06:56:07] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s271 0) (EQ s36 0)), p0:(AND (EQ s84 1) (EQ s118 1) (EQ s140 1)), p1:(EQ s142 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 224 reset in 297 ms.
Product exploration explored 100000 steps with 223 reset in 318 ms.
Computed a total of 80 stabilizing places and 80 stable transitions
Computed a total of 80 stabilizing places and 80 stable transitions
Detected a total of 80/333 stabilizing places and 80/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 761 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p0 p1)))), (X (X p2)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 16 factoid took 958 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
Support contains 2 out of 333 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 : 333/333 places, 383/383 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 332 transition count 345
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 295 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 294 transition count 344
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 76 place count 294 transition count 294
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 176 place count 244 transition count 294
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 362 place count 151 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 149 transition count 199
Applied a total of 364 rules in 56 ms. Remains 149 /333 variables (removed 184) and now considering 199/383 (removed 184) transitions.
// Phase 1: matrix 199 rows 149 cols
[2023-03-20 06:56:10] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:56:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 06:56:10] [INFO ] Invariant cache hit.
[2023-03-20 06:56:10] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-20 06:56:10] [INFO ] Redundant transitions in 60 ms returned [198]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 198 rows 149 cols
[2023-03-20 06:56:10] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:56:10] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/333 places, 198/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 468 ms. Remains : 149/333 places, 198/383 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/149 stabilizing places and 6/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p2, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p2)]
Product exploration explored 100000 steps with 662 reset in 251 ms.
Product exploration explored 100000 steps with 662 reset in 266 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 198/198 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 148 transition count 196
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 147 transition count 196
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 146 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 145 transition count 194
Applied a total of 5 rules in 21 ms. Remains 145 /149 variables (removed 4) and now considering 194/198 (removed 4) transitions.
// Phase 1: matrix 194 rows 145 cols
[2023-03-20 06:56:12] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:56:12] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-20 06:56:12] [INFO ] Invariant cache hit.
[2023-03-20 06:56:12] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-20 06:56:12] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-20 06:56:12] [INFO ] Invariant cache hit.
[2023-03-20 06:56:12] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/149 places, 194/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 511 ms. Remains : 145/149 places, 194/198 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-08 finished in 5654 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(p0))||F((G(p1)||(!p2&&(p1 U (G(p1)||(p1&&G(!p3))))))))))'
Support contains 8 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 342 transition count 353
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 303 transition count 353
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 78 place count 303 transition count 304
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 187 place count 243 transition count 293
Iterating global reduction 2 with 11 rules applied. Total rules applied 198 place count 243 transition count 293
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 198 place count 243 transition count 290
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 240 transition count 290
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 388 place count 148 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 146 transition count 196
Applied a total of 390 rules in 54 ms. Remains 146 /343 variables (removed 197) and now considering 196/393 (removed 197) transitions.
// Phase 1: matrix 196 rows 146 cols
[2023-03-20 06:56:12] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-20 06:56:12] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-20 06:56:12] [INFO ] Invariant cache hit.
[2023-03-20 06:56:12] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-20 06:56:12] [INFO ] Redundant transitions in 64 ms returned [195]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 195 rows 146 cols
[2023-03-20 06:56:12] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:56:13] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/343 places, 195/393 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 146/343 places, 195/393 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={1} source=1 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p3), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p3), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={1} source=3 dest: 3}], [{ cond=(AND p1 p2 p3), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s17 0), p1:(NEQ s34 1), p2:(AND (EQ s97 1) (EQ s103 1) (EQ s111 1)), p3:(AND (EQ s75 1) (EQ s91 1) (EQ s102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 666 reset in 319 ms.
Product exploration explored 100000 steps with 663 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X p1), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 p3))), (X (AND p1 (NOT p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2))), (X (X p1)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1348 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 06:56:15] [INFO ] Invariant cache hit.
[2023-03-20 06:56:15] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2023-03-20 06:56:15] [INFO ] After 60ms SMT Verify possible using all constraints in real 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 p0 p1 (NOT p2) (NOT p3)), (X p1), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 p3))), (X (AND p1 (NOT p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2))), (X (X p1)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p3 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) p1))), (F (AND p3 (NOT p1))), (F (AND p3 p1)), (F (NOT p1)), (F (AND p1 p2)), (F (AND p3 p1 (NOT p2))), (F (AND (NOT p3) p1 p2)), (F (NOT (AND (NOT p3) p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (AND (NOT p0) p3 p1 (NOT p2))), (F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 20 factoid took 1564 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 4 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 195/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2023-03-20 06:56:18] [INFO ] Invariant cache hit.
[2023-03-20 06:56:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-20 06:56:18] [INFO ] Invariant cache hit.
[2023-03-20 06:56:18] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-20 06:56:18] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-20 06:56:18] [INFO ] Invariant cache hit.
[2023-03-20 06:56:18] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 494 ms. Remains : 146/146 places, 195/195 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X p1), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 p3))), (X (AND p1 (NOT p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2))), (X (X p1)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1544 ms. Reduced automaton from 4 states, 15 edges and 4 AP (stutter insensitive) to 4 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 11) seen :9
Finished Best-First random walk after 3419 steps, including 2 resets, run visited all 2 properties in 6 ms. (steps per millisecond=569 )
Knowledge obtained : [(AND p1 p0 (NOT p2) (NOT p3)), (X p1), (X (AND p1 (NOT p2) (NOT p3))), (X (NOT (AND p1 p3))), (X (AND p1 (NOT p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p2))), (X (X p1)), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 p2)), (F (AND p3 p1 (NOT p2))), (F (NOT (AND (NOT p3) p1 (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (AND (NOT p0) p3 p1 (NOT p2))), (F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (NOT (AND (NOT p3) p1))), (F (AND p3 p1)), (F (AND p3 (NOT p1))), (F (AND (NOT p3) (NOT p1)))]
Knowledge based reduction with 17 factoid took 1275 ms. Reduced automaton from 4 states, 15 edges and 4 AP (stutter insensitive) to 4 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p3), (NOT p1)]
Product exploration explored 100000 steps with 666 reset in 336 ms.
Product exploration explored 100000 steps with 663 reset in 352 ms.
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 195/195 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 195/195 (removed 0) transitions.
[2023-03-20 06:56:23] [INFO ] Invariant cache hit.
[2023-03-20 06:56:23] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-20 06:56:23] [INFO ] Invariant cache hit.
[2023-03-20 06:56:23] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-20 06:56:24] [INFO ] Redundant transitions in 476 ms returned []
[2023-03-20 06:56:24] [INFO ] Invariant cache hit.
[2023-03-20 06:56:24] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 942 ms. Remains : 146/146 places, 195/195 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-09 finished in 11733 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((p1&&G(F(p2)))))))'
Support contains 5 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 8 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:24] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:56:24] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 06:56:24] [INFO ] Invariant cache hit.
[2023-03-20 06:56:24] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-20 06:56:24] [INFO ] Invariant cache hit.
[2023-03-20 06:56:24] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s244 1) (EQ s278 1) (EQ s300 1)), p1:(EQ s197 1), p2:(EQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-10 finished in 980 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) U G(!p2)))'
Support contains 8 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 17 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:25] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:56:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-20 06:56:25] [INFO ] Invariant cache hit.
[2023-03-20 06:56:25] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-20 06:56:25] [INFO ] Invariant cache hit.
[2023-03-20 06:56:26] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 162 ms :[p2, true, (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s12 1) (EQ s21 1) (EQ s43 1)), p0:(AND (NOT (AND (EQ s211 1) (EQ s248 1) (EQ s267 1))) (EQ s88 1)), p1:(OR (EQ s223 1) (NEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1213 steps with 2 reset in 9 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-11 finished in 964 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(p1)||(F((p0&&X(p0))) U p2)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 334 transition count 384
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 334 transition count 384
Applied a total of 18 rules in 13 ms. Remains 334 /343 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 334 cols
[2023-03-20 06:56:26] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 06:56:26] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-20 06:56:26] [INFO ] Invariant cache hit.
[2023-03-20 06:56:26] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-20 06:56:26] [INFO ] Invariant cache hit.
[2023-03-20 06:56:26] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/343 places, 384/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 334/343 places, 384/393 transitions.
Stuttering acceptance computed with spot in 657 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s297 1), p2:(EQ s209 1), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 480 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-13 finished in 1280 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 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 332 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 332 transition count 382
Applied a total of 22 rules in 6 ms. Remains 332 /343 variables (removed 11) and now considering 382/393 (removed 11) transitions.
// Phase 1: matrix 382 rows 332 cols
[2023-03-20 06:56:27] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:56:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-20 06:56:27] [INFO ] Invariant cache hit.
[2023-03-20 06:56:27] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-20 06:56:28] [INFO ] Invariant cache hit.
[2023-03-20 06:56:28] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 332/343 places, 382/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 332/343 places, 382/393 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-14 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:(OR (NEQ s214 1) (NEQ s218 1) (NEQ s225 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 9282 steps with 20 reset in 20 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-14 finished in 842 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(p0)||(X(p0) U G(p1)))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 333 transition count 383
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 333 transition count 383
Applied a total of 20 rules in 7 ms. Remains 333 /343 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 333 cols
[2023-03-20 06:56:28] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-20 06:56:28] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-20 06:56:28] [INFO ] Invariant cache hit.
[2023-03-20 06:56:28] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-20 06:56:28] [INFO ] Invariant cache hit.
[2023-03-20 06:56:29] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/343 places, 383/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 333/343 places, 383/393 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s304 1), p1:(NEQ s301 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010B-LTLFireability-15 finished in 972 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))'
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)))'
Found a Shortening insensitive property : ShieldRVs-PT-010B-LTLFireability-02
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 342 transition count 351
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 301 transition count 351
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 82 place count 301 transition count 303
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 178 place count 253 transition count 303
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 189 place count 242 transition count 292
Iterating global reduction 2 with 11 rules applied. Total rules applied 200 place count 242 transition count 292
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 200 place count 242 transition count 289
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 239 transition count 289
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 394 place count 145 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 396 place count 143 transition count 193
Applied a total of 396 rules in 25 ms. Remains 143 /343 variables (removed 200) and now considering 193/393 (removed 200) transitions.
// Phase 1: matrix 193 rows 143 cols
[2023-03-20 06:56:29] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:56:29] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-20 06:56:29] [INFO ] Invariant cache hit.
[2023-03-20 06:56:30] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-20 06:56:30] [INFO ] Invariant cache hit.
[2023-03-20 06:56:30] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 143/343 places, 193/393 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1029 ms. Remains : 143/343 places, 193/393 transitions.
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 915 reset in 268 ms.
Product exploration explored 100000 steps with 921 reset in 296 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-20 06:56:31] [INFO ] Invariant cache hit.
[2023-03-20 06:56:32] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-20 06:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:56:32] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-20 06:56:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:56:32] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-20 06:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:56:32] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-20 06:56:32] [INFO ] Computed and/alt/rep : 173/724/173 causal constraints (skipped 18 transitions) in 12 ms.
[2023-03-20 06:56:32] [INFO ] Added : 173 causal constraints over 35 iterations in 716 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-20 06:56:32] [INFO ] Invariant cache hit.
[2023-03-20 06:56:33] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-20 06:56:33] [INFO ] Invariant cache hit.
[2023-03-20 06:56:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 06:56:33] [INFO ] Redundant transitions in 39 ms returned [192]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 192 rows 143 cols
[2023-03-20 06:56:33] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-20 06:56:33] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/143 places, 192/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 504 ms. Remains : 143/143 places, 192/193 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2023-03-20 06:56:34] [INFO ] Invariant cache hit.
[2023-03-20 06:56:34] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-20 06:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:56:34] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-20 06:56:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:56:34] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-20 06:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:56:34] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-20 06:56:34] [INFO ] Computed and/alt/rep : 173/725/173 causal constraints (skipped 17 transitions) in 13 ms.
[2023-03-20 06:56:34] [INFO ] Added : 138 causal constraints over 28 iterations in 538 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 920 reset in 204 ms.
Product exploration explored 100000 steps with 913 reset in 248 ms.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-20 06:56:35] [INFO ] Invariant cache hit.
[2023-03-20 06:56:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-20 06:56:35] [INFO ] Invariant cache hit.
[2023-03-20 06:56:35] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-20 06:56:35] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 06:56:35] [INFO ] Invariant cache hit.
[2023-03-20 06:56:35] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 143/143 places, 192/192 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-02 finished in 6457 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)))'
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' '!(((p0 U X(G(p1)))||F(G(p2))))'
Found a Lengthening insensitive property : ShieldRVs-PT-010B-LTLFireability-08
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 343/343 places, 393/393 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 342 transition count 355
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 305 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 304 transition count 354
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 76 place count 304 transition count 304
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 176 place count 254 transition count 304
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 186 place count 244 transition count 294
Iterating global reduction 3 with 10 rules applied. Total rules applied 196 place count 244 transition count 294
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 196 place count 244 transition count 292
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 242 transition count 292
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 382 place count 151 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 384 place count 149 transition count 199
Applied a total of 384 rules in 46 ms. Remains 149 /343 variables (removed 194) and now considering 199/393 (removed 194) transitions.
// Phase 1: matrix 199 rows 149 cols
[2023-03-20 06:56:36] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:56:36] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-20 06:56:36] [INFO ] Invariant cache hit.
[2023-03-20 06:56:36] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-20 06:56:36] [INFO ] Invariant cache hit.
[2023-03-20 06:56:36] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 149/343 places, 199/393 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 540 ms. Remains : 149/343 places, 199/393 transitions.
Running random walk in product with property : ShieldRVs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s121 0) (EQ s14 0)), p0:(AND (EQ s34 1) (EQ s50 1) (EQ s62 1)), p1:(EQ s63 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 665 reset in 284 ms.
Product exploration explored 100000 steps with 659 reset in 340 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/149 stabilizing places and 6/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 969 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 1121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-20 06:56:40] [INFO ] Invariant cache hit.
[2023-03-20 06:56:40] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-20 06:56:40] [INFO ] Invariant cache hit.
[2023-03-20 06:56:40] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-20 06:56:40] [INFO ] Invariant cache hit.
[2023-03-20 06:56:40] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 149/149 places, 199/199 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/149 stabilizing places and 6/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 302 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 474 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 659 reset in 319 ms.
Product exploration explored 100000 steps with 659 reset in 352 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 199/199 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 149 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 14 ms. Remains 149 /149 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-20 06:56:44] [INFO ] Redundant transitions in 1484 ms returned [192]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 198 rows 149 cols
[2023-03-20 06:56:44] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-20 06:56:44] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/149 places, 198/199 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1680 ms. Remains : 149/149 places, 198/199 transitions.
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 149 cols
[2023-03-20 06:56:44] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-20 06:56:44] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-20 06:56:44] [INFO ] Invariant cache hit.
[2023-03-20 06:56:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-20 06:56:45] [INFO ] Invariant cache hit.
[2023-03-20 06:56:45] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 149/149 places, 199/199 transitions.
Treatment of property ShieldRVs-PT-010B-LTLFireability-08 finished in 9234 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(p0))||F((G(p1)||(!p2&&(p1 U (G(p1)||(p1&&G(!p3))))))))))'
[2023-03-20 06:56:45] [INFO ] Flatten gal took : 57 ms
[2023-03-20 06:56:45] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-20 06:56:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 343 places, 393 transitions and 1320 arcs took 6 ms.
Total runtime 74378 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2449/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2449/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2449/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2449/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2449/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-010B-LTLFireability-01
Could not compute solution for formula : ShieldRVs-PT-010B-LTLFireability-02
Could not compute solution for formula : ShieldRVs-PT-010B-LTLFireability-05
Could not compute solution for formula : ShieldRVs-PT-010B-LTLFireability-08
Could not compute solution for formula : ShieldRVs-PT-010B-LTLFireability-09

BK_STOP 1679295407076

--------------------
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-010B-LTLFireability-01
ltl formula formula --ltl=/tmp/2449/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 343 places, 393 transitions and 1320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2449/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2449/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2449/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2449/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 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-010B-LTLFireability-02
ltl formula formula --ltl=/tmp/2449/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
pnml2lts-mc( 0/ 4): Petri net has 343 places, 393 transitions and 1320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2449/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2449/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2449/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2449/ltl_1_
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-010B-LTLFireability-05
ltl formula formula --ltl=/tmp/2449/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: =============================================================================
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 343 places, 393 transitions and 1320 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.100 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2449/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2449/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2449/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2449/ltl_2_
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) [0x562dbd0e13f4]
1: pnml2lts-mc(+0xa2496) [0x562dbd0e1496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff59b7a2140]
3: pnml2lts-mc(+0x405be5) [0x562dbd444be5]
4: pnml2lts-mc(+0x16b3f9) [0x562dbd1aa3f9]
5: pnml2lts-mc(+0x164ac4) [0x562dbd1a3ac4]
6: pnml2lts-mc(+0x272e0a) [0x562dbd2b1e0a]
7: pnml2lts-mc(+0xb61f0) [0x562dbd0f51f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff59b5f54d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff59b5f567a]
10: pnml2lts-mc(+0xa1581) [0x562dbd0e0581]
11: pnml2lts-mc(+0xa1910) [0x562dbd0e0910]
12: pnml2lts-mc(+0xa32a2) [0x562dbd0e22a2]
13: pnml2lts-mc(+0xa50f4) [0x562dbd0e40f4]
14: pnml2lts-mc(+0x3f34b3) [0x562dbd4324b3]
15: pnml2lts-mc(+0x7c63d) [0x562dbd0bb63d]
16: pnml2lts-mc(+0x67d86) [0x562dbd0a6d86]
17: pnml2lts-mc(+0x60a8a) [0x562dbd09fa8a]
18: pnml2lts-mc(+0x5eb15) [0x562dbd09db15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff59b5ddd0a]
20: pnml2lts-mc(+0x6075e) [0x562dbd09f75e]
ltl formula name ShieldRVs-PT-010B-LTLFireability-08
ltl formula formula --ltl=/tmp/2449/ltl_3_
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 343 places, 393 transitions and 1320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
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.110 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2449/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2449/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2449/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2449/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldRVs-PT-010B-LTLFireability-09
ltl formula formula --ltl=/tmp/2449/ltl_4_
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
pnml2lts-mc( 0/ 4): Petri net has 343 places, 393 transitions and 1320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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( 3/ 4): LTL layer: formula: /tmp/2449/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2449/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2449/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2449/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
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="ShieldRVs-PT-010B"
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-010B, 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-167905977700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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