Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974700012.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974700012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:22 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 13K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679159674815

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=ShieldRVs-PT-001B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 17:14:36] [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 17:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:14:36] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-18 17:14:36] [INFO ] Transformed 43 places.
[2023-03-18 17:14:36] [INFO ] Transformed 48 transitions.
[2023-03-18 17:14:36] [INFO ] Found NUPN structural information;
[2023-03-18 17:14:36] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-001B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 46
Applied a total of 4 rules in 29 ms. Remains 41 /43 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 41 cols
[2023-03-18 17:14:37] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-18 17:14:37] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-18 17:14:37] [INFO ] Invariant cache hit.
[2023-03-18 17:14:37] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-18 17:14:37] [INFO ] Invariant cache hit.
[2023-03-18 17:14:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/43 places, 46/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 41/43 places, 46/48 transitions.
Support contains 25 out of 41 places after structural reductions.
[2023-03-18 17:14:37] [INFO ] Flatten gal took : 23 ms
[2023-03-18 17:14:37] [INFO ] Flatten gal took : 7 ms
[2023-03-18 17:14:37] [INFO ] Input system was already deterministic with 46 transitions.
Finished random walk after 2011 steps, including 2 resets, run visited all 27 properties in 101 ms. (steps per millisecond=19 )
FORMULA ShieldRVs-PT-001B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2023-03-18 17:14:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 17:14:38] [INFO ] Invariant cache hit.
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 17:14:38] [INFO ] Invariant cache hit.
[2023-03-18 17:14:38] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-01 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:(AND (EQ s3 1) (EQ s13 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3144 steps with 96 reset in 28 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-01 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 4 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2023-03-18 17:14:38] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 17:14:38] [INFO ] Invariant cache hit.
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-18 17:14:38] [INFO ] Invariant cache hit.
[2023-03-18 17:14:38] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s21 0) (OR (EQ s3 0) (EQ s11 0) (EQ s33 0))), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-03 finished in 300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 30 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 25 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 25 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 25 transition count 28
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 34 place count 23 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 15 transition count 20
Applied a total of 49 rules in 18 ms. Remains 15 /41 variables (removed 26) and now considering 20/46 (removed 26) transitions.
// Phase 1: matrix 20 rows 15 cols
[2023-03-18 17:14:38] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 17:14:38] [INFO ] Invariant cache hit.
[2023-03-18 17:14:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 17:14:38] [INFO ] Redundant transitions in 21 ms returned [19]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 19 rows 15 cols
[2023-03-18 17:14:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/41 places, 19/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 15/41 places, 19/46 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 272 steps with 7 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-04 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||G(p2))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 2 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2023-03-18 17:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 17:14:39] [INFO ] Invariant cache hit.
[2023-03-18 17:14:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 17:14:39] [INFO ] Invariant cache hit.
[2023-03-18 17:14:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(EQ s5 0), p0:(EQ s16 0), p2:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Product exploration explored 100000 steps with 25000 reset in 111 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 446 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 17:14:40] [INFO ] Invariant cache hit.
[2023-03-18 17:14:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:14:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-18 17:14:40] [INFO ] After 34ms 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 p1 p0 (NOT p2)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p0))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 543 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-18 17:14:41] [INFO ] Invariant cache hit.
[2023-03-18 17:14:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 17:14:41] [INFO ] Invariant cache hit.
[2023-03-18 17:14:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 17:14:41] [INFO ] Invariant cache hit.
[2023-03-18 17:14:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 36/36 places, 41/41 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 345 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 17:14:41] [INFO ] Invariant cache hit.
[2023-03-18 17:14:41] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:14:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-18 17:14:41] [INFO ] After 22ms 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 p1 p0 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 (NOT p2) p0))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 591 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 36 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 35 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 35 transition count 40
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 18 place count 35 transition count 40
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 29 transition count 34
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 29 transition count 34
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 30 rules in 10 ms. Remains 29 /36 variables (removed 7) and now considering 34/41 (removed 7) transitions.
[2023-03-18 17:14:43] [INFO ] Redundant transitions in 18 ms returned [33]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 33 rows 29 cols
[2023-03-18 17:14:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/36 places, 33/41 transitions.
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 29/36 places, 33/41 transitions.
Built C files in :
/tmp/ltsmin17212347332043962359
[2023-03-18 17:14:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17212347332043962359
Running compilation step : cd /tmp/ltsmin17212347332043962359;'/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 251 ms.
Running link step : cd /tmp/ltsmin17212347332043962359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17212347332043962359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2454523525977744014.hoa' '--buchi-type=spotba'
LTSmin run took 591 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001B-LTLFireability-05 finished in 5444 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 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 40 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 37 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 26 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 26 transition count 30
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 30 place count 25 transition count 30
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 17 transition count 22
Applied a total of 45 rules in 6 ms. Remains 17 /41 variables (removed 24) and now considering 22/46 (removed 24) transitions.
// Phase 1: matrix 22 rows 17 cols
[2023-03-18 17:14:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 17:14:44] [INFO ] Invariant cache hit.
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-18 17:14:44] [INFO ] Redundant transitions in 12 ms returned [21]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 21 rows 17 cols
[2023-03-18 17:14:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:44] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/41 places, 21/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 17/41 places, 21/46 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-06 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 s6 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 107 steps with 15 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-06 finished in 170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)||(G(p3)&&p2)))))'
Support contains 4 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 40 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 37 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 33 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 29 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 29 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 21 transition count 26
Applied a total of 38 rules in 6 ms. Remains 21 /41 variables (removed 20) and now considering 26/46 (removed 20) transitions.
// Phase 1: matrix 26 rows 21 cols
[2023-03-18 17:14:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 17:14:44] [INFO ] Invariant cache hit.
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 17:14:44] [INFO ] Redundant transitions in 12 ms returned [25]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 25 rows 21 cols
[2023-03-18 17:14:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/41 places, 25/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 21/41 places, 25/46 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s3 1), p3:(EQ s20 1), p2:(AND (EQ s12 1) (EQ s18 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 31 steps with 2 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-07 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p0)))||X((!X(p1) U p2))||F(p3)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Applied a total of 8 rules in 5 ms. Remains 37 /41 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 37 cols
[2023-03-18 17:14:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 17:14:44] [INFO ] Invariant cache hit.
[2023-03-18 17:14:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 17:14:44] [INFO ] Invariant cache hit.
[2023-03-18 17:14:44] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/41 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 37/41 places, 42/46 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s15 1), p2:(EQ s7 1), p1:(EQ s9 1), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16993 reset in 109 ms.
Product exploration explored 100000 steps with 17003 reset in 111 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/37 stabilizing places and 9/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 389 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Finished random walk after 29 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (F (AND (NOT p3) p1))]
Knowledge based reduction with 10 factoid took 295 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
[2023-03-18 17:14:46] [INFO ] Invariant cache hit.
[2023-03-18 17:14:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-18 17:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:14:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-18 17:14:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:14:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-18 17:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:14:46] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-18 17:14:46] [INFO ] Computed and/alt/rep : 41/107/41 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 17:14:46] [INFO ] Added : 40 causal constraints over 9 iterations in 161 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 3 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-18 17:14:46] [INFO ] Invariant cache hit.
[2023-03-18 17:14:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 17:14:46] [INFO ] Invariant cache hit.
[2023-03-18 17:14:47] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-18 17:14:47] [INFO ] Invariant cache hit.
[2023-03-18 17:14:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 37/37 places, 42/42 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Detected a total of 9/37 stabilizing places and 9/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Finished random walk after 35 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (F (AND (NOT p3) p1))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
[2023-03-18 17:14:47] [INFO ] Invariant cache hit.
[2023-03-18 17:14:47] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-18 17:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:14:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-18 17:14:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:14:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-18 17:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:14:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-18 17:14:47] [INFO ] Computed and/alt/rep : 41/107/41 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 17:14:47] [INFO ] Added : 40 causal constraints over 9 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 99 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 17008 reset in 69 ms.
Product exploration explored 100000 steps with 17002 reset in 156 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 42/42 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 37 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 43
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 15 place count 37 transition count 43
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 32 transition count 38
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 32 transition count 38
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 25 rules in 5 ms. Remains 32 /37 variables (removed 5) and now considering 38/42 (removed 4) transitions.
[2023-03-18 17:14:48] [INFO ] Redundant transitions in 10 ms returned [37]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 37 rows 32 cols
[2023-03-18 17:14:48] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/37 places, 37/42 transitions.
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 32/37 places, 37/42 transitions.
Built C files in :
/tmp/ltsmin7456649156874952646
[2023-03-18 17:14:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7456649156874952646
Running compilation step : cd /tmp/ltsmin7456649156874952646;'/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 103 ms.
Running link step : cd /tmp/ltsmin7456649156874952646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7456649156874952646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7229568702849828384.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001B-LTLFireability-09 finished in 3902 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&&G(!p0)))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 2 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2023-03-18 17:14:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 17:14:48] [INFO ] Invariant cache hit.
[2023-03-18 17:14:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-18 17:14:48] [INFO ] Invariant cache hit.
[2023-03-18 17:14:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (OR (NOT p1) p0), p0, true]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s23 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-10 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&X(F((G(p3)||p2))))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 3 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2023-03-18 17:14:49] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s30 1), p1:(AND (EQ s3 1) (EQ s11 1) (EQ s34 1)), p2:(OR (EQ s3 0) (EQ s11 0) (EQ s34 0)), p3:(AND (EQ s3 1) (EQ s13 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-12 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(G(p2)||p1)))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 2 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s7 0), p1:(OR (EQ s12 0) (EQ s16 0) (EQ s23 0)), p2:(EQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-13 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p1)&&F(p2))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Applied a total of 8 rules in 2 ms. Remains 37 /41 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 37 cols
[2023-03-18 17:14:49] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/41 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 37/41 places, 42/46 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s16 1), p1:(EQ s13 1), p0:(AND (EQ s3 1) (EQ s12 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 3 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-14 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 43
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 38 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6 place count 37 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16 place count 32 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 28 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 28 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 28 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 27 transition count 32
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 19 transition count 24
Applied a total of 42 rules in 6 ms. Remains 19 /41 variables (removed 22) and now considering 24/46 (removed 22) transitions.
// Phase 1: matrix 24 rows 19 cols
[2023-03-18 17:14:49] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 17:14:49] [INFO ] Invariant cache hit.
[2023-03-18 17:14:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-18 17:14:49] [INFO ] Redundant transitions in 9 ms returned [23]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 23 rows 19 cols
[2023-03-18 17:14:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 17:14:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/41 places, 23/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 19/41 places, 23/46 transitions.
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s14 0), p1:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 788 reset in 85 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-15 finished in 218 ms.
All properties solved by simple procedures.
Total runtime 13249 ms.

BK_STOP 1679159690135

--------------------
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="ShieldRVs-PT-001B"
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 ShieldRVs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905974700012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001B.tgz
mv ShieldRVs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;