Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025400540.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025400540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 19K May 10 09:34 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 ShieldPPPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653014113002

Running Version 202205111006
[2022-05-20 02:35:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 02:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 02:35:14] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-05-20 02:35:14] [INFO ] Transformed 81 places.
[2022-05-20 02:35:14] [INFO ] Transformed 74 transitions.
[2022-05-20 02:35:14] [INFO ] Found NUPN structural information;
[2022-05-20 02:35:14] [INFO ] Parsed PT model containing 81 places and 74 transitions in 148 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 5 formulas.
FORMULA ShieldPPPt-PT-001B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 74/74 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 68
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 68
Applied a total of 12 rules in 14 ms. Remains 75 /81 variables (removed 6) and now considering 68/74 (removed 6) transitions.
// Phase 1: matrix 68 rows 75 cols
[2022-05-20 02:35:14] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-20 02:35:14] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 68 rows 75 cols
[2022-05-20 02:35:14] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-20 02:35:14] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
// Phase 1: matrix 68 rows 75 cols
[2022-05-20 02:35:14] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 02:35:14] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/81 places, 68/74 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/81 places, 68/74 transitions.
Support contains 25 out of 75 places after structural reductions.
[2022-05-20 02:35:14] [INFO ] Flatten gal took : 23 ms
[2022-05-20 02:35:14] [INFO ] Flatten gal took : 8 ms
[2022-05-20 02:35:14] [INFO ] Input system was already deterministic with 68 transitions.
Finished random walk after 112 steps, including 0 resets, run visited all 23 properties in 38 ms. (steps per millisecond=2 )
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(X(X(p0))) U X(G(p0))))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 74 transition count 52
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 58 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 33 place count 58 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 43 place count 53 transition count 45
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 49 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 49 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 51 place count 49 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 59 place count 45 transition count 37
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 91 place count 29 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 27 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 26 transition count 20
Applied a total of 96 rules in 20 ms. Remains 26 /75 variables (removed 49) and now considering 20/68 (removed 48) transitions.
// Phase 1: matrix 20 rows 26 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:15] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-20 02:35:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 26 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/75 places, 20/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/75 places, 20/68 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6505 steps with 0 reset in 38 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-00 finished in 364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X(p0)))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 69 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 68 transition count 61
Applied a total of 14 rules in 7 ms. Remains 68 /75 variables (removed 7) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 02:35:15] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 02:35:15] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/75 places, 61/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/75 places, 61/68 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-04 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!X(G(p0)) U X(p1))||(p2 U !(X(p3)&&p3))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 62
Applied a total of 12 rules in 15 ms. Remains 69 /75 variables (removed 6) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:15] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:15] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:16] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:16] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:16] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/75 places, 62/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/75 places, 62/68 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p1) p3), p0, (NOT p1), (AND p0 p3), (AND p0 p3)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p3 p0), acceptance={} source=5 dest: 3}], [{ cond=(AND p3 (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND p3 p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s0 1), p2:(AND (EQ s1 1) (EQ s55 1)), p1:(EQ s44 1), p0:(AND (EQ s19 1) (EQ s21 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/69 stabilizing places and 14/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) (NOT p1) p0))), (X (NOT (AND p3 p2 (NOT p1) p0))), (X (NOT (AND p3 (NOT p1)))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT (AND p3 (NOT p1) p0))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p3 p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 p0)))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p3 (NOT p1) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p3 (NOT p1))))
Knowledge based reduction with 20 factoid took 324 ms. Reduced automaton from 7 states, 14 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-001B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-001B-LTLFireability-05 finished in 1238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 69 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 69 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 68 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 68 transition count 61
Applied a total of 14 rules in 12 ms. Remains 68 /75 variables (removed 7) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 68 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/75 places, 61/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/75 places, 61/68 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 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 155 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/68 stabilizing places and 14/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-001B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-001B-LTLFireability-06 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(((p0 U p1)&&G(p1)))||X(p0))))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 74 transition count 53
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 60 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 59 transition count 51
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 31 place count 59 transition count 45
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 53 transition count 45
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 48 transition count 40
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 48 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 53 place count 48 transition count 36
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 44 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 89 place count 30 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 27 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 26 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 95 place count 26 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 24 transition count 19
Applied a total of 99 rules in 17 ms. Remains 24 /75 variables (removed 51) and now considering 19/68 (removed 49) transitions.
// Phase 1: matrix 19 rows 24 cols
[2022-05-20 02:35:17] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants in 24 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/75 places, 19/68 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 20 transition count 17
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 20 cols
[2022-05-20 02:35:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2022-05-20 02:35:17] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/75 places, 17/68 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/75 places, 17/68 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s9 1), p0:(EQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2955 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-08 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(G(p0))&&p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 74 transition count 55
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 62 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 24 place count 62 transition count 49
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 36 place count 56 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 52 transition count 45
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 52 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 44 place count 52 transition count 41
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 48 transition count 41
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 32 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 29 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 28 transition count 24
Applied a total of 91 rules in 14 ms. Remains 28 /75 variables (removed 47) and now considering 24/68 (removed 44) transitions.
// Phase 1: matrix 24 rows 28 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 24 rows 28 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:17] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-20 02:35:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 28 cols
[2022-05-20 02:35:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/75 places, 24/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/75 places, 24/68 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s20 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 343 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-09 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!F(p0)||F(X(p1)))) U X(p2)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 71 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 71 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 70 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 70 transition count 63
Applied a total of 10 rules in 8 ms. Remains 70 /75 variables (removed 5) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 70 cols
[2022-05-20 02:35:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 02:35:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 63 rows 70 cols
[2022-05-20 02:35:18] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
// Phase 1: matrix 63 rows 70 cols
[2022-05-20 02:35:18] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/75 places, 63/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 63/68 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s52 1), p2:(NEQ s60 1), p1:(OR (EQ s61 1) (EQ s52 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/70 stabilizing places and 15/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT p1))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 150 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-001B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-001B-LTLFireability-11 finished in 703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(X(p0))))||F(p1)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 74 transition count 55
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 62 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 61 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 60 transition count 52
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 29 place count 60 transition count 44
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 45 place count 52 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 47 transition count 39
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 47 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 47 transition count 37
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 45 transition count 37
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 87 place count 31 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 28 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 26 transition count 20
Applied a total of 95 rules in 19 ms. Remains 26 /75 variables (removed 49) and now considering 20/68 (removed 48) transitions.
// Phase 1: matrix 20 rows 26 cols
[2022-05-20 02:35:18] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 02:35:18] [INFO ] Implicit Places using invariants in 22 ms returned [5, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/75 places, 20/68 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 22 transition count 18
Applied a total of 4 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:18] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:18] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:18] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 02:35:18] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/75 places, 18/68 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/75 places, 18/68 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s19 1)), p1:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13269 reset in 78 ms.
Product exploration explored 100000 steps with 13291 reset in 195 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 02:35:19] [INFO ] Computed and/alt/rep : 16/22/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 02:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 02:35:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-20 02:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 02:35:19] [INFO ] Computed and/alt/rep : 16/22/16 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 02:35:19] [INFO ] Added : 15 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:19] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 02:35:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-20 02:35:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:19] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 02:35:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:20] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:20] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 02:35:20] [INFO ] Computed and/alt/rep : 16/22/16 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 02:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 02:35:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-20 02:35:20] [INFO ] Computed and/alt/rep : 16/22/16 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 02:35:20] [INFO ] Added : 15 causal constraints over 4 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13226 reset in 171 ms.
Product exploration explored 100000 steps with 13251 reset in 123 ms.
Built C files in :
/tmp/ltsmin12923109253451486682
[2022-05-20 02:35:20] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-20 02:35:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:35:20] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-20 02:35:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:35:20] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-20 02:35:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 02:35:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12923109253451486682
Running compilation step : cd /tmp/ltsmin12923109253451486682;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 177 ms.
Running link step : cd /tmp/ltsmin12923109253451486682;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12923109253451486682;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6759390429345951411.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLFireability-12 finished in 2386 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(F(p0))||X(p1)))||(G(p2)&&p1))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 62
Applied a total of 12 rules in 4 ms. Remains 69 /75 variables (removed 6) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:21] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:21] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:21] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:21] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/75 places, 62/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/75 places, 62/68 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s29 1), p1:(EQ s37 1), p2:(EQ s9 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][false, false, false, false]]
Product exploration explored 100000 steps with 7001 reset in 73 ms.
Product exploration explored 100000 steps with 7020 reset in 77 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/69 stabilizing places and 14/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 229 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:22] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-20 02:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-20 02:35:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 02:35:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-20 02:35:22] [INFO ] Computed and/alt/rep : 61/91/61 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 02:35:22] [INFO ] Added : 59 causal constraints over 12 iterations in 86 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:22] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:22] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:22] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:22] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-20 02:35:22] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 62/62 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:23] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:23] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-20 02:35:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 02:35:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-20 02:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 02:35:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-20 02:35:23] [INFO ] Computed and/alt/rep : 61/91/61 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 02:35:23] [INFO ] Added : 59 causal constraints over 12 iterations in 84 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7028 reset in 70 ms.
Product exploration explored 100000 steps with 7019 reset in 71 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 62/62 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 69 transition count 62
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 12 place count 69 transition count 67
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 69 transition count 67
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 69 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 69 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 62 transition count 58
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 62 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 62 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 60 transition count 56
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 60 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 60 transition count 68
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 57 transition count 62
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 57 transition count 62
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 66 rules in 19 ms. Remains 57 /69 variables (removed 12) and now considering 62/62 (removed 0) transitions.
[2022-05-20 02:35:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 57 cols
[2022-05-20 02:35:23] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/69 places, 62/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/69 places, 62/62 transitions.
Product exploration explored 100000 steps with 20000 reset in 191 ms.
Product exploration explored 100000 steps with 20000 reset in 165 ms.
Built C files in :
/tmp/ltsmin4593762042881241966
[2022-05-20 02:35:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4593762042881241966
Running compilation step : cd /tmp/ltsmin4593762042881241966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 119 ms.
Running link step : cd /tmp/ltsmin4593762042881241966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4593762042881241966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7090944176549120633.hoa' '--buchi-type=spotba'
LTSmin run took 151 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-001B-LTLFireability-13 finished in 3534 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 74 transition count 53
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 60 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 59 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 58 transition count 50
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 33 place count 58 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 45 place count 52 transition count 44
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 47 transition count 39
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 47 transition count 39
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 55 place count 47 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 61 place count 44 transition count 36
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 87 place count 31 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 28 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 28 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 26 transition count 20
Applied a total of 95 rules in 9 ms. Remains 26 /75 variables (removed 49) and now considering 20/68 (removed 48) transitions.
// Phase 1: matrix 20 rows 26 cols
[2022-05-20 02:35:24] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 02:35:24] [INFO ] Implicit Places using invariants in 24 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/75 places, 20/68 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 22 transition count 18
Applied a total of 4 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:24] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:24] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-20 02:35:24] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 02:35:24] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/75 places, 18/68 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/75 places, 18/68 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s21 1), p1:(EQ s3 0)], 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 1695 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-001B-LTLFireability-14 finished in 204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||X(p1)||X(p2)||p3)))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 68/68 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 70 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 70 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 69 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 69 transition count 62
Applied a total of 12 rules in 4 ms. Remains 69 /75 variables (removed 6) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:24] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:24] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:24] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:24] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:24] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/75 places, 62/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/75 places, 62/68 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s64 0), p0:(EQ s61 0), p1:(EQ s56 0), p2:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1609 reset in 101 ms.
Product exploration explored 100000 steps with 1531 reset in 212 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p3 p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Finished random walk after 1584 steps, including 0 resets, run visited all 4 properties in 33 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p3 p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:26] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:26] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:26] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:26] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 62/62 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p3 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Finished random walk after 482 steps, including 0 resets, run visited all 4 properties in 18 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p3 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1564 reset in 84 ms.
Product exploration explored 100000 steps with 1591 reset in 125 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 62/62 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 69 transition count 62
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 10 place count 69 transition count 67
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 69 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 69 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 69 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 43 place count 62 transition count 59
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 62 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 62 transition count 59
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 60 transition count 57
Deduced a syphon composed of 27 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 60 transition count 57
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 55 rules in 10 ms. Remains 60 /69 variables (removed 9) and now considering 57/62 (removed 5) transitions.
[2022-05-20 02:35:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 57 rows 60 cols
[2022-05-20 02:35:28] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:28] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/69 places, 57/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/69 places, 57/62 transitions.
Product exploration explored 100000 steps with 1518 reset in 97 ms.
Product exploration explored 100000 steps with 1562 reset in 105 ms.
Built C files in :
/tmp/ltsmin13543274428425905542
[2022-05-20 02:35:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13543274428425905542
Running compilation step : cd /tmp/ltsmin13543274428425905542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 123 ms.
Running link step : cd /tmp/ltsmin13543274428425905542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13543274428425905542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9279738867939017694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:43] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:43] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 02:35:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 69 cols
[2022-05-20 02:35:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 02:35:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 62/62 transitions.
Built C files in :
/tmp/ltsmin4480528011865681763
[2022-05-20 02:35:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4480528011865681763
Running compilation step : cd /tmp/ltsmin4480528011865681763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 130 ms.
Running link step : cd /tmp/ltsmin4480528011865681763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4480528011865681763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10276486534718643482.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 02:35:58] [INFO ] Flatten gal took : 6 ms
[2022-05-20 02:35:58] [INFO ] Flatten gal took : 5 ms
[2022-05-20 02:35:58] [INFO ] Time to serialize gal into /tmp/LTL738844367676447416.gal : 144 ms
[2022-05-20 02:35:58] [INFO ] Time to serialize properties into /tmp/LTL9728184834505275592.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL738844367676447416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9728184834505275592.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7388443...265
Read 1 LTL properties
Checking formula 0 : !((G(((G(F("(p71==0)")))||(X("(p64==0)")))||((X("(p52==0)"))||("(p75==0)")))))
Formula 0 simplified : !G("(p75==0)" | GF"(p71==0)" | X"(p64==0)" | X"(p52==0)")
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t13, t16, t22, t27, t32, t39, t41, t44, t46, t47, t49, t50, t52, t53, t54, Intersec...244
Computing Next relation with stutter on 3 deadlock states
57 unique states visited
0 strongly connected components in search stack
101 transitions explored
47 items max in DFS search stack
127 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,1.29818,61480,1,0,415,175801,167,274,1960,276121,1106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-001B-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldPPPt-PT-001B-LTLFireability-15 finished in 35512 ms.
All properties solved by simple procedures.
Total runtime 46228 ms.

BK_STOP 1653014160420

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPt-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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-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 r222-tall-165286025400540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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