Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903714800076.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714800076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 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.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 82K 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 ShieldIIPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679265533018

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:38:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:38:56] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-19 22:38:56] [INFO ] Transformed 303 places.
[2023-03-19 22:38:56] [INFO ] Transformed 298 transitions.
[2023-03-19 22:38:56] [INFO ] Found NUPN structural information;
[2023-03-19 22:38:56] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-005B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 278 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 278 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 277 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 277 transition count 272
Applied a total of 52 rules in 62 ms. Remains 277 /303 variables (removed 26) and now considering 272/298 (removed 26) transitions.
// Phase 1: matrix 272 rows 277 cols
[2023-03-19 22:38:56] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-19 22:38:56] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 22:38:56] [INFO ] Invariant cache hit.
[2023-03-19 22:38:57] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-19 22:38:57] [INFO ] Invariant cache hit.
[2023-03-19 22:38:57] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/303 places, 272/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 277/303 places, 272/298 transitions.
Support contains 46 out of 277 places after structural reductions.
[2023-03-19 22:38:57] [INFO ] Flatten gal took : 53 ms
[2023-03-19 22:38:57] [INFO ] Flatten gal took : 21 ms
[2023-03-19 22:38:57] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 45 out of 277 places (down from 46) after GAL structural reductions.
Finished random walk after 5340 steps, including 7 resets, run visited all 35 properties in 161 ms. (steps per millisecond=33 )
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)&&X(p2))||p0)))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 267 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 267 transition count 262
Applied a total of 20 rules in 27 ms. Remains 267 /277 variables (removed 10) and now considering 262/272 (removed 10) transitions.
// Phase 1: matrix 262 rows 267 cols
[2023-03-19 22:38:58] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-19 22:38:59] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 22:38:59] [INFO ] Invariant cache hit.
[2023-03-19 22:38:59] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-19 22:38:59] [INFO ] Invariant cache hit.
[2023-03-19 22:38:59] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/277 places, 262/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 267/277 places, 262/272 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(OR (EQ s31 0) (EQ s47 0) (EQ s58 0) (EQ s212 1)), p0:(OR (EQ s31 0) (EQ s47 0) (EQ s58 0)), p2:(EQ s223 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-00 finished in 2287 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) U p1)||G(p2)))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 251 transition count 222
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 227 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 219 transition count 214
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 219 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 219 transition count 211
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 120 place count 216 transition count 211
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 288 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 130 transition count 125
Applied a total of 290 rules in 136 ms. Remains 130 /277 variables (removed 147) and now considering 125/272 (removed 147) transitions.
// Phase 1: matrix 125 rows 130 cols
[2023-03-19 22:39:01] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-19 22:39:01] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-19 22:39:01] [INFO ] Invariant cache hit.
[2023-03-19 22:39:01] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-19 22:39:02] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-19 22:39:02] [INFO ] Invariant cache hit.
[2023-03-19 22:39:02] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/277 places, 125/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1078 ms. Remains : 130/277 places, 125/272 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s45 1), p2:(OR (EQ s116 0) (EQ s124 0) (EQ s128 0)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16549 reset in 322 ms.
Product exploration explored 100000 steps with 16851 reset in 210 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 1785 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 171 steps, including 0 resets, run visited all 9 properties in 9 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1843 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-19 22:39:07] [INFO ] Invariant cache hit.
[2023-03-19 22:39:07] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-19 22:39:07] [INFO ] Invariant cache hit.
[2023-03-19 22:39:08] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-19 22:39:08] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-19 22:39:08] [INFO ] Invariant cache hit.
[2023-03-19 22:39:08] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 130/130 places, 125/125 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 1365 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 98 steps, including 0 resets, run visited all 9 properties in 18 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1819 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16854 reset in 264 ms.
Product exploration explored 100000 steps with 16747 reset in 231 ms.
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-19 22:39:13] [INFO ] Invariant cache hit.
[2023-03-19 22:39:13] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-19 22:39:13] [INFO ] Invariant cache hit.
[2023-03-19 22:39:13] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-03-19 22:39:13] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-19 22:39:13] [INFO ] Invariant cache hit.
[2023-03-19 22:39:13] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 130/130 places, 125/125 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 12772 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(G((p0||G(p1)))))))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 5 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:39:13] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-19 22:39:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-19 22:39:13] [INFO ] Invariant cache hit.
[2023-03-19 22:39:14] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-19 22:39:14] [INFO ] Invariant cache hit.
[2023-03-19 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s189 1), p1:(EQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-03 finished in 867 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&&(p1||F(p2))))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 12 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:39:14] [INFO ] Computed 46 place invariants in 4 ms
[2023-03-19 22:39:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-19 22:39:14] [INFO ] Invariant cache hit.
[2023-03-19 22:39:15] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-19 22:39:15] [INFO ] Invariant cache hit.
[2023-03-19 22:39:15] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s258 1) (AND (EQ s132 1) (EQ s142 1) (EQ s161 1))), p1:(AND (EQ s190 1) (EQ s234 1)), p2:(EQ s258 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]]
Product exploration explored 100000 steps with 3916 reset in 235 ms.
Product exploration explored 100000 steps with 3895 reset in 230 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 441 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 303 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 510 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-19 22:39:17] [INFO ] Invariant cache hit.
[2023-03-19 22:39:18] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2023-03-19 22:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:19] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-19 22:39:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:39:19] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-19 22:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:19] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-19 22:39:20] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 18 ms to minimize.
[2023-03-19 22:39:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-19 22:39:20] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-19 22:39:23] [INFO ] Added : 244 causal constraints over 52 iterations in 3284 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:39:23] [INFO ] Invariant cache hit.
[2023-03-19 22:39:23] [INFO ] [Real]Absence check using 46 positive place invariants in 16 ms returned sat
[2023-03-19 22:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:24] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-19 22:39:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:39:24] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2023-03-19 22:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:25] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-19 22:39:25] [INFO ] Deduced a trap composed of 16 places in 391 ms of which 16 ms to minimize.
[2023-03-19 22:39:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-19 22:39:25] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-19 22:39:28] [INFO ] Added : 262 causal constraints over 54 iterations in 2664 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-19 22:39:28] [INFO ] Invariant cache hit.
[2023-03-19 22:39:28] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-19 22:39:28] [INFO ] Invariant cache hit.
[2023-03-19 22:39:30] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2023-03-19 22:39:30] [INFO ] Invariant cache hit.
[2023-03-19 22:39:31] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 268/268 places, 263/263 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 2615 steps, including 3 resets, run visited all 3 properties in 14 ms. (steps per millisecond=186 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 472 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-19 22:39:32] [INFO ] Invariant cache hit.
[2023-03-19 22:39:32] [INFO ] [Real]Absence check using 46 positive place invariants in 14 ms returned sat
[2023-03-19 22:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:32] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-19 22:39:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:39:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2023-03-19 22:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:33] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-19 22:39:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-19 22:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-19 22:39:33] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-19 22:39:36] [INFO ] Added : 244 causal constraints over 52 iterations in 3069 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:39:36] [INFO ] Invariant cache hit.
[2023-03-19 22:39:36] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2023-03-19 22:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:37] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-03-19 22:39:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:39:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-19 22:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:39:37] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-19 22:39:37] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-19 22:39:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-19 22:39:37] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-19 22:39:40] [INFO ] Added : 262 causal constraints over 54 iterations in 2694 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3921 reset in 212 ms.
Product exploration explored 100000 steps with 3838 reset in 170 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 268 transition count 263
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 23 place count 268 transition count 267
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 268 transition count 267
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 136 place count 268 transition count 267
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 168 place count 236 transition count 235
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 200 place count 236 transition count 235
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 200 rules in 92 ms. Remains 236 /268 variables (removed 32) and now considering 235/263 (removed 28) transitions.
[2023-03-19 22:39:41] [INFO ] Redundant transitions in 79 ms returned [234]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 234 rows 236 cols
[2023-03-19 22:39:41] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-19 22:39:41] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/268 places, 234/263 transitions.
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 430 ms. Remains : 236/268 places, 234/263 transitions.
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:39:41] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-19 22:39:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-19 22:39:41] [INFO ] Invariant cache hit.
[2023-03-19 22:39:42] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-19 22:39:42] [INFO ] Invariant cache hit.
[2023-03-19 22:39:42] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 918 ms. Remains : 268/268 places, 263/263 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 28001 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)) U G(p1)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 225 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 216 transition count 208
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 126 place count 213 transition count 208
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 126 transition count 122
Applied a total of 297 rules in 34 ms. Remains 126 /277 variables (removed 151) and now considering 122/272 (removed 150) transitions.
// Phase 1: matrix 122 rows 126 cols
[2023-03-19 22:39:42] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:39:42] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 22:39:42] [INFO ] Invariant cache hit.
[2023-03-19 22:39:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-19 22:39:42] [INFO ] Redundant transitions in 21 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2023-03-19 22:39:42] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:39:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/277 places, 121/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 126/277 places, 121/272 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s21 1), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 639 steps with 2 reset in 5 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 463 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 ((!p1||G((p2&&X(!p1)))) U !p2)))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 251 transition count 222
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 227 transition count 222
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 218 transition count 213
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 218 transition count 213
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 116 place count 218 transition count 209
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 214 transition count 209
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 288 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 129 transition count 125
Applied a total of 291 rules in 32 ms. Remains 129 /277 variables (removed 148) and now considering 125/272 (removed 147) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-19 22:39:43] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-19 22:39:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-19 22:39:43] [INFO ] Invariant cache hit.
[2023-03-19 22:39:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-19 22:39:43] [INFO ] Redundant transitions in 55 ms returned [124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 129 cols
[2023-03-19 22:39:43] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-19 22:39:43] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/277 places, 124/272 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 578 ms. Remains : 129/277 places, 124/272 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, p2, p2]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(NEQ s51 1), p1:(EQ s43 1), p0:(EQ s89 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, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-06 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||((p1 U ((p2||X(p2)) U (G((p2||X(p2)))||(p3&&(p2||X(p2)))))) U G(!p3))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 267 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 267 transition count 262
Applied a total of 20 rules in 10 ms. Remains 267 /277 variables (removed 10) and now considering 262/272 (removed 10) transitions.
// Phase 1: matrix 262 rows 267 cols
[2023-03-19 22:39:43] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-19 22:39:44] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-19 22:39:44] [INFO ] Invariant cache hit.
[2023-03-19 22:39:44] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-19 22:39:44] [INFO ] Invariant cache hit.
[2023-03-19 22:39:44] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/277 places, 262/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 267/277 places, 262/272 transitions.
Stuttering acceptance computed with spot in 1145 ms :[(AND (NOT p0) p3), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p3 p1 (NOT p0)), (AND (NOT p0) p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), true, p3, (NOT p2), (AND p3 (NOT p2)), (AND (NOT p2) p3 p1), p3, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(NOT p0), acceptance={} source=3 dest: 11}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 14}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p3, acceptance={} source=7 dest: 6}, { cond=(NOT p3), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}], [{ cond=(AND p3 (NOT p2) p1), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p1), acceptance={} source=10 dest: 10}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(NOT p3), acceptance={} source=11 dest: 11}, { cond=p3, acceptance={0} source=11 dest: 11}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=12 dest: 14}], [{ cond=(NOT p2), acceptance={} source=13 dest: 8}, { cond=(NOT p3), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=14 dest: 12}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p3) p1), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(NEQ s165 1), p2:(NEQ s84 1), p1:(AND (EQ s76 1) (EQ s100 1)), p0:(AND (EQ s126 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-08 finished in 1924 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) U G(p1)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 250 transition count 219
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 224 transition count 219
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 214 transition count 209
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 214 transition count 205
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 210 transition count 205
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 290 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 128 transition count 124
Applied a total of 293 rules in 53 ms. Remains 128 /277 variables (removed 149) and now considering 124/272 (removed 148) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-19 22:39:45] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-19 22:39:46] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-19 22:39:46] [INFO ] Invariant cache hit.
[2023-03-19 22:39:46] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2023-03-19 22:39:46] [INFO ] Redundant transitions in 40 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2023-03-19 22:39:46] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:39:47] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/277 places, 123/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1230 ms. Remains : 128/277 places, 123/272 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), p0]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s64 1), p0:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 524 reset in 335 ms.
Product exploration explored 100000 steps with 514 reset in 267 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 762 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0]
Finished random walk after 275 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 559 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), p0]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-19 22:39:49] [INFO ] Invariant cache hit.
[2023-03-19 22:39:50] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2023-03-19 22:39:50] [INFO ] Invariant cache hit.
[2023-03-19 22:39:51] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-19 22:39:51] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-19 22:39:51] [INFO ] Invariant cache hit.
[2023-03-19 22:39:51] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1861 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 825 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), p0]
Finished random walk after 288 steps, including 1 resets, run visited all 3 properties in 15 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 786 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 516 reset in 308 ms.
Product exploration explored 100000 steps with 522 reset in 266 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-19 22:39:54] [INFO ] Invariant cache hit.
[2023-03-19 22:39:54] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-19 22:39:54] [INFO ] Invariant cache hit.
[2023-03-19 22:39:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-19 22:39:54] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-19 22:39:54] [INFO ] Invariant cache hit.
[2023-03-19 22:39:54] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 128/128 places, 123/123 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-09 finished in 9077 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||F(p1)||G(p2)))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 4 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:39:54] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-19 22:39:55] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-19 22:39:55] [INFO ] Invariant cache hit.
[2023-03-19 22:39:55] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-19 22:39:55] [INFO ] Invariant cache hit.
[2023-03-19 22:39:55] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 987 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s107 1), p2:(EQ s141 1), p0:(EQ s72 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) p2))))
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 1846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 250 transition count 219
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 224 transition count 219
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 215 transition count 207
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 128 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 126 transition count 122
Applied a total of 297 rules in 28 ms. Remains 126 /277 variables (removed 151) and now considering 122/272 (removed 150) transitions.
// Phase 1: matrix 122 rows 126 cols
[2023-03-19 22:39:56] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:39:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-19 22:39:56] [INFO ] Invariant cache hit.
[2023-03-19 22:39:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-19 22:39:57] [INFO ] Redundant transitions in 21 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2023-03-19 22:39:57] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-19 22:39:57] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/277 places, 121/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 126/277 places, 121/272 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11 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:(OR (EQ s49 1) (NEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1818 reset in 289 ms.
Product exploration explored 100000 steps with 1827 reset in 208 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 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 320 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 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-19 22:39:58] [INFO ] Invariant cache hit.
[2023-03-19 22:39:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-19 22:39:58] [INFO ] Invariant cache hit.
[2023-03-19 22:39:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-19 22:39:59] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-19 22:39:59] [INFO ] Invariant cache hit.
[2023-03-19 22:39:59] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 126/126 places, 121/121 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 132 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 128 ms :[(NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 298 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 157 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1779 reset in 284 ms.
Product exploration explored 100000 steps with 1833 reset in 220 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-19 22:40:00] [INFO ] Invariant cache hit.
[2023-03-19 22:40:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 22:40:01] [INFO ] Invariant cache hit.
[2023-03-19 22:40:01] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-19 22:40:01] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 22:40:01] [INFO ] Invariant cache hit.
[2023-03-19 22:40:02] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1227 ms. Remains : 126/126 places, 121/121 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 5369 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 G((p1 U !p0)))&&F((p2 U (p3||G(p2))))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 250 transition count 220
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 225 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 216 transition count 208
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 126 place count 213 transition count 208
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 290 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 128 transition count 124
Applied a total of 293 rules in 24 ms. Remains 128 /277 variables (removed 149) and now considering 124/272 (removed 148) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-19 22:40:02] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:40:02] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 22:40:02] [INFO ] Invariant cache hit.
[2023-03-19 22:40:02] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-19 22:40:02] [INFO ] Redundant transitions in 26 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2023-03-19 22:40:02] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:40:03] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/277 places, 123/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 869 ms. Remains : 128/277 places, 123/272 transitions.
Stuttering acceptance computed with spot in 436 ms :[(OR p0 (AND (NOT p2) (NOT p3))), p0, p0, (AND (NOT p3) (NOT p2)), p0, true, p0]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s25 1), p3:(AND (NEQ s71 1) (NEQ s127 1)), p1:(EQ s88 1), p2:(NEQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-12 finished in 1353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 10 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:40:03] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-19 22:40:03] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 22:40:03] [INFO ] Invariant cache hit.
[2023-03-19 22:40:04] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-19 22:40:04] [INFO ] Invariant cache hit.
[2023-03-19 22:40:04] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s150 1) (EQ s238 1)), p1:(EQ s230 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 722 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-13 finished in 1017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((!(p1 U (p0 U p2))&&G(p3)))))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 7 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:40:04] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-19 22:40:04] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-19 22:40:04] [INFO ] Invariant cache hit.
[2023-03-19 22:40:07] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 2474 ms to find 0 implicit places.
[2023-03-19 22:40:07] [INFO ] Invariant cache hit.
[2023-03-19 22:40:07] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2819 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p3) p2), (OR (NOT p3) p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(OR p2 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 4}], [{ cond=(OR p2 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(EQ s10 1), p0:(EQ s191 1), p2:(AND (EQ s233 1) (EQ s257 1)), p1:(EQ s219 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-14 finished in 3216 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)||(p1&&F(!p2)&&X(p3)))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 4 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-19 22:40:07] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-19 22:40:08] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-19 22:40:08] [INFO ] Invariant cache hit.
[2023-03-19 22:40:08] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2023-03-19 22:40:08] [INFO ] Invariant cache hit.
[2023-03-19 22:40:09] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1237 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 468 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), true, (NOT p0), p2, (NOT p3), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s161 1), p1:(EQ s56 1), p2:(NEQ s84 1), p3:(EQ s196 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-15 finished in 1744 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) U p1)||G(p2)))'
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&&(p1||F(p2))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 276 transition count 247
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 252 transition count 221
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 226 transition count 221
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 217 transition count 212
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 217 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 118 place count 217 transition count 209
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 124 place count 214 transition count 209
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 286 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 289 place count 130 transition count 126
Applied a total of 289 rules in 50 ms. Remains 130 /277 variables (removed 147) and now considering 126/272 (removed 146) transitions.
// Phase 1: matrix 126 rows 130 cols
[2023-03-19 22:40:09] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-19 22:40:10] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-19 22:40:10] [INFO ] Invariant cache hit.
[2023-03-19 22:40:10] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-19 22:40:10] [INFO ] Invariant cache hit.
[2023-03-19 22:40:10] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/277 places, 126/272 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 679 ms. Remains : 130/277 places, 126/272 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s125 1) (AND (EQ s60 1) (EQ s67 1) (EQ s77 1))), p1:(AND (EQ s90 1) (EQ s112 1)), p2:(EQ s125 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, null][false, false, false]]
Product exploration explored 100000 steps with 33294 reset in 172 ms.
Product exploration explored 100000 steps with 33370 reset in 194 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/130 stabilizing places and 3/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 436 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 796 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=199 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 391 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2023-03-19 22:40:12] [INFO ] Invariant cache hit.
[2023-03-19 22:40:12] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-19 22:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:12] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-19 22:40:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:40:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-19 22:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:12] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-19 22:40:12] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-19 22:40:13] [INFO ] Added : 94 causal constraints over 21 iterations in 564 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:40:13] [INFO ] Invariant cache hit.
[2023-03-19 22:40:13] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-19 22:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:13] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-19 22:40:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:40:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-19 22:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:14] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-19 22:40:14] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-19 22:40:14] [INFO ] Added : 98 causal constraints over 25 iterations in 607 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-19 22:40:14] [INFO ] Invariant cache hit.
[2023-03-19 22:40:14] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-19 22:40:14] [INFO ] Invariant cache hit.
[2023-03-19 22:40:14] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-19 22:40:15] [INFO ] Invariant cache hit.
[2023-03-19 22:40:15] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 130/130 places, 126/126 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/130 stabilizing places and 3/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
Knowledge based reduction with 4 factoid took 453 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 125 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=125 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2023-03-19 22:40:16] [INFO ] Invariant cache hit.
[2023-03-19 22:40:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-19 22:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:16] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-19 22:40:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:40:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 22:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:17] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-19 22:40:17] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-19 22:40:17] [INFO ] Added : 94 causal constraints over 21 iterations in 550 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-19 22:40:17] [INFO ] Invariant cache hit.
[2023-03-19 22:40:17] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-19 22:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:17] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-19 22:40:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:40:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2023-03-19 22:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:40:18] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-19 22:40:18] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-19 22:40:18] [INFO ] Added : 98 causal constraints over 25 iterations in 476 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33286 reset in 242 ms.
Product exploration explored 100000 steps with 33351 reset in 173 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-19 22:40:19] [INFO ] Redundant transitions in 38 ms returned [125]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 130 cols
[2023-03-19 22:40:19] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 22:40:19] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/130 places, 125/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 130/130 places, 125/126 transitions.
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 130 cols
[2023-03-19 22:40:19] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-19 22:40:19] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-19 22:40:19] [INFO ] Invariant cache hit.
[2023-03-19 22:40:20] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-19 22:40:20] [INFO ] Invariant cache hit.
[2023-03-19 22:40:20] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 130/130 places, 126/126 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 10478 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) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-19 22:40:20] [INFO ] Flatten gal took : 14 ms
[2023-03-19 22:40:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 22:40:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 272 transitions and 844 arcs took 3 ms.
Total runtime 84345 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-005B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLFireability

BK_STOP 1679265716004

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldIIPs-PT-005B-LTLFireability-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/900 16/32 ShieldIIPs-PT-005B-LTLFireability-11 2306228 m, 461245 m/sec, 3873652 t fired, .

Time elapsed: 5 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/900 29/32 ShieldIIPs-PT-005B-LTLFireability-11 4302507 m, 399255 m/sec, 7470271 t fired, .

Time elapsed: 10 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ShieldIIPs-PT-005B-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-005B-LTLFireability-04
lola: time limit : 1195 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1195 5/32 ShieldIIPs-PT-005B-LTLFireability-04 565755 m, 113151 m/sec, 2267085 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1195 9/32 ShieldIIPs-PT-005B-LTLFireability-04 1114162 m, 109681 m/sec, 4612103 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1195 13/32 ShieldIIPs-PT-005B-LTLFireability-04 1618982 m, 100964 m/sec, 6924402 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1195 17/32 ShieldIIPs-PT-005B-LTLFireability-04 2113358 m, 98875 m/sec, 9286286 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1195 20/32 ShieldIIPs-PT-005B-LTLFireability-04 2632987 m, 103925 m/sec, 11630013 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1195 24/32 ShieldIIPs-PT-005B-LTLFireability-04 3130214 m, 99445 m/sec, 14002240 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1195 28/32 ShieldIIPs-PT-005B-LTLFireability-04 3652726 m, 104502 m/sec, 16359972 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1195 32/32 ShieldIIPs-PT-005B-LTLFireability-04 4155022 m, 100459 m/sec, 18756828 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-005B-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPs-PT-005B-LTLFireability-09
lola: time limit : 1770 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1770 14/32 ShieldIIPs-PT-005B-LTLFireability-09 2016402 m, 403280 m/sec, 3049187 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1770 27/32 ShieldIIPs-PT-005B-LTLFireability-09 4059446 m, 408608 m/sec, 6166888 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-005B-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-005B-LTLFireability-02
lola: time limit : 3525 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3525 12/32 ShieldIIPs-PT-005B-LTLFireability-02 1702534 m, 340506 m/sec, 3727117 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3525 23/32 ShieldIIPs-PT-005B-LTLFireability-02 3392682 m, 338029 m/sec, 7270874 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3525 32/32 ShieldIIPs-PT-005B-LTLFireability-02 4881996 m, 297862 m/sec, 10750018 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-005B-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-005B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-005B-LTLFireability-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-005B-LTLFireability-02: LTL unknown AGGR
ShieldIIPs-PT-005B-LTLFireability-04: LTL unknown AGGR
ShieldIIPs-PT-005B-LTLFireability-09: LTL unknown AGGR
ShieldIIPs-PT-005B-LTLFireability-11: LTL unknown AGGR


Time elapsed: 95 secs. Pages in use: 32

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="ShieldIIPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPs-PT-005B, 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 r391-oct2-167903714800076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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