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-167903715400516.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 ShieldPPPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K Feb 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 907K 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 ShieldPPPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679277489602

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=ShieldPPPs-PT-100A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:58:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:58:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:58:12] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-20 01:58:12] [INFO ] Transformed 3103 places.
[2023-03-20 01:58:12] [INFO ] Transformed 2603 transitions.
[2023-03-20 01:58:12] [INFO ] Found NUPN structural information;
[2023-03-20 01:58:12] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 339 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 01:58:12] [INFO ] Computed 1101 place invariants in 33 ms
[2023-03-20 01:58:15] [INFO ] Implicit Places using invariants in 2365 ms returned []
[2023-03-20 01:58:15] [INFO ] Invariant cache hit.
[2023-03-20 01:58:17] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 4266 ms to find 0 implicit places.
[2023-03-20 01:58:17] [INFO ] Invariant cache hit.
[2023-03-20 01:58:18] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6195 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 52 out of 3103 places after structural reductions.
[2023-03-20 01:58:19] [INFO ] Flatten gal took : 285 ms
[2023-03-20 01:58:19] [INFO ] Flatten gal took : 236 ms
[2023-03-20 01:58:19] [INFO ] Input system was already deterministic with 2603 transitions.
Support contains 50 out of 3103 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-20 01:58:23] [INFO ] Invariant cache hit.
[2023-03-20 01:58:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 409 ms returned sat
[2023-03-20 01:58:26] [INFO ] After 3022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 01:58:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 471 ms returned sat
[2023-03-20 01:58:51] [INFO ] After 22280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 01:58:51] [INFO ] After 22285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 01:58:51] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 446 ms.
Support contains 27 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 876 times.
Drop transitions removed 876 transitions
Iterating global reduction 0 with 876 rules applied. Total rules applied 880 place count 3101 transition count 2601
Applied a total of 880 rules in 508 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 508 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 114418 steps, run timeout after 6002 ms. (steps per millisecond=19 ) properties seen :{0=1, 1=1, 2=1, 3=1, 7=1, 9=1}
Probabilistic random walk after 114418 steps, saw 111011 distinct states, run finished after 6004 ms. (steps per millisecond=19 ) properties seen :6
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 01:59:00] [INFO ] Computed 1101 place invariants in 107 ms
[2023-03-20 01:59:01] [INFO ] [Real]Absence check using 1043 positive place invariants in 309 ms returned sat
[2023-03-20 01:59:01] [INFO ] [Real]Absence check using 1043 positive and 58 generalized place invariants in 16 ms returned sat
[2023-03-20 01:59:05] [INFO ] After 4501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 01:59:06] [INFO ] [Nat]Absence check using 1043 positive place invariants in 335 ms returned sat
[2023-03-20 01:59:06] [INFO ] [Nat]Absence check using 1043 positive and 58 generalized place invariants in 13 ms returned sat
[2023-03-20 01:59:30] [INFO ] After 23767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:59:30] [INFO ] After 23777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 01:59:30] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2123 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 3101 transition count 2601
Applied a total of 15 rules in 338 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 61999 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61999 steps, saw 60496 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 01:59:36] [INFO ] Computed 1101 place invariants in 83 ms
[2023-03-20 01:59:38] [INFO ] [Real]Absence check using 1044 positive place invariants in 280 ms returned sat
[2023-03-20 01:59:38] [INFO ] [Real]Absence check using 1044 positive and 57 generalized place invariants in 15 ms returned sat
[2023-03-20 01:59:41] [INFO ] After 4831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 01:59:43] [INFO ] [Nat]Absence check using 1044 positive place invariants in 322 ms returned sat
[2023-03-20 01:59:43] [INFO ] [Nat]Absence check using 1044 positive and 57 generalized place invariants in 78 ms returned sat
[2023-03-20 02:00:06] [INFO ] After 23210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:00:06] [INFO ] After 23216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 02:00:06] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 206 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 184 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:00:07] [INFO ] Invariant cache hit.
[2023-03-20 02:00:09] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2023-03-20 02:00:09] [INFO ] Invariant cache hit.
[2023-03-20 02:00:09] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
[2023-03-20 02:00:10] [INFO ] Redundant transitions in 228 ms returned []
[2023-03-20 02:00:10] [INFO ] Invariant cache hit.
[2023-03-20 02:00:12] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5096 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 40 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 639 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:00:13] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:00:14] [INFO ] Implicit Places using invariants in 1607 ms returned []
[2023-03-20 02:00:14] [INFO ] Invariant cache hit.
[2023-03-20 02:00:16] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
[2023-03-20 02:00:16] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-20 02:00:16] [INFO ] Invariant cache hit.
[2023-03-20 02:00:17] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5419 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (NEQ s2749 1) (NOT (AND (EQ s2175 1) (EQ s2191 1)))), p1:(AND (EQ s2175 1) (EQ s2191 1)), p0:(AND (EQ s1835 1) (EQ s1837 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 38 reset in 2205 ms.
Product exploration explored 100000 steps with 39 reset in 2416 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 870 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2660 steps, including 0 resets, run visited all 1 properties in 55 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 1010 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-20 02:00:25] [INFO ] Invariant cache hit.
[2023-03-20 02:00:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1887 ms returned sat
[2023-03-20 02:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:00:40] [INFO ] [Real]Absence check using state equation in 9572 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 191 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-20 02:00:40] [INFO ] Invariant cache hit.
[2023-03-20 02:00:42] [INFO ] Implicit Places using invariants in 2444 ms returned []
[2023-03-20 02:00:42] [INFO ] Invariant cache hit.
[2023-03-20 02:00:44] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 4563 ms to find 0 implicit places.
[2023-03-20 02:00:45] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-20 02:00:45] [INFO ] Invariant cache hit.
[2023-03-20 02:00:46] [INFO ] Dead Transitions using invariants and state equation in 1552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6381 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Finished random walk after 2649 steps, including 0 resets, run visited all 1 properties in 56 ms. (steps per millisecond=47 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-20 02:00:47] [INFO ] Invariant cache hit.
[2023-03-20 02:00:53] [INFO ] [Real]Absence check using 1101 positive place invariants in 1665 ms returned sat
[2023-03-20 02:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:01:02] [INFO ] [Real]Absence check using state equation in 8915 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 1922 ms.
Product exploration explored 100000 steps with 39 reset in 2327 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 221 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-20 02:01:06] [INFO ] Invariant cache hit.
[2023-03-20 02:01:08] [INFO ] Implicit Places using invariants in 2120 ms returned []
[2023-03-20 02:01:08] [INFO ] Invariant cache hit.
[2023-03-20 02:01:11] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned []
Implicit Place search using SMT with State Equation took 4494 ms to find 0 implicit places.
[2023-03-20 02:01:11] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-20 02:01:11] [INFO ] Invariant cache hit.
[2023-03-20 02:01:13] [INFO ] Dead Transitions using invariants and state equation in 1759 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6577 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-00 finished in 60944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(!p1&&F(!p0))))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 141 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:01:13] [INFO ] Computed 1101 place invariants in 16 ms
[2023-03-20 02:01:15] [INFO ] Implicit Places using invariants in 2063 ms returned []
[2023-03-20 02:01:15] [INFO ] Invariant cache hit.
[2023-03-20 02:01:17] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 3792 ms to find 0 implicit places.
[2023-03-20 02:01:17] [INFO ] Invariant cache hit.
[2023-03-20 02:01:19] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5806 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 174 ms :[p0, p0, p0]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1568 1) (EQ s1579 1)), p0:(AND (EQ s2066 1) (EQ s2087 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6962 ms.
Product exploration explored 100000 steps with 50000 reset in 7116 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLFireability-02 finished in 20311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 175 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:01:33] [INFO ] Invariant cache hit.
[2023-03-20 02:01:35] [INFO ] Implicit Places using invariants in 1791 ms returned []
[2023-03-20 02:01:35] [INFO ] Invariant cache hit.
[2023-03-20 02:01:37] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2023-03-20 02:01:37] [INFO ] Invariant cache hit.
[2023-03-20 02:01:38] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5137 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 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 21 reset in 1949 ms.
Product exploration explored 100000 steps with 22 reset in 2469 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86559 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86559 steps, saw 77982 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:01:47] [INFO ] Invariant cache hit.
[2023-03-20 02:01:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 373 ms returned sat
[2023-03-20 02:01:47] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:01:48] [INFO ] [Nat]Absence check using 1101 positive place invariants in 233 ms returned sat
[2023-03-20 02:01:59] [INFO ] After 11813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 463 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1558 ms. (steps per millisecond=43 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1562 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 02:02:02] [INFO ] Invariant cache hit.
[2023-03-20 02:02:08] [INFO ] [Real]Absence check using 1101 positive place invariants in 1933 ms returned sat
[2023-03-20 02:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:02:17] [INFO ] [Real]Absence check using state equation in 9085 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 225 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:02:17] [INFO ] Invariant cache hit.
[2023-03-20 02:02:19] [INFO ] Implicit Places using invariants in 2050 ms returned []
[2023-03-20 02:02:19] [INFO ] Invariant cache hit.
[2023-03-20 02:02:21] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 3899 ms to find 0 implicit places.
[2023-03-20 02:02:21] [INFO ] Invariant cache hit.
[2023-03-20 02:02:23] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5744 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85010 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85010 steps, saw 76595 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:02:27] [INFO ] Invariant cache hit.
[2023-03-20 02:02:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 292 ms returned sat
[2023-03-20 02:02:27] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:02:28] [INFO ] [Nat]Absence check using 1101 positive place invariants in 291 ms returned sat
[2023-03-20 02:02:39] [INFO ] After 11741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 550 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1399 ms. (steps per millisecond=47 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1403 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 02:02:42] [INFO ] Invariant cache hit.
[2023-03-20 02:02:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 1785 ms returned sat
[2023-03-20 02:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:02:57] [INFO ] [Real]Absence check using state equation in 8689 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 1883 ms.
Product exploration explored 100000 steps with 21 reset in 2140 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 11 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 11 ms
Applied a total of 2 rules in 480 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:03:02] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:03:02] [INFO ] Computed 1101 place invariants in 29 ms
[2023-03-20 02:03:04] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2283 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 133 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:03:04] [INFO ] Computed 1101 place invariants in 17 ms
[2023-03-20 02:03:06] [INFO ] Implicit Places using invariants in 1659 ms returned []
[2023-03-20 02:03:06] [INFO ] Invariant cache hit.
[2023-03-20 02:03:07] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 3329 ms to find 0 implicit places.
[2023-03-20 02:03:07] [INFO ] Invariant cache hit.
[2023-03-20 02:03:09] [INFO ] Dead Transitions using invariants and state equation in 1606 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5070 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 95987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 123 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:03:09] [INFO ] Invariant cache hit.
[2023-03-20 02:03:11] [INFO ] Implicit Places using invariants in 1783 ms returned []
[2023-03-20 02:03:11] [INFO ] Invariant cache hit.
[2023-03-20 02:03:13] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 3675 ms to find 0 implicit places.
[2023-03-20 02:03:13] [INFO ] Invariant cache hit.
[2023-03-20 02:03:15] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5457 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2374 1) (EQ s2383 1) (EQ s2774 1) (EQ s2816 1)), p0:(OR (EQ s919 0) (EQ s940 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6679 steps with 2 reset in 156 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-05 finished in 5824 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)||X(p1)) U X((F(p1)&&p2))))'
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 211 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:03:15] [INFO ] Invariant cache hit.
[2023-03-20 02:03:18] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2023-03-20 02:03:18] [INFO ] Invariant cache hit.
[2023-03-20 02:03:19] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2023-03-20 02:03:19] [INFO ] Invariant cache hit.
[2023-03-20 02:03:21] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5639 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s809 1) (EQ s836 1)), p2:(AND (EQ s1410 1) (EQ s1452 1)), p1:(AND (EQ s697 1) (EQ s739 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 1968 ms.
Product exploration explored 100000 steps with 20 reset in 2308 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 735 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 46061 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46061 steps, saw 41316 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-20 02:03:31] [INFO ] Invariant cache hit.
[2023-03-20 02:03:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 294 ms returned sat
[2023-03-20 02:03:36] [INFO ] After 4287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:03:37] [INFO ] [Nat]Absence check using 1101 positive place invariants in 296 ms returned sat
[2023-03-20 02:04:01] [INFO ] After 23251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:04:01] [INFO ] After 23256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-20 02:04:01] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 464 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 74969 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 74969 steps, saw 74113 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:04:06] [INFO ] Computed 1101 place invariants in 22 ms
[2023-03-20 02:04:07] [INFO ] [Real]Absence check using 1045 positive place invariants in 283 ms returned sat
[2023-03-20 02:04:07] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 187 ms returned sat
[2023-03-20 02:04:10] [INFO ] After 4109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:04:11] [INFO ] [Nat]Absence check using 1045 positive place invariants in 323 ms returned sat
[2023-03-20 02:04:11] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 28 ms returned sat
[2023-03-20 02:04:35] [INFO ] After 23335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:04:35] [INFO ] After 23341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 02:04:35] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 159 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 80149 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80149 steps, saw 79257 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-20 02:04:40] [INFO ] Invariant cache hit.
[2023-03-20 02:04:41] [INFO ] [Real]Absence check using 1045 positive place invariants in 247 ms returned sat
[2023-03-20 02:04:41] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 27 ms returned sat
[2023-03-20 02:04:43] [INFO ] After 3701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:04:44] [INFO ] [Nat]Absence check using 1045 positive place invariants in 353 ms returned sat
[2023-03-20 02:04:44] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 29 ms returned sat
[2023-03-20 02:05:08] [INFO ] After 23477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 02:05:08] [INFO ] After 23490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 02:05:08] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 162 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 137 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:05:09] [INFO ] Invariant cache hit.
[2023-03-20 02:05:10] [INFO ] Implicit Places using invariants in 1909 ms returned []
[2023-03-20 02:05:10] [INFO ] Invariant cache hit.
[2023-03-20 02:05:13] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 4337 ms to find 0 implicit places.
[2023-03-20 02:05:13] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-20 02:05:13] [INFO ] Invariant cache hit.
[2023-03-20 02:05:15] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6174 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) p2))]
Knowledge based reduction with 14 factoid took 979 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:05:16] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-20 02:05:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 2293 ms returned sat
[2023-03-20 02:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:05:31] [INFO ] [Real]Absence check using state equation in 8776 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-20 02:05:31] [INFO ] Invariant cache hit.
[2023-03-20 02:05:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 2275 ms returned sat
[2023-03-20 02:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:05:46] [INFO ] [Real]Absence check using state equation in 9048 ms returned unknown
Could not prove EG (NOT p1)
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 167 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:05:47] [INFO ] Invariant cache hit.
[2023-03-20 02:05:48] [INFO ] Implicit Places using invariants in 1791 ms returned []
[2023-03-20 02:05:48] [INFO ] Invariant cache hit.
[2023-03-20 02:05:50] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 3541 ms to find 0 implicit places.
[2023-03-20 02:05:50] [INFO ] Invariant cache hit.
[2023-03-20 02:05:52] [INFO ] Dead Transitions using invariants and state equation in 2230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5940 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 561 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 02:05:55] [INFO ] Invariant cache hit.
[2023-03-20 02:05:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 374 ms returned sat
[2023-03-20 02:05:58] [INFO ] After 3660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:05:59] [INFO ] [Nat]Absence check using 1101 positive place invariants in 283 ms returned sat
[2023-03-20 02:06:23] [INFO ] After 23596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:06:23] [INFO ] After 23606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 02:06:23] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 464 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 74532 steps, run timeout after 3004 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74532 steps, saw 73679 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:06:28] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 02:06:29] [INFO ] [Real]Absence check using 1045 positive place invariants in 273 ms returned sat
[2023-03-20 02:06:29] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 39 ms returned sat
[2023-03-20 02:06:32] [INFO ] After 4035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:06:33] [INFO ] [Nat]Absence check using 1045 positive place invariants in 267 ms returned sat
[2023-03-20 02:06:33] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 29 ms returned sat
[2023-03-20 02:06:57] [INFO ] After 23350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 02:06:57] [INFO ] After 23361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 02:06:57] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 193 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 148 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:06:58] [INFO ] Invariant cache hit.
[2023-03-20 02:07:00] [INFO ] Implicit Places using invariants in 2640 ms returned []
[2023-03-20 02:07:00] [INFO ] Invariant cache hit.
[2023-03-20 02:07:03] [INFO ] Implicit Places using invariants and state equation in 2618 ms returned []
Implicit Place search using SMT with State Equation took 5266 ms to find 0 implicit places.
[2023-03-20 02:07:03] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-20 02:07:03] [INFO ] Invariant cache hit.
[2023-03-20 02:07:05] [INFO ] Dead Transitions using invariants and state equation in 2205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7709 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-20 02:07:05] [INFO ] Invariant cache hit.
[2023-03-20 02:07:07] [INFO ] [Real]Absence check using 1045 positive place invariants in 289 ms returned sat
[2023-03-20 02:07:07] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 15 ms returned sat
[2023-03-20 02:07:09] [INFO ] After 4014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 02:07:11] [INFO ] [Nat]Absence check using 1045 positive place invariants in 274 ms returned sat
[2023-03-20 02:07:11] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 28 ms returned sat
[2023-03-20 02:08:20] [INFO ] After 68406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:08:29] [INFO ] After 77516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-20 02:08:29] [INFO ] After 79586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 646 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:08:31] [INFO ] Computed 1101 place invariants in 14 ms
[2023-03-20 02:08:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 2364 ms returned sat
[2023-03-20 02:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:08:46] [INFO ] [Real]Absence check using state equation in 8833 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-20 02:08:46] [INFO ] Invariant cache hit.
[2023-03-20 02:08:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 1860 ms returned sat
[2023-03-20 02:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:09:01] [INFO ] [Real]Absence check using state equation in 9276 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20 reset in 1841 ms.
Product exploration explored 100000 steps with 20 reset in 2227 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 11 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 354 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:09:06] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:09:06] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-20 02:09:07] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1973 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 6 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 147 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:09:07] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-20 02:09:09] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2023-03-20 02:09:09] [INFO ] Invariant cache hit.
[2023-03-20 02:09:12] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned []
Implicit Place search using SMT with State Equation took 4273 ms to find 0 implicit places.
[2023-03-20 02:09:12] [INFO ] Invariant cache hit.
[2023-03-20 02:09:13] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5995 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-06 finished in 358415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 468 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:09:14] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:09:16] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2023-03-20 02:09:16] [INFO ] Invariant cache hit.
[2023-03-20 02:09:18] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 3698 ms to find 0 implicit places.
[2023-03-20 02:09:18] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-20 02:09:18] [INFO ] Invariant cache hit.
[2023-03-20 02:09:19] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5946 ms. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s620 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14 reset in 1898 ms.
Product exploration explored 100000 steps with 14 reset in 2360 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 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91284 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91284 steps, saw 82884 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:09:27] [INFO ] Invariant cache hit.
[2023-03-20 02:09:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 234 ms returned sat
[2023-03-20 02:09:30] [INFO ] After 2372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:09:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 297 ms returned sat
[2023-03-20 02:09:32] [INFO ] After 1590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:09:32] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 2 ms to minimize.
[2023-03-20 02:09:33] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 0 ms to minimize.
[2023-03-20 02:09:33] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 4 ms to minimize.
[2023-03-20 02:09:33] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 1 ms to minimize.
[2023-03-20 02:09:34] [INFO ] Deduced a trap composed of 23 places in 440 ms of which 2 ms to minimize.
[2023-03-20 02:09:34] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 1 ms to minimize.
[2023-03-20 02:09:35] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:09:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2023-03-20 02:09:36] [INFO ] Deduced a trap composed of 25 places in 1150 ms of which 1 ms to minimize.
[2023-03-20 02:09:37] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:09:37] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:09:37] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-20 02:09:37] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:09:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5574 ms
[2023-03-20 02:09:38] [INFO ] After 7259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-20 02:09:38] [INFO ] After 8230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 378 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122714 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122714 steps, saw 121785 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:09:42] [INFO ] Computed 1101 place invariants in 23 ms
[2023-03-20 02:09:43] [INFO ] [Real]Absence check using 1101 positive place invariants in 545 ms returned sat
[2023-03-20 02:09:44] [INFO ] After 2714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:09:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 235 ms returned sat
[2023-03-20 02:09:47] [INFO ] After 1962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:09:48] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:09:48] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 0 ms to minimize.
[2023-03-20 02:09:48] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:09:49] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:09:49] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2023-03-20 02:09:49] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 1 ms to minimize.
[2023-03-20 02:09:50] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:09:50] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:09:51] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 2 ms to minimize.
[2023-03-20 02:09:51] [INFO ] Deduced a trap composed of 17 places in 505 ms of which 30 ms to minimize.
[2023-03-20 02:09:52] [INFO ] Deduced a trap composed of 17 places in 633 ms of which 3 ms to minimize.
[2023-03-20 02:09:52] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 1 ms to minimize.
[2023-03-20 02:09:53] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 0 ms to minimize.
[2023-03-20 02:09:53] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:09:53] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:09:54] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 6 ms to minimize.
[2023-03-20 02:09:54] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 19 ms to minimize.
[2023-03-20 02:09:54] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:09:54] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2023-03-20 02:09:55] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2023-03-20 02:09:55] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2023-03-20 02:09:55] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2023-03-20 02:09:55] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-20 02:09:56] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-20 02:09:56] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8641 ms
[2023-03-20 02:09:56] [INFO ] After 10695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-20 02:09:56] [INFO ] After 11548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 192 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 132 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-20 02:09:56] [INFO ] Invariant cache hit.
[2023-03-20 02:09:58] [INFO ] Implicit Places using invariants in 1957 ms returned []
[2023-03-20 02:09:58] [INFO ] Invariant cache hit.
[2023-03-20 02:10:00] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 4138 ms to find 0 implicit places.
[2023-03-20 02:10:00] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 02:10:00] [INFO ] Invariant cache hit.
[2023-03-20 02:10:02] [INFO ] Dead Transitions using invariants and state equation in 1609 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5966 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 123 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 02:10:02] [INFO ] Invariant cache hit.
[2023-03-20 02:10:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 246 ms returned sat
[2023-03-20 02:10:05] [INFO ] After 2649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:10:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 262 ms returned sat
[2023-03-20 02:10:07] [INFO ] After 1771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:10:08] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:10:08] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2023-03-20 02:10:09] [INFO ] Deduced a trap composed of 17 places in 867 ms of which 1 ms to minimize.
[2023-03-20 02:10:09] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-20 02:10:13] [INFO ] Deduced a trap composed of 23 places in 3844 ms of which 3 ms to minimize.
[2023-03-20 02:10:14] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:10:14] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2023-03-20 02:10:14] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 0 ms to minimize.
[2023-03-20 02:10:15] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2023-03-20 02:10:15] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:10:15] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-20 02:10:15] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-20 02:10:16] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 0 ms to minimize.
[2023-03-20 02:10:16] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-20 02:10:16] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2023-03-20 02:10:16] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2023-03-20 02:10:17] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 0 ms to minimize.
[2023-03-20 02:10:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 9252 ms
[2023-03-20 02:10:17] [INFO ] After 11123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-20 02:10:17] [INFO ] After 12076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 184 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:10:17] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-20 02:10:19] [INFO ] Implicit Places using invariants in 1897 ms returned []
[2023-03-20 02:10:19] [INFO ] Invariant cache hit.
[2023-03-20 02:10:21] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 3760 ms to find 0 implicit places.
[2023-03-20 02:10:21] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:10:21] [INFO ] Invariant cache hit.
[2023-03-20 02:10:23] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5456 ms. Remains : 3100/3100 places, 2600/2600 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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 91259 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91259 steps, saw 82861 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:10:26] [INFO ] Invariant cache hit.
[2023-03-20 02:10:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 268 ms returned sat
[2023-03-20 02:10:29] [INFO ] After 2590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:10:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 238 ms returned sat
[2023-03-20 02:10:31] [INFO ] After 1564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:10:32] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 1 ms to minimize.
[2023-03-20 02:10:32] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2023-03-20 02:10:32] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 0 ms to minimize.
[2023-03-20 02:10:33] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 0 ms to minimize.
[2023-03-20 02:10:33] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:10:33] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-03-20 02:10:34] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:10:34] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:10:34] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 13 ms to minimize.
[2023-03-20 02:10:34] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-20 02:10:35] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 14 ms to minimize.
[2023-03-20 02:10:35] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-20 02:10:35] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2023-03-20 02:10:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4133 ms
[2023-03-20 02:10:35] [INFO ] After 5765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-20 02:10:35] [INFO ] After 6689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 3100 transition count 2600
Applied a total of 597 rules in 260 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 140051 steps, run timeout after 3004 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140051 steps, saw 139023 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:10:39] [INFO ] Computed 1101 place invariants in 56 ms
[2023-03-20 02:10:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 354 ms returned sat
[2023-03-20 02:10:42] [INFO ] After 2671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:10:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 250 ms returned sat
[2023-03-20 02:10:44] [INFO ] After 1608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:10:45] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:10:45] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:10:46] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2023-03-20 02:10:46] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2023-03-20 02:10:47] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 1 ms to minimize.
[2023-03-20 02:10:47] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-20 02:10:48] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:10:48] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 0 ms to minimize.
[2023-03-20 02:10:49] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-20 02:10:49] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 1 ms to minimize.
[2023-03-20 02:10:49] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 2 ms to minimize.
[2023-03-20 02:10:50] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 0 ms to minimize.
[2023-03-20 02:10:50] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 0 ms to minimize.
[2023-03-20 02:10:50] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2023-03-20 02:10:51] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 13 ms to minimize.
[2023-03-20 02:10:51] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-20 02:10:51] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2023-03-20 02:10:52] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-20 02:10:52] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:10:52] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-20 02:10:53] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 9102 ms
[2023-03-20 02:10:54] [INFO ] After 10776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-20 02:10:54] [INFO ] After 11860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-20 02:10:54] [INFO ] Invariant cache hit.
[2023-03-20 02:10:56] [INFO ] Implicit Places using invariants in 2038 ms returned []
[2023-03-20 02:10:56] [INFO ] Invariant cache hit.
[2023-03-20 02:10:58] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2023-03-20 02:10:58] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 02:10:58] [INFO ] Invariant cache hit.
[2023-03-20 02:11:00] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5784 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 02:11:00] [INFO ] Invariant cache hit.
[2023-03-20 02:11:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 252 ms returned sat
[2023-03-20 02:11:02] [INFO ] After 2470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:11:03] [INFO ] [Nat]Absence check using 1101 positive place invariants in 233 ms returned sat
[2023-03-20 02:11:05] [INFO ] After 1675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:11:05] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:11:05] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2023-03-20 02:11:06] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2023-03-20 02:11:06] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 1 ms to minimize.
[2023-03-20 02:11:06] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:11:07] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-20 02:11:08] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 0 ms to minimize.
[2023-03-20 02:11:08] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2023-03-20 02:11:08] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 0 ms to minimize.
[2023-03-20 02:11:09] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-03-20 02:11:09] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-20 02:11:09] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2023-03-20 02:11:09] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-20 02:11:09] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2023-03-20 02:11:10] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4828 ms
[2023-03-20 02:11:10] [INFO ] After 6559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-20 02:11:10] [INFO ] After 7518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15 reset in 1742 ms.
Product exploration explored 100000 steps with 15 reset in 2170 ms.
Support contains 1 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 135 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2023-03-20 02:11:14] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-20 02:11:16] [INFO ] Implicit Places using invariants in 1657 ms returned []
[2023-03-20 02:11:16] [INFO ] Invariant cache hit.
[2023-03-20 02:11:18] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 3540 ms to find 0 implicit places.
[2023-03-20 02:11:18] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:11:18] [INFO ] Invariant cache hit.
[2023-03-20 02:11:19] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5271 ms. Remains : 3100/3100 places, 2600/2600 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-07 finished in 126130 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)&&F(p1)))&&G(p2)))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 128 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:11:20] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-20 02:11:21] [INFO ] Implicit Places using invariants in 1577 ms returned []
[2023-03-20 02:11:21] [INFO ] Invariant cache hit.
[2023-03-20 02:11:23] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 3472 ms to find 0 implicit places.
[2023-03-20 02:11:23] [INFO ] Invariant cache hit.
[2023-03-20 02:11:25] [INFO ] Dead Transitions using invariants and state equation in 1607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5208 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s517 0), p0:(OR (EQ s1964 0) (EQ s1976 0)), p1:(OR (EQ s2855 0) (EQ s2882 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2398 steps with 0 reset in 71 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-08 finished in 5546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 328 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:11:25] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:11:27] [INFO ] Implicit Places using invariants in 1826 ms returned []
[2023-03-20 02:11:27] [INFO ] Invariant cache hit.
[2023-03-20 02:11:29] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
[2023-03-20 02:11:29] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:11:29] [INFO ] Invariant cache hit.
[2023-03-20 02:11:31] [INFO ] Dead Transitions using invariants and state equation in 1656 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5467 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2553 0) (EQ s2563 0)), p1:(AND (EQ s2 1) (EQ s10 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 6725 steps with 0 reset in 151 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-09 finished in 5787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&F(G(p1)))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 273 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2023-03-20 02:11:31] [INFO ] Invariant cache hit.
[2023-03-20 02:11:33] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2023-03-20 02:11:33] [INFO ] Invariant cache hit.
[2023-03-20 02:11:38] [INFO ] Implicit Places using invariants and state equation in 5612 ms returned []
Implicit Place search using SMT with State Equation took 7310 ms to find 0 implicit places.
[2023-03-20 02:11:39] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-20 02:11:39] [INFO ] Invariant cache hit.
[2023-03-20 02:11:40] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9164 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 217 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1258 1) (EQ s1269 1)), p1:(NEQ s2192 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 15 reset in 1834 ms.
Product exploration explored 100000 steps with 14 reset in 2663 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71761 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71761 steps, saw 65065 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:11:49] [INFO ] Invariant cache hit.
[2023-03-20 02:11:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 536 ms returned sat
[2023-03-20 02:11:53] [INFO ] After 3322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:11:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 269 ms returned sat
[2023-03-20 02:12:13] [INFO ] After 20438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 444 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1499 ms. (steps per millisecond=34 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1501 ms. (steps per millisecond=34 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 156 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:12:16] [INFO ] Invariant cache hit.
[2023-03-20 02:12:18] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2023-03-20 02:12:18] [INFO ] Invariant cache hit.
[2023-03-20 02:12:20] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 3447 ms to find 0 implicit places.
[2023-03-20 02:12:20] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:12:20] [INFO ] Invariant cache hit.
[2023-03-20 02:12:21] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5201 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 69630 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69630 steps, saw 63119 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:12:25] [INFO ] Invariant cache hit.
[2023-03-20 02:12:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 285 ms returned sat
[2023-03-20 02:12:28] [INFO ] After 2923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:12:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 319 ms returned sat
[2023-03-20 02:12:49] [INFO ] After 20551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 467 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Finished probabilistic random walk after 52044 steps, run visited all 2 properties in 1618 ms. (steps per millisecond=32 )
Probabilistic random walk after 52044 steps, saw 51347 distinct states, run finished after 1620 ms. (steps per millisecond=32 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 14 reset in 2189 ms.
Product exploration explored 100000 steps with 15 reset in 2746 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 148 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:12:58] [INFO ] Invariant cache hit.
[2023-03-20 02:12:59] [INFO ] Implicit Places using invariants in 1714 ms returned []
[2023-03-20 02:12:59] [INFO ] Invariant cache hit.
[2023-03-20 02:13:01] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 3498 ms to find 0 implicit places.
[2023-03-20 02:13:01] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:13:01] [INFO ] Invariant cache hit.
[2023-03-20 02:13:03] [INFO ] Dead Transitions using invariants and state equation in 1565 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5302 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-10 finished in 91935 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(G((F(G(!p0)) U p0)))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 137 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:13:03] [INFO ] Computed 1101 place invariants in 14 ms
[2023-03-20 02:13:05] [INFO ] Implicit Places using invariants in 1662 ms returned []
[2023-03-20 02:13:05] [INFO ] Invariant cache hit.
[2023-03-20 02:13:06] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 3462 ms to find 0 implicit places.
[2023-03-20 02:13:06] [INFO ] Invariant cache hit.
[2023-03-20 02:13:08] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5083 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s1494 1) (EQ s1511 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-12 finished in 5225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 193 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:13:08] [INFO ] Invariant cache hit.
[2023-03-20 02:13:10] [INFO ] Implicit Places using invariants in 2033 ms returned []
[2023-03-20 02:13:10] [INFO ] Invariant cache hit.
[2023-03-20 02:13:12] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 3655 ms to find 0 implicit places.
[2023-03-20 02:13:12] [INFO ] Invariant cache hit.
[2023-03-20 02:13:14] [INFO ] Dead Transitions using invariants and state equation in 1638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5511 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1214 1) (EQ s1233 1)), p0:(OR (EQ s287 0) (EQ s307 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-13 finished in 5682 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 U (p1||G(!p0))) U G(p0))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 191 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:13:14] [INFO ] Invariant cache hit.
[2023-03-20 02:13:16] [INFO ] Implicit Places using invariants in 1691 ms returned []
[2023-03-20 02:13:16] [INFO ] Invariant cache hit.
[2023-03-20 02:13:17] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 3416 ms to find 0 implicit places.
[2023-03-20 02:13:17] [INFO ] Invariant cache hit.
[2023-03-20 02:13:19] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5039 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s601 1) (EQ s603 1)), p1:(AND (EQ s44 1) (EQ s64 1) (NOT (AND (EQ s601 1) (EQ s603 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25039 reset in 4237 ms.
Product exploration explored 100000 steps with 24999 reset in 4481 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 51982 steps, run timeout after 3006 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 51982 steps, saw 46659 distinct states, run finished after 3006 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:13:32] [INFO ] Invariant cache hit.
[2023-03-20 02:13:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 281 ms returned sat
[2023-03-20 02:13:35] [INFO ] After 2187ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:1
[2023-03-20 02:13:35] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:13:36] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-20 02:13:37] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2023-03-20 02:13:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1472 ms
[2023-03-20 02:13:37] [INFO ] After 3915ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-20 02:13:37] [INFO ] After 4960ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-20 02:13:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 295 ms returned sat
[2023-03-20 02:13:46] [INFO ] After 8039ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 02:13:56] [INFO ] After 17592ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2023-03-20 02:13:57] [INFO ] After 19807ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 631 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Applied a total of 900 rules in 406 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 101068 steps, run timeout after 3004 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101068 steps, saw 100145 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:14:02] [INFO ] Computed 1101 place invariants in 53 ms
[2023-03-20 02:14:02] [INFO ] [Real]Absence check using 1048 positive place invariants in 248 ms returned sat
[2023-03-20 02:14:02] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 27 ms returned sat
[2023-03-20 02:14:05] [INFO ] After 3628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:14:06] [INFO ] [Nat]Absence check using 1048 positive place invariants in 334 ms returned sat
[2023-03-20 02:14:06] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 133 ms returned sat
[2023-03-20 02:14:30] [INFO ] After 23926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:14:30] [INFO ] After 23931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 02:14:30] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 244 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 155 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:14:31] [INFO ] Invariant cache hit.
[2023-03-20 02:14:34] [INFO ] Implicit Places using invariants in 2855 ms returned []
[2023-03-20 02:14:34] [INFO ] Invariant cache hit.
[2023-03-20 02:14:36] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 4836 ms to find 0 implicit places.
[2023-03-20 02:14:36] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-20 02:14:36] [INFO ] Invariant cache hit.
[2023-03-20 02:14:37] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6615 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-20 02:14:37] [INFO ] Invariant cache hit.
[2023-03-20 02:14:38] [INFO ] [Real]Absence check using 1048 positive place invariants in 432 ms returned sat
[2023-03-20 02:14:38] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 21 ms returned sat
[2023-03-20 02:14:40] [INFO ] After 2891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 02:14:41] [INFO ] [Nat]Absence check using 1048 positive place invariants in 259 ms returned sat
[2023-03-20 02:14:41] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 15 ms returned sat
[2023-03-20 02:15:10] [INFO ] After 29739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 591 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:15:11] [INFO ] Computed 1101 place invariants in 13 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [true]
Knowledge based reduction with 10 factoid took 418 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 189 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2023-03-20 02:15:15] [INFO ] Invariant cache hit.
[2023-03-20 02:15:17] [INFO ] Implicit Places using invariants in 1699 ms returned []
[2023-03-20 02:15:17] [INFO ] Invariant cache hit.
[2023-03-20 02:15:19] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 3312 ms to find 0 implicit places.
[2023-03-20 02:15:19] [INFO ] Invariant cache hit.
[2023-03-20 02:15:20] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5085 ms. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 44229 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44229 steps, saw 39674 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 02:15:25] [INFO ] Invariant cache hit.
[2023-03-20 02:15:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 304 ms returned sat
[2023-03-20 02:15:28] [INFO ] After 3199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:15:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 209 ms returned sat
[2023-03-20 02:15:53] [INFO ] After 23934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:15:53] [INFO ] After 23938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 02:15:53] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Applied a total of 900 rules in 548 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 74160 steps, run timeout after 3004 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74160 steps, saw 73350 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:15:58] [INFO ] Computed 1101 place invariants in 38 ms
[2023-03-20 02:15:59] [INFO ] [Real]Absence check using 1048 positive place invariants in 279 ms returned sat
[2023-03-20 02:15:59] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 10 ms returned sat
[2023-03-20 02:16:01] [INFO ] After 2146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-20 02:16:01] [INFO ] After 2440ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:16:01] [INFO ] After 3575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:16:02] [INFO ] [Nat]Absence check using 1048 positive place invariants in 263 ms returned sat
[2023-03-20 02:16:02] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 12 ms returned sat
[2023-03-20 02:16:27] [INFO ] After 23842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:16:27] [INFO ] After 23845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 02:16:27] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 253 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 256 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:16:27] [INFO ] Invariant cache hit.
[2023-03-20 02:16:30] [INFO ] Implicit Places using invariants in 2743 ms returned []
[2023-03-20 02:16:30] [INFO ] Invariant cache hit.
[2023-03-20 02:16:32] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 4710 ms to find 0 implicit places.
[2023-03-20 02:16:32] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-20 02:16:32] [INFO ] Invariant cache hit.
[2023-03-20 02:16:33] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6626 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 163 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 02:16:34] [INFO ] Invariant cache hit.
[2023-03-20 02:16:34] [INFO ] [Real]Absence check using 1048 positive place invariants in 267 ms returned sat
[2023-03-20 02:16:34] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 29 ms returned sat
[2023-03-20 02:16:37] [INFO ] After 3844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 02:16:38] [INFO ] [Nat]Absence check using 1048 positive place invariants in 272 ms returned sat
[2023-03-20 02:16:38] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 14 ms returned sat
[2023-03-20 02:17:07] [INFO ] After 28723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 02:17:16] [INFO ] After 37740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-20 02:17:16] [INFO ] After 39066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-20 02:17:17] [INFO ] Computed 1101 place invariants in 12 ms
Proved EG true
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [true]
Knowledge based reduction with 9 factoid took 377 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), true, (OR (NOT p0) p1), true, true]
Entered a terminal (fully accepting) state of product in 5271 steps with 0 reset in 123 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-14 finished in 248703 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 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 424 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-20 02:17:23] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-20 02:17:25] [INFO ] Implicit Places using invariants in 1898 ms returned []
[2023-03-20 02:17:25] [INFO ] Invariant cache hit.
[2023-03-20 02:17:27] [INFO ] Implicit Places using invariants and state equation in 2266 ms returned []
Implicit Place search using SMT with State Equation took 4164 ms to find 0 implicit places.
[2023-03-20 02:17:27] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-20 02:17:27] [INFO ] Invariant cache hit.
[2023-03-20 02:17:29] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6481 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-15 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 (AND (EQ s2267 1) (EQ s2288 1)) (AND (EQ s657 1) (EQ s673 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 65 reset in 2076 ms.
Product exploration explored 100000 steps with 65 reset in 2583 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 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 129 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1642 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 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 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:17:35] [INFO ] Invariant cache hit.
[2023-03-20 02:17:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1837 ms returned sat
[2023-03-20 02:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:17:50] [INFO ] [Real]Absence check using state equation in 9296 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 296 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:17:50] [INFO ] Invariant cache hit.
[2023-03-20 02:17:52] [INFO ] Implicit Places using invariants in 1834 ms returned []
[2023-03-20 02:17:52] [INFO ] Invariant cache hit.
[2023-03-20 02:17:53] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 3498 ms to find 0 implicit places.
[2023-03-20 02:17:53] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:17:53] [INFO ] Invariant cache hit.
[2023-03-20 02:17:55] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5371 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1489 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=62 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
[2023-03-20 02:17:56] [INFO ] Invariant cache hit.
[2023-03-20 02:18:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 1929 ms returned sat
[2023-03-20 02:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:18:11] [INFO ] [Real]Absence check using state equation in 9241 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 65 reset in 1874 ms.
Product exploration explored 100000 steps with 65 reset in 2391 ms.
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 165 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:18:15] [INFO ] Invariant cache hit.
[2023-03-20 02:18:17] [INFO ] Implicit Places using invariants in 2003 ms returned []
[2023-03-20 02:18:17] [INFO ] Invariant cache hit.
[2023-03-20 02:18:19] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 3969 ms to find 0 implicit places.
[2023-03-20 02:18:19] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 02:18:19] [INFO ] Invariant cache hit.
[2023-03-20 02:18:21] [INFO ] Dead Transitions using invariants and state equation in 1580 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5785 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-15 finished in 58612 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)&&(!p1 U (p2||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' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100A-LTLFireability-03
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 366 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
[2023-03-20 02:18:22] [INFO ] Invariant cache hit.
[2023-03-20 02:18:23] [INFO ] Implicit Places using invariants in 1689 ms returned []
[2023-03-20 02:18:23] [INFO ] Invariant cache hit.
[2023-03-20 02:18:25] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 3316 ms to find 0 implicit places.
[2023-03-20 02:18:25] [INFO ] Invariant cache hit.
[2023-03-20 02:18:27] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5280 ms. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1023 1) (AND (EQ s313 1) (EQ s340 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 22 reset in 1728 ms.
Product exploration explored 100000 steps with 22 reset in 2190 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85462 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85462 steps, saw 77582 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:18:34] [INFO ] Invariant cache hit.
[2023-03-20 02:18:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 471 ms returned sat
[2023-03-20 02:18:35] [INFO ] After 1114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:18:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 382 ms returned sat
[2023-03-20 02:18:47] [INFO ] After 11468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 454 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1552 ms. (steps per millisecond=43 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1557 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 02:18:50] [INFO ] Invariant cache hit.
[2023-03-20 02:18:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1847 ms returned sat
[2023-03-20 02:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:19:05] [INFO ] [Real]Absence check using state equation in 9322 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 188 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:19:05] [INFO ] Invariant cache hit.
[2023-03-20 02:19:07] [INFO ] Implicit Places using invariants in 2031 ms returned []
[2023-03-20 02:19:07] [INFO ] Invariant cache hit.
[2023-03-20 02:19:09] [INFO ] Implicit Places using invariants and state equation in 2378 ms returned []
Implicit Place search using SMT with State Equation took 4424 ms to find 0 implicit places.
[2023-03-20 02:19:09] [INFO ] Invariant cache hit.
[2023-03-20 02:19:11] [INFO ] Dead Transitions using invariants and state equation in 1733 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6346 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85220 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85220 steps, saw 77357 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 02:19:15] [INFO ] Invariant cache hit.
[2023-03-20 02:19:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 376 ms returned sat
[2023-03-20 02:19:16] [INFO ] After 1042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:19:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 253 ms returned sat
[2023-03-20 02:19:27] [INFO ] After 11346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 894 place count 3101 transition count 2601
Applied a total of 894 rules in 339 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67125 steps, run visited all 1 properties in 1431 ms. (steps per millisecond=46 )
Probabilistic random walk after 67125 steps, saw 66350 distinct states, run finished after 1435 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 02:19:30] [INFO ] Invariant cache hit.
[2023-03-20 02:19:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 1861 ms returned sat
[2023-03-20 02:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:19:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 1861 ms.
Product exploration explored 100000 steps with 21 reset in 2853 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 224 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:19:50] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-20 02:19:50] [INFO ] Invariant cache hit.
[2023-03-20 02:19:52] [INFO ] Dead Transitions using invariants and state equation in 1577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1893 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-20 02:19:52] [INFO ] Invariant cache hit.
[2023-03-20 02:19:54] [INFO ] Implicit Places using invariants in 2154 ms returned []
[2023-03-20 02:19:54] [INFO ] Invariant cache hit.
[2023-03-20 02:19:56] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 4060 ms to find 0 implicit places.
[2023-03-20 02:19:56] [INFO ] Invariant cache hit.
[2023-03-20 02:19:58] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5668 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 96502 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)||X(p1)) U X((F(p1)&&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' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-20 02:19:58] [INFO ] Flatten gal took : 178 ms
[2023-03-20 02:19:58] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:19:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3103 places, 2603 transitions and 10006 arcs took 13 ms.
Total runtime 1306904 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-100A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ShieldPPPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279072662

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
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: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 5 (type EXCL) for 0 ShieldPPPs-PT-100A-LTLFireability-00
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-00
lola: result : true
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldPPPs-PT-100A-LTLFireability-07
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 3/599 2/32 ShieldPPPs-PT-100A-LTLFireability-07 108802 m, 21760 m/sec, 198299 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 8/599 5/32 ShieldPPPs-PT-100A-LTLFireability-07 320346 m, 42308 m/sec, 627856 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 13/599 8/32 ShieldPPPs-PT-100A-LTLFireability-07 532344 m, 42399 m/sec, 1058621 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 18/599 10/32 ShieldPPPs-PT-100A-LTLFireability-07 731710 m, 39873 m/sec, 1485919 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 23/599 13/32 ShieldPPPs-PT-100A-LTLFireability-07 942246 m, 42107 m/sec, 1911079 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 28/599 16/32 ShieldPPPs-PT-100A-LTLFireability-07 1151607 m, 41872 m/sec, 2347667 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 33/599 18/32 ShieldPPPs-PT-100A-LTLFireability-07 1352584 m, 40195 m/sec, 2782962 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 38/599 21/32 ShieldPPPs-PT-100A-LTLFireability-07 1572183 m, 43919 m/sec, 3212922 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 43/599 24/32 ShieldPPPs-PT-100A-LTLFireability-07 1781032 m, 41769 m/sec, 3647674 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 48/599 26/32 ShieldPPPs-PT-100A-LTLFireability-07 1976327 m, 39059 m/sec, 4077141 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 53/599 29/32 ShieldPPPs-PT-100A-LTLFireability-07 2181290 m, 40992 m/sec, 4509056 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 58/599 32/32 ShieldPPPs-PT-100A-LTLFireability-07 2391730 m, 42088 m/sec, 4939036 t fired, .

Time elapsed: 64 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 14 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 69 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 11 (type EXCL) for 10 ShieldPPPs-PT-100A-LTLFireability-06
lola: time limit : 706 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
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/706 3/32 ShieldPPPs-PT-100A-LTLFireability-06 184271 m, 36854 m/sec, 446772 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/706 5/32 ShieldPPPs-PT-100A-LTLFireability-06 347459 m, 32637 m/sec, 901521 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/706 7/32 ShieldPPPs-PT-100A-LTLFireability-06 518812 m, 34270 m/sec, 1354232 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/706 9/32 ShieldPPPs-PT-100A-LTLFireability-06 692429 m, 34723 m/sec, 1805460 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/706 11/32 ShieldPPPs-PT-100A-LTLFireability-06 861638 m, 33841 m/sec, 2255988 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/706 13/32 ShieldPPPs-PT-100A-LTLFireability-06 1013177 m, 30307 m/sec, 2706840 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/706 14/32 ShieldPPPs-PT-100A-LTLFireability-06 1155368 m, 28438 m/sec, 3159840 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/706 16/32 ShieldPPPs-PT-100A-LTLFireability-06 1305409 m, 30008 m/sec, 3608543 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/706 18/32 ShieldPPPs-PT-100A-LTLFireability-06 1459892 m, 30896 m/sec, 4057306 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/706 20/32 ShieldPPPs-PT-100A-LTLFireability-06 1617200 m, 31461 m/sec, 4504185 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/706 22/32 ShieldPPPs-PT-100A-LTLFireability-06 1770905 m, 30741 m/sec, 4954681 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/706 23/32 ShieldPPPs-PT-100A-LTLFireability-06 1910497 m, 27918 m/sec, 5405094 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 65/706 25/32 ShieldPPPs-PT-100A-LTLFireability-06 2061629 m, 30226 m/sec, 5853525 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 70/706 27/32 ShieldPPPs-PT-100A-LTLFireability-06 2215448 m, 30763 m/sec, 6303728 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 75/706 29/32 ShieldPPPs-PT-100A-LTLFireability-06 2373581 m, 31626 m/sec, 6753908 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 80/706 31/32 ShieldPPPs-PT-100A-LTLFireability-06 2529049 m, 31093 m/sec, 7206098 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 85/706 32/32 ShieldPPPs-PT-100A-LTLFireability-06 2669174 m, 28025 m/sec, 7657778 t fired, .

Time elapsed: 154 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 11 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 159 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 8 (type EXCL) for 7 ShieldPPPs-PT-100A-LTLFireability-03
lola: time limit : 860 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
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/860 6/32 ShieldPPPs-PT-100A-LTLFireability-03 177183 m, 35436 m/sec, 428799 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/860 10/32 ShieldPPPs-PT-100A-LTLFireability-03 345331 m, 33629 m/sec, 858833 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/860 14/32 ShieldPPPs-PT-100A-LTLFireability-03 478808 m, 26695 m/sec, 1280703 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/860 19/32 ShieldPPPs-PT-100A-LTLFireability-03 645773 m, 33393 m/sec, 1711982 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/860 23/32 ShieldPPPs-PT-100A-LTLFireability-03 781492 m, 27143 m/sec, 2134915 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/860 27/32 ShieldPPPs-PT-100A-LTLFireability-03 914257 m, 26553 m/sec, 2556630 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/860 31/32 ShieldPPPs-PT-100A-LTLFireability-03 1054316 m, 28011 m/sec, 2982179 t fired, .

Time elapsed: 194 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 8 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-00: CONJ 0 1 0 0 3 0 0 0
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 199 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 22 (type EXCL) for 0 ShieldPPPs-PT-100A-LTLFireability-00
lola: time limit : 1133 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-00
lola: result : true
lola: markings : 9650
lola: fired transitions : 9649
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 17 (type EXCL) for 16 ShieldPPPs-PT-100A-LTLFireability-10
lola: time limit : 1700 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 5/1700 7/32 ShieldPPPs-PT-100A-LTLFireability-10 258965 m, 51793 m/sec, 343393 t fired, .

Time elapsed: 204 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 10/1700 14/32 ShieldPPPs-PT-100A-LTLFireability-10 524557 m, 53118 m/sec, 690695 t fired, .

Time elapsed: 209 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 15/1700 21/32 ShieldPPPs-PT-100A-LTLFireability-10 805095 m, 56107 m/sec, 1047557 t fired, .

Time elapsed: 214 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 20/1700 28/32 ShieldPPPs-PT-100A-LTLFireability-10 1085124 m, 56005 m/sec, 1404705 t fired, .

Time elapsed: 219 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 17 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 224 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 20 (type EXCL) for 19 ShieldPPPs-PT-100A-LTLFireability-15
lola: time limit : 3376 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 5/3376 4/32 ShieldPPPs-PT-100A-LTLFireability-15 223793 m, 44758 m/sec, 382336 t fired, .

Time elapsed: 229 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 10/3376 7/32 ShieldPPPs-PT-100A-LTLFireability-15 454597 m, 46160 m/sec, 781046 t fired, .

Time elapsed: 234 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 15/3376 11/32 ShieldPPPs-PT-100A-LTLFireability-15 684975 m, 46075 m/sec, 1177638 t fired, .

Time elapsed: 239 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 20/3376 14/32 ShieldPPPs-PT-100A-LTLFireability-15 918979 m, 46800 m/sec, 1575333 t fired, .

Time elapsed: 244 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 25/3376 17/32 ShieldPPPs-PT-100A-LTLFireability-15 1143038 m, 44811 m/sec, 1971976 t fired, .

Time elapsed: 249 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 30/3376 21/32 ShieldPPPs-PT-100A-LTLFireability-15 1369856 m, 45363 m/sec, 2370828 t fired, .

Time elapsed: 254 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 35/3376 24/32 ShieldPPPs-PT-100A-LTLFireability-15 1598179 m, 45664 m/sec, 2771808 t fired, .

Time elapsed: 259 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 40/3376 27/32 ShieldPPPs-PT-100A-LTLFireability-15 1825169 m, 45398 m/sec, 3171182 t fired, .

Time elapsed: 264 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 45/3376 30/32 ShieldPPPs-PT-100A-LTLFireability-15 2059374 m, 46841 m/sec, 3568712 t fired, .

Time elapsed: 269 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 20 (type EXCL) for ShieldPPPs-PT-100A-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-100A-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-100A-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100A-LTLFireability-00: CONJ false state space / EG
ShieldPPPs-PT-100A-LTLFireability-03: LTL unknown AGGR
ShieldPPPs-PT-100A-LTLFireability-06: LTL unknown AGGR
ShieldPPPs-PT-100A-LTLFireability-07: LTL unknown AGGR
ShieldPPPs-PT-100A-LTLFireability-10: LTL unknown AGGR
ShieldPPPs-PT-100A-LTLFireability-15: LTL unknown AGGR


Time elapsed: 274 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="ShieldPPPs-PT-100A"
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 ShieldPPPs-PT-100A, 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-167903715400516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100A.tgz
mv ShieldPPPs-PT-100A 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 ;