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-167903715000188.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 ShieldIIPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715000188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679269673144

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=ShieldIIPt-PT-001B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:47:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:47:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:47:57] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-19 23:47:57] [INFO ] Transformed 73 places.
[2023-03-19 23:47:57] [INFO ] Transformed 68 transitions.
[2023-03-19 23:47:57] [INFO ] Found NUPN structural information;
[2023-03-19 23:47:57] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-001B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 65
Applied a total of 6 rules in 46 ms. Remains 70 /73 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 70 cols
[2023-03-19 23:47:57] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-19 23:47:57] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-19 23:47:57] [INFO ] Invariant cache hit.
[2023-03-19 23:47:57] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-19 23:47:57] [INFO ] Invariant cache hit.
[2023-03-19 23:47:58] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/73 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 70/73 places, 65/68 transitions.
Support contains 30 out of 70 places after structural reductions.
[2023-03-19 23:47:58] [INFO ] Flatten gal took : 41 ms
[2023-03-19 23:47:58] [INFO ] Flatten gal took : 8 ms
[2023-03-19 23:47:58] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:47:58] [INFO ] Invariant cache hit.
[2023-03-19 23:47:58] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-19 23:47:58] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-001B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldIIPt-PT-001B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(p1)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Applied a total of 18 rules in 7 ms. Remains 61 /70 variables (removed 9) and now considering 56/65 (removed 9) transitions.
// Phase 1: matrix 56 rows 61 cols
[2023-03-19 23:47:59] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 23:47:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 23:47:59] [INFO ] Invariant cache hit.
[2023-03-19 23:47:59] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-19 23:47:59] [INFO ] Invariant cache hit.
[2023-03-19 23:47:59] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 56/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 61/70 places, 56/65 transitions.
Stuttering acceptance computed with spot in 540 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s42 0), p1:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 342 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/61 stabilizing places and 14/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 377 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 463 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 23:48:02] [INFO ] Invariant cache hit.
[2023-03-19 23:48:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-19 23:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:02] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-19 23:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-19 23:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-19 23:48:03] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 23:48:03] [INFO ] Added : 54 causal constraints over 11 iterations in 114 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-19 23:48:03] [INFO ] Invariant cache hit.
[2023-03-19 23:48:03] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 23:48:03] [INFO ] Invariant cache hit.
[2023-03-19 23:48:03] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-19 23:48:03] [INFO ] Invariant cache hit.
[2023-03-19 23:48:03] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 61/61 places, 56/56 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/61 stabilizing places and 14/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 434 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 23:48:05] [INFO ] Invariant cache hit.
[2023-03-19 23:48:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-19 23:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:05] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-19 23:48:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-19 23:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:05] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-19 23:48:05] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 23:48:05] [INFO ] Added : 54 causal constraints over 11 iterations in 144 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 169 ms.
Product exploration explored 100000 steps with 3 reset in 171 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-19 23:48:06] [INFO ] Invariant cache hit.
[2023-03-19 23:48:06] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 23:48:06] [INFO ] Invariant cache hit.
[2023-03-19 23:48:06] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-19 23:48:06] [INFO ] Invariant cache hit.
[2023-03-19 23:48:06] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 61/61 places, 56/56 transitions.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-00 finished in 7653 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))&&(p1||G(F(p2))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 57
Applied a total of 16 rules in 13 ms. Remains 62 /70 variables (removed 8) and now considering 57/65 (removed 8) transitions.
// Phase 1: matrix 57 rows 62 cols
[2023-03-19 23:48:06] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-19 23:48:07] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-19 23:48:07] [INFO ] Invariant cache hit.
[2023-03-19 23:48:07] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-19 23:48:07] [INFO ] Invariant cache hit.
[2023-03-19 23:48:07] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/70 places, 57/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 62/70 places, 57/65 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s2 1), p2:(EQ s34 1), p0:(EQ s56 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]]
Stuttering criterion allowed to conclude after 71312 steps with 0 reset in 120 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-01 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 8 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2023-03-19 23:48:07] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 23:48:08] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 23:48:08] [INFO ] Invariant cache hit.
[2023-03-19 23:48:08] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-19 23:48:08] [INFO ] Invariant cache hit.
[2023-03-19 23:48:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 55/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-02 finished in 702 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 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 49
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 53 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 53 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 48 transition count 42
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 43 transition count 37
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 43 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 53 place count 43 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 39 transition count 33
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 93 place count 23 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 21 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 20 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 19 transition count 17
Applied a total of 99 rules in 63 ms. Remains 19 /70 variables (removed 51) and now considering 17/65 (removed 48) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-19 23:48:08] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-19 23:48:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 23:48:08] [INFO ] Invariant cache hit.
[2023-03-19 23:48:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-19 23:48:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 23:48:08] [INFO ] Invariant cache hit.
[2023-03-19 23:48:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/70 places, 17/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 19/70 places, 17/65 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-03 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 s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-03 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 69 transition count 51
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 55 transition count 49
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 29 place count 55 transition count 42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 43 place count 48 transition count 42
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 42 transition count 36
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 42 transition count 36
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 55 place count 42 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 63 place count 38 transition count 32
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 91 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 22 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 21 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 98 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 18 transition count 17
Applied a total of 100 rules in 28 ms. Remains 18 /70 variables (removed 52) and now considering 17/65 (removed 48) transitions.
// Phase 1: matrix 17 rows 18 cols
[2023-03-19 23:48:08] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-19 23:48:09] [INFO ] Implicit Places using invariants in 44 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/70 places, 17/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 17/70 places, 17/65 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s10 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-04 finished in 138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p1)||X(F(p2))||G(p0)))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 5 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2023-03-19 23:48:09] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 23:48:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 23:48:09] [INFO ] Invariant cache hit.
[2023-03-19 23:48:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-19 23:48:09] [INFO ] Invariant cache hit.
[2023-03-19 23:48:09] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 63/70 places, 58/65 transitions.
Stuttering acceptance computed with spot in 385 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(NEQ s5 1), p0:(NEQ s31 1), p1:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 236 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/63 stabilizing places and 16/58 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 711 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 23:48:11] [INFO ] Invariant cache hit.
[2023-03-19 23:48:11] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-19 23:48:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-19 23:48:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-19 23:48:11] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 11 factoid took 363 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-001B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-001B-LTLFireability-05 finished in 3144 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&&X(p1)))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Applied a total of 18 rules in 11 ms. Remains 61 /70 variables (removed 9) and now considering 56/65 (removed 9) transitions.
// Phase 1: matrix 56 rows 61 cols
[2023-03-19 23:48:12] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-19 23:48:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-19 23:48:12] [INFO ] Invariant cache hit.
[2023-03-19 23:48:12] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-19 23:48:12] [INFO ] Invariant cache hit.
[2023-03-19 23:48:12] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 56/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 61/70 places, 56/65 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s29 1), p1:(AND (EQ s14 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 27853 steps with 40 reset in 60 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-07 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1&&F(p2))))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2023-03-19 23:48:12] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-19 23:48:12] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 23:48:12] [INFO ] Invariant cache hit.
[2023-03-19 23:48:13] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-19 23:48:13] [INFO ] Invariant cache hit.
[2023-03-19 23:48:13] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 55/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s37 1)), p1:(NEQ s6 1), p2:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-10 finished in 770 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||X(G(p1)))) U (p2&&G((!p0||X(G(p1))))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 58
Applied a total of 14 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 63 cols
[2023-03-19 23:48:13] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 23:48:14] [INFO ] Implicit Places using invariants in 890 ms returned []
[2023-03-19 23:48:14] [INFO ] Invariant cache hit.
[2023-03-19 23:48:14] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-03-19 23:48:14] [INFO ] Invariant cache hit.
[2023-03-19 23:48:14] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 58/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1321 ms. Remains : 63/70 places, 58/65 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p1), (AND p0 (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s38 1), p0:(EQ s46 1), p1:(NEQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-12 finished in 1635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 70 transition count 51
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 55 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 31 place count 55 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 49 transition count 43
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 43 transition count 37
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 43 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 55 place count 43 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 63 place count 39 transition count 33
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 22 transition count 19
Applied a total of 97 rules in 23 ms. Remains 22 /70 variables (removed 48) and now considering 19/65 (removed 46) transitions.
// Phase 1: matrix 19 rows 22 cols
[2023-03-19 23:48:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants in 152 ms returned [13, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 155 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/70 places, 19/65 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 20 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 18
Applied a total of 2 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-19 23:48:15] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants in 72 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/70 places, 18/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 17 cols
[2023-03-19 23:48:15] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 23:48:15] [INFO ] Invariant cache hit.
[2023-03-19 23:48:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/70 places, 17/65 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 434 ms. Remains : 17/70 places, 17/65 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-13 finished in 508 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 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 2 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2023-03-19 23:48:15] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-19 23:48:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 23:48:15] [INFO ] Invariant cache hit.
[2023-03-19 23:48:16] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 23:48:16] [INFO ] Invariant cache hit.
[2023-03-19 23:48:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/70 places, 55/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-14 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:(NEQ s39 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 33333 reset in 93 ms.
Product exploration explored 100000 steps with 33333 reset in 82 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-001B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-001B-LTLFireability-14 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1||G(F(p0))))))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Applied a total of 18 rules in 3 ms. Remains 61 /70 variables (removed 9) and now considering 56/65 (removed 9) transitions.
// Phase 1: matrix 56 rows 61 cols
[2023-03-19 23:48:16] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-19 23:48:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 23:48:16] [INFO ] Invariant cache hit.
[2023-03-19 23:48:16] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 23:48:16] [INFO ] Invariant cache hit.
[2023-03-19 23:48:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/70 places, 56/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 61/70 places, 56/65 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s37 1)), p1:(EQ s59 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 4685 reset in 81 ms.
Product exploration explored 100000 steps with 4682 reset in 87 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 23:48:18] [INFO ] Invariant cache hit.
[2023-03-19 23:48:18] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-19 23:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:18] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-19 23:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-19 23:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:18] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-19 23:48:18] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 23:48:18] [INFO ] Added : 54 causal constraints over 11 iterations in 343 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2023-03-19 23:48:18] [INFO ] Invariant cache hit.
[2023-03-19 23:48:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-19 23:48:18] [INFO ] Invariant cache hit.
[2023-03-19 23:48:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-19 23:48:19] [INFO ] Invariant cache hit.
[2023-03-19 23:48:19] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 61/61 places, 56/56 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 23:48:19] [INFO ] Invariant cache hit.
[2023-03-19 23:48:20] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2023-03-19 23:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-19 23:48:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-19 23:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-19 23:48:20] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 23:48:20] [INFO ] Added : 54 causal constraints over 11 iterations in 183 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4688 reset in 126 ms.
Product exploration explored 100000 steps with 4683 reset in 101 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 61 transition count 56
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 8 place count 61 transition count 61
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 61 transition count 61
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 34 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 61 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 42 place count 54 transition count 53
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 54 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 54 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 52 transition count 51
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 52 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 52 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 48 transition count 56
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 48 transition count 56
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 65 rules in 39 ms. Remains 48 /61 variables (removed 13) and now considering 56/56 (removed 0) transitions.
[2023-03-19 23:48:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 48 cols
[2023-03-19 23:48:21] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-19 23:48:21] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/61 places, 56/56 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 48/61 places, 56/56 transitions.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 61 cols
[2023-03-19 23:48:21] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 23:48:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 23:48:21] [INFO ] Invariant cache hit.
[2023-03-19 23:48:21] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-19 23:48:21] [INFO ] Invariant cache hit.
[2023-03-19 23:48:22] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 61/61 places, 56/56 transitions.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-15 finished in 5469 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)&&X(p1)))))'
Found a Shortening insensitive property : ShieldIIPt-PT-001B-LTLFireability-00
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 69 transition count 51
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 54 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 31 place count 54 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 43 place count 48 transition count 42
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 47 place count 44 transition count 38
Iterating global reduction 4 with 4 rules applied. Total rules applied 51 place count 44 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 51 place count 44 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 41 transition count 35
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 89 place count 25 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 23 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 22 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 20 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 96 place count 20 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 19 transition count 18
Applied a total of 98 rules in 7 ms. Remains 19 /70 variables (removed 51) and now considering 18/65 (removed 47) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-19 23:48:22] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-19 23:48:22] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/70 places, 18/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 17 cols
[2023-03-19 23:48:22] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-19 23:48:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 23:48:22] [INFO ] Invariant cache hit.
[2023-03-19 23:48:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 23:48:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 17/70 places, 17/65 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 171 ms. Remains : 17/70 places, 17/65 transitions.
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s11 0), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-00 finished in 490 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p1||G(F(p0))))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-001B-LTLFireability-15
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 69 transition count 51
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 55 transition count 49
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 29 place count 55 transition count 42
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 43 place count 48 transition count 42
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 43 transition count 37
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 43 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 53 place count 43 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 40 transition count 34
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 89 place count 25 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 23 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 96 place count 20 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 19 transition count 17
Applied a total of 98 rules in 6 ms. Remains 19 /70 variables (removed 51) and now considering 17/65 (removed 48) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-19 23:48:22] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-19 23:48:22] [INFO ] Implicit Places using invariants in 39 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 18/70 places, 17/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 58 ms. Remains : 18/70 places, 17/65 transitions.
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s10 1)), p1:(EQ s17 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 23175 reset in 81 ms.
Product exploration explored 100000 steps with 23341 reset in 94 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 (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 17 rows 18 cols
[2023-03-19 23:48:23] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-19 23:48:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-19 23:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-19 23:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 53 ms returned sat
[2023-03-19 23:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-19 23:48:24] [INFO ] Computed and/alt/rep : 14/24/14 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-19 23:48:24] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-19 23:48:24] [INFO ] Invariant cache hit.
[2023-03-19 23:48:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 23:48:24] [INFO ] Invariant cache hit.
[2023-03-19 23:48:24] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-19 23:48:24] [INFO ] Invariant cache hit.
[2023-03-19 23:48:24] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 18/18 places, 17/17 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 p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 212 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 23:48:25] [INFO ] Invariant cache hit.
[2023-03-19 23:48:26] [INFO ] [Real]Absence check using 7 positive place invariants in 49 ms returned sat
[2023-03-19 23:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:26] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-19 23:48:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 23:48:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-19 23:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 23:48:26] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 33 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-19 23:48:27] [INFO ] Computed and/alt/rep : 14/24/14 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-19 23:48:27] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23457 reset in 100 ms.
Product exploration explored 100000 steps with 23235 reset in 99 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-19 23:48:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 23:48:27] [INFO ] Invariant cache hit.
[2023-03-19 23:48:28] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 18/18 places, 17/17 transitions.
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-19 23:48:28] [INFO ] Invariant cache hit.
[2023-03-19 23:48:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 23:48:28] [INFO ] Invariant cache hit.
[2023-03-19 23:48:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-19 23:48:28] [INFO ] Invariant cache hit.
[2023-03-19 23:48:28] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 18/18 places, 17/17 transitions.
Treatment of property ShieldIIPt-PT-001B-LTLFireability-15 finished in 5788 ms.
[2023-03-19 23:48:28] [INFO ] Flatten gal took : 6 ms
[2023-03-19 23:48:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 23:48:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 65 transitions and 162 arcs took 1 ms.
Total runtime 31344 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-001B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
LTLFireability

FORMULA ShieldIIPt-PT-001B-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001B-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679269708805

--------------------
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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-001B-LTLFireability-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldIIPt-PT-001B-LTLFireability-15
lola: result : true
lola: markings : 2913
lola: fired transitions : 17074
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-001B-LTLFireability-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldIIPt-PT-001B-LTLFireability-00
lola: result : false
lola: markings : 39
lola: fired transitions : 39
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-001B-LTLFireability-00: LTL false LTL model checker
ShieldIIPt-PT-001B-LTLFireability-15: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-001B"
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 ShieldIIPt-PT-001B, 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-167903715000188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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