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.r389-oct2-167903713000028.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 itstools
Input is ShieldIIPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713000028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679164425313

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 18:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 18:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:33:47] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-18 18:33:47] [INFO ] Transformed 123 places.
[2023-03-18 18:33:47] [INFO ] Transformed 121 transitions.
[2023-03-18 18:33:47] [INFO ] Found NUPN structural information;
[2023-03-18 18:33:47] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 116 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 116 transition count 114
Applied a total of 14 rules in 33 ms. Remains 116 /123 variables (removed 7) and now considering 114/121 (removed 7) transitions.
// Phase 1: matrix 114 rows 116 cols
[2023-03-18 18:33:48] [INFO ] Computed 19 place invariants in 13 ms
[2023-03-18 18:33:48] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-18 18:33:48] [INFO ] Invariant cache hit.
[2023-03-18 18:33:49] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-18 18:33:49] [INFO ] Invariant cache hit.
[2023-03-18 18:33:49] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/123 places, 114/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1407 ms. Remains : 116/123 places, 114/121 transitions.
Support contains 35 out of 116 places after structural reductions.
[2023-03-18 18:33:49] [INFO ] Flatten gal took : 59 ms
[2023-03-18 18:33:49] [INFO ] Flatten gal took : 14 ms
[2023-03-18 18:33:49] [INFO ] Input system was already deterministic with 114 transitions.
Support contains 33 out of 116 places (down from 35) after GAL structural reductions.
Finished random walk after 4404 steps, including 12 resets, run visited all 32 properties in 63 ms. (steps per millisecond=69 )
Computed a total of 27 stabilizing places and 27 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' '!(G(F(p0)))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 87 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 85 transition count 83
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 124 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 50 transition count 49
Applied a total of 127 rules in 54 ms. Remains 50 /116 variables (removed 66) and now considering 49/114 (removed 65) transitions.
// Phase 1: matrix 49 rows 50 cols
[2023-03-18 18:33:50] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:33:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 18:33:50] [INFO ] Invariant cache hit.
[2023-03-18 18:33:50] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-18 18:33:50] [INFO ] Redundant transitions in 30 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 48 rows 50 cols
[2023-03-18 18:33:50] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-18 18:33:51] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/116 places, 48/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 50/116 places, 48/114 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-00 finished in 771 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)||(p1&&F(p2))) U X(G(!p0))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 12 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 108 cols
[2023-03-18 18:33:51] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 18:33:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 18:33:51] [INFO ] Invariant cache hit.
[2023-03-18 18:33:51] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-18 18:33:51] [INFO ] Invariant cache hit.
[2023-03-18 18:33:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 421 ms :[p0, (AND (NOT p2) p0), p0, false, false, true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(NEQ s10 1), p2:(EQ s5 1), p1:(OR (EQ s11 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-02 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((p1||X(p2)))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 17 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
[2023-03-18 18:33:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 18:33:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-18 18:33:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (EQ s73 0) (EQ s97 0)), p0:(AND (EQ s73 1) (EQ s97 1)), p1:(EQ s104 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 981 steps with 3 reset in 12 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-03 finished in 457 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((X(p0)||(G(p2)&&p1))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Applied a total of 12 rules in 6 ms. Remains 110 /116 variables (removed 6) and now considering 108/114 (removed 6) transitions.
// Phase 1: matrix 108 rows 110 cols
[2023-03-18 18:33:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 18:33:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-18 18:33:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 18:33:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/116 places, 108/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 110/116 places, 108/114 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s71 1) (EQ s87 1)), p2:(EQ s82 1), p0:(AND (EQ s77 1) (EQ s87 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-04 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||G(p1))))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 4 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-18 18:33:52] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-18 18:33:53] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-18 18:33:53] [INFO ] Invariant cache hit.
[2023-03-18 18:33:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 18:33:53] [INFO ] Invariant cache hit.
[2023-03-18 18:33:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s17 0), p1:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1409 steps with 4 reset in 19 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-05 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 4 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-18 18:33:53] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-18 18:33:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 18:33:53] [INFO ] Invariant cache hit.
[2023-03-18 18:33:53] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 18:33:53] [INFO ] Invariant cache hit.
[2023-03-18 18:33:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s105 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/109 stabilizing places and 23/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-06 finished in 973 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((F(p0)&&X(G(p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 115 transition count 103
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 105 transition count 103
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 105 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 94 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 88 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 88 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 88 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 52 transition count 51
Applied a total of 123 rules in 13 ms. Remains 52 /116 variables (removed 64) and now considering 51/114 (removed 63) transitions.
// Phase 1: matrix 51 rows 52 cols
[2023-03-18 18:33:54] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-18 18:33:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 18:33:54] [INFO ] Invariant cache hit.
[2023-03-18 18:33:54] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 18:33:54] [INFO ] Redundant transitions in 69 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2023-03-18 18:33:54] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:33:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/116 places, 50/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 405 ms. Remains : 52/116 places, 50/114 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6627 steps with 226 reset in 7 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-07 finished in 542 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 3 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-18 18:33:55] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 18:33:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 18:33:55] [INFO ] Invariant cache hit.
[2023-03-18 18:33:56] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-18 18:33:56] [INFO ] Invariant cache hit.
[2023-03-18 18:33:56] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1424 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-08 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:(EQ s81 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-08 finished in 2163 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(G(p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 5 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 108 cols
[2023-03-18 18:33:57] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 18:33:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 18:33:57] [INFO ] Invariant cache hit.
[2023-03-18 18:33:57] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-18 18:33:57] [INFO ] Invariant cache hit.
[2023-03-18 18:33:57] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s53 0), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-09 finished in 587 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||((p0 U p2)&&p1))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 115 transition count 104
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 106 transition count 104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 106 transition count 94
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 96 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 90 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 90 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 90 transition count 86
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 88 transition count 86
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 114 place count 58 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 56 transition count 54
Applied a total of 116 rules in 22 ms. Remains 56 /116 variables (removed 60) and now considering 54/114 (removed 60) transitions.
// Phase 1: matrix 54 rows 56 cols
[2023-03-18 18:33:57] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 18:33:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 18:33:57] [INFO ] Invariant cache hit.
[2023-03-18 18:33:58] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-18 18:33:58] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-18 18:33:58] [INFO ] Invariant cache hit.
[2023-03-18 18:33:58] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/116 places, 54/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 56/116 places, 54/114 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1), p1:(AND (EQ s40 1) (EQ s50 1) (EQ s55 1) (EQ s17 1)), p2:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25600 reset in 140 ms.
Product exploration explored 100000 steps with 25748 reset in 231 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/56 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
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) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 394 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-18 18:33:59] [INFO ] Invariant cache hit.
[2023-03-18 18:33:59] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-18 18:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:33:59] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-18 18:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:33:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-18 18:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:33:59] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-18 18:33:59] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
[2023-03-18 18:33:59] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-18 18:33:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-18 18:33:59] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 4 ms.
[2023-03-18 18:34:00] [INFO ] Added : 24 causal constraints over 5 iterations in 130 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-18 18:34:00] [INFO ] Invariant cache hit.
[2023-03-18 18:34:00] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-18 18:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-18 18:34:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:34:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-18 18:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:00] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-18 18:34:00] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2023-03-18 18:34:00] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 14 ms to minimize.
[2023-03-18 18:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-18 18:34:00] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-18 18:34:00] [INFO ] Added : 30 causal constraints over 7 iterations in 94 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-18 18:34:00] [INFO ] Invariant cache hit.
[2023-03-18 18:34:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 18:34:00] [INFO ] Invariant cache hit.
[2023-03-18 18:34:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-18 18:34:00] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 18:34:00] [INFO ] Invariant cache hit.
[2023-03-18 18:34:00] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 56/56 places, 54/54 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/56 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 2 factoid took 239 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 358 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-18 18:34:01] [INFO ] Invariant cache hit.
[2023-03-18 18:34:01] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-18 18:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:01] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-18 18:34:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:34:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-18 18:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:01] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 18:34:01] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-18 18:34:01] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-18 18:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-18 18:34:01] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 4 ms.
[2023-03-18 18:34:01] [INFO ] Added : 24 causal constraints over 5 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-18 18:34:02] [INFO ] Invariant cache hit.
[2023-03-18 18:34:02] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-18 18:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 18:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 18:34:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-18 18:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 18:34:02] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 18:34:02] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2023-03-18 18:34:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-18 18:34:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-18 18:34:02] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 3 ms.
[2023-03-18 18:34:02] [INFO ] Added : 30 causal constraints over 7 iterations in 96 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 61 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 25886 reset in 105 ms.
Product exploration explored 100000 steps with 25554 reset in 150 ms.
Built C files in :
/tmp/ltsmin16478399000970048199
[2023-03-18 18:34:02] [INFO ] Computing symmetric may disable matrix : 54 transitions.
[2023-03-18 18:34:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:02] [INFO ] Computing symmetric may enable matrix : 54 transitions.
[2023-03-18 18:34:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:02] [INFO ] Computing Do-Not-Accords matrix : 54 transitions.
[2023-03-18 18:34:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16478399000970048199
Running compilation step : cd /tmp/ltsmin16478399000970048199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin16478399000970048199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin16478399000970048199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5719511249090410472.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-002B-LTLFireability-10 finished in 5523 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((F(p0)||(p0 U p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 86 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 86 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 58 place count 86 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 84 transition count 82
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 120 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 52 transition count 51
Applied a total of 123 rules in 25 ms. Remains 52 /116 variables (removed 64) and now considering 51/114 (removed 63) transitions.
// Phase 1: matrix 51 rows 52 cols
[2023-03-18 18:34:03] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:34:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 18:34:03] [INFO ] Invariant cache hit.
[2023-03-18 18:34:03] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-18 18:34:03] [INFO ] Redundant transitions in 19 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2023-03-18 18:34:03] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-18 18:34:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/116 places, 50/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 291 ms. Remains : 52/116 places, 50/114 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 140 steps with 1 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-12 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(X((G(p2)&&(p3||X(p1))))))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 2 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-18 18:34:03] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-18 18:34:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 18:34:03] [INFO ] Invariant cache hit.
[2023-03-18 18:34:04] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-18 18:34:04] [INFO ] Invariant cache hit.
[2023-03-18 18:34:04] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 767 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) p2), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p2 (NOT p3)), (NOT p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 5}], [{ cond=(NOT p2), acceptance={} source=10 dest: 3}, { cond=p2, acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=12 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s41 1), p0:(EQ s8 1), p2:(EQ s34 1), p3:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-13 finished in 1211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p1)&&G((p1||(p2 U (p3||G(p2)))))))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 115 transition count 103
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 105 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 105 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 95 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 90 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 90 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 90 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 89 transition count 87
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 118 place count 56 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 54 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 53 transition count 52
Applied a total of 121 rules in 22 ms. Remains 53 /116 variables (removed 63) and now considering 52/114 (removed 62) transitions.
// Phase 1: matrix 52 rows 53 cols
[2023-03-18 18:34:05] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:34:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 18:34:05] [INFO ] Invariant cache hit.
[2023-03-18 18:34:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-18 18:34:05] [INFO ] Redundant transitions in 16 ms returned [51]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 51 rows 53 cols
[2023-03-18 18:34:05] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-18 18:34:05] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/116 places, 51/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 53/116 places, 51/114 transitions.
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 5}, { cond=(OR p1 p3 p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=6 dest: 4}, { cond=(OR p1 p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s26 0), p3:(AND (NOT (AND (EQ s12 1) (EQ s23 1) (EQ s29 1))) (NEQ s42 1)), p2:(NEQ s42 1), p0:(EQ s42 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3720 reset in 255 ms.
Product exploration explored 100000 steps with 3665 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR p1 p3 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR p1 p3 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1571 ms. Reduced automaton from 7 states, 26 edges and 4 AP (stutter insensitive) to 7 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 538 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 18:34:08] [INFO ] Invariant cache hit.
[2023-03-18 18:34:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:34:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-18 18:34:08] [INFO ] After 40ms 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 p1 p3 p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (OR p1 p3 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (OR p1 p3 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2))))), (G (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (G (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p2 (NOT p0))))), (G (NOT (AND p1 (NOT p3) p2 (NOT p0))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p3) (AND (NOT p1) p2))), (F (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (OR p1 p3 p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p3) (NOT p2) (NOT p0)))]
Knowledge based reduction with 26 factoid took 2447 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 18:34:11] [INFO ] Invariant cache hit.
[2023-03-18 18:34:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 18:34:11] [INFO ] Invariant cache hit.
[2023-03-18 18:34:11] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-18 18:34:11] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-18 18:34:11] [INFO ] Invariant cache hit.
[2023-03-18 18:34:11] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 53/53 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X (OR p0 (NOT p2) p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (X (OR p0 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 551 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:34:12] [INFO ] Invariant cache hit.
[2023-03-18 18:34:12] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:34:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-18 18:34:12] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p3 p1), (X (OR p0 (NOT p2) p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (X (OR p0 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (G (OR p0 (NOT p2) p3))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))]
Knowledge based reduction with 10 factoid took 472 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3639 reset in 139 ms.
Product exploration explored 100000 steps with 3682 reset in 156 ms.
Built C files in :
/tmp/ltsmin9346815613337895207
[2023-03-18 18:34:14] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2023-03-18 18:34:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:14] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2023-03-18 18:34:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:14] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2023-03-18 18:34:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9346815613337895207
Running compilation step : cd /tmp/ltsmin9346815613337895207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin9346815613337895207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9346815613337895207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2945949605400417461.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 53 transition count 49
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 49
Applied a total of 4 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2023-03-18 18:34:29] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:34:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 18:34:29] [INFO ] Invariant cache hit.
[2023-03-18 18:34:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-18 18:34:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-18 18:34:29] [INFO ] Invariant cache hit.
[2023-03-18 18:34:29] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/53 places, 49/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 51/53 places, 49/51 transitions.
Built C files in :
/tmp/ltsmin4320852341585646732
[2023-03-18 18:34:29] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2023-03-18 18:34:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:29] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2023-03-18 18:34:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:29] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2023-03-18 18:34:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 18:34:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4320852341585646732
Running compilation step : cd /tmp/ltsmin4320852341585646732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 176 ms.
Running link step : cd /tmp/ltsmin4320852341585646732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4320852341585646732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15129488453543599218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 18:34:44] [INFO ] Flatten gal took : 4 ms
[2023-03-18 18:34:44] [INFO ] Flatten gal took : 3 ms
[2023-03-18 18:34:44] [INFO ] Time to serialize gal into /tmp/LTL8491735140594458312.gal : 2 ms
[2023-03-18 18:34:44] [INFO ] Time to serialize properties into /tmp/LTL11000336646324493511.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8491735140594458312.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13158264636327172085.hoa' '-atoms' '/tmp/LTL11000336646324493511.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11000336646324493511.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13158264636327172085.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t75, t2, t4, t6, t8, t9, t10, t12, t13.t49, t15, t16, t18, t19, t21, t23, t37, t101.t1, t9...463
Computing Next relation with stutter on 22 deadlock states
64 unique states visited
0 strongly connected components in search stack
70 transitions explored
36 items max in DFS search stack
720 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.2254,251372,1,0,1191,1.17106e+06,139,821,1810,1.8873e+06,3067
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-002B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPs-PT-002B-LTLFireability-14 finished in 48756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 87 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 87 transition count 83
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 85 transition count 83
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 124 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 50 transition count 49
Applied a total of 127 rules in 36 ms. Remains 50 /116 variables (removed 66) and now considering 49/114 (removed 65) transitions.
// Phase 1: matrix 49 rows 50 cols
[2023-03-18 18:34:53] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-18 18:34:53] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-18 18:34:53] [INFO ] Invariant cache hit.
[2023-03-18 18:34:54] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-18 18:34:54] [INFO ] Redundant transitions in 20 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 48 rows 50 cols
[2023-03-18 18:34:54] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-18 18:34:54] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/116 places, 48/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 50/116 places, 48/114 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 224 steps with 1 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-15 finished in 455 ms.
All properties solved by simple procedures.
Total runtime 66448 ms.

BK_STOP 1679164494504

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-PT-002B, 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 r389-oct2-167903713000028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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