Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.1K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621094930628

Running Version 0
[2021-05-15 16:08:54] [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]
[2021-05-15 16:08:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 16:08:54] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-15 16:08:54] [INFO ] Transformed 22 places.
[2021-05-15 16:08:54] [INFO ] Transformed 17 transitions.
[2021-05-15 16:08:54] [INFO ] Found NUPN structural information;
[2021-05-15 16:08:54] [INFO ] Parsed PT model containing 22 places and 17 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:54] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-15 16:08:54] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:54] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:08:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
[2021-05-15 16:08:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 16:08:54] [INFO ] Flatten gal took : 19 ms
FORMULA ShieldIIPt-PT-001A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 16:08:54] [INFO ] Flatten gal took : 5 ms
[2021-05-15 16:08:54] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-15 16:08:55] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:55] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:55] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-15 16:08:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001A-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-00 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:55] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 1946 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-001A-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-01 finished in 2029 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((G(p1)||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:57] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:57] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-001A-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s0 1), p1:(OR (NEQ s8 1) (NEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 16
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-15 16:08:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
[2021-05-15 16:08:59] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:08:59] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:08:59] [INFO ] Time to serialize gal into /tmp/LTL2012132290290883689.gal : 1 ms
[2021-05-15 16:08:59] [INFO ] Time to serialize properties into /tmp/LTL11404932570052656608.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2012132290290883689.gal, -t, CGAL, -LTL, /tmp/LTL11404932570052656608.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2012132290290883689.gal -t CGAL -LTL /tmp/LTL11404932570052656608.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p0==0)"))||(X((G("((p8==0)||(p19==0))"))||(G("(p0==0)"))))))
Formula 0 simplified : !(F"(p0==0)" | X(G"((p8==0)||(p19==0))" | G"(p0==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 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,0.025725,16640,1,0,6,1547,24,0,532,2113,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001A-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-001A-02 finished in 1682 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 5 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-15 16:08:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants in 19 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-15 16:08:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-15 16:08:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 16:08:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 18/22 places, 14/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 13
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-15 16:08:59] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/22 places, 13/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 12
Applied a total of 2 rules in 3 ms. Remains 15 /16 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 15 cols
[2021-05-15 16:08:59] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2021-05-15 16:08:59] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 15/22 places, 12/16 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001A-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s6 1) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-03 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)||(F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:08:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:08:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPt-PT-001A-04 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s16 1)), p2:(EQ s14 1), p0:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Knowledge obtained : [(NOT p1), (NOT p2), p0]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-15 16:09:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:00] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:09:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
[2021-05-15 16:09:00] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:09:00] [INFO ] Flatten gal took : 3 ms
[2021-05-15 16:09:00] [INFO ] Time to serialize gal into /tmp/LTL7543091379097921646.gal : 1 ms
[2021-05-15 16:09:00] [INFO ] Time to serialize properties into /tmp/LTL17653384460782456097.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7543091379097921646.gal, -t, CGAL, -LTL, /tmp/LTL17653384460782456097.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7543091379097921646.gal -t CGAL -LTL /tmp/LTL17653384460782456097.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("(p14==0)"))||(("((p5==1)&&(p16==1))")&&(F("(p14==1)"))))))
Formula 0 simplified : !F(X"(p14==0)" | ("((p5==1)&&(p16==1))" & F"(p14==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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,0.019733,16804,1,0,6,1547,27,0,535,2113,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001A-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-001A-04 finished in 1336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-15 16:09:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:00] [INFO ] Implicit Places using invariants in 19 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
[2021-05-15 16:09:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-15 16:09:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 16:09:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 15/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-15 16:09:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-15 16:09:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 16:09:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 15/16 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001A-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s18 1) (AND (EQ s11 1) (EQ s13 1) (EQ s19 1))), p0:(EQ s16 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 33333 reset in 87 ms.
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
[2021-05-15 16:09:01] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:09:01] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:09:01] [INFO ] Time to serialize gal into /tmp/LTL15915443766826276652.gal : 1 ms
[2021-05-15 16:09:01] [INFO ] Time to serialize properties into /tmp/LTL5025866223510113807.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15915443766826276652.gal, -t, CGAL, -LTL, /tmp/LTL5025866223510113807.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15915443766826276652.gal -t CGAL -LTL /tmp/LTL5025866223510113807.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p18==1)")||(G("((p20==1)||(((p11==1)&&(p15==1))&&(p21==1)))")))))
Formula 0 simplified : !F("(p18==1)" | G"((p20==1)||(((p11==1)&&(p15==1))&&(p21==1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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,0.018075,16920,1,0,10,1418,29,3,497,2093,37
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-001A-06 finished in 688 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:01] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:01] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 1974 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001A-07 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s20 0) (EQ s14 0)), p1:(OR (EQ s20 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-07 finished in 2042 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((F(p1)&&p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:03] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:09:03] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001A-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s10 1) (EQ s12 1)), p1:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-08 finished in 223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F((p1&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:03] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:09:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:03] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:09:03] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(NEQ s20 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 2975 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-15 16:09:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:09:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
[2021-05-15 16:09:07] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:09:07] [INFO ] Flatten gal took : 1 ms
[2021-05-15 16:09:07] [INFO ] Time to serialize gal into /tmp/LTL9324719669745543406.gal : 0 ms
[2021-05-15 16:09:07] [INFO ] Time to serialize properties into /tmp/LTL6919558175300552823.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9324719669745543406.gal, -t, CGAL, -LTL, /tmp/LTL6919558175300552823.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9324719669745543406.gal -t CGAL -LTL /tmp/LTL6919558175300552823.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p12==1)"))&&(F(("(p20==0)")&&(X("(p20==0)"))))))
Formula 0 simplified : !(F"(p12==1)" & F("(p20==0)" & X"(p20==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 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,0.019372,16996,1,0,6,1547,21,0,523,2113,17
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-001A-09 finished in 3977 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0)) U (G(p0)&&p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:09:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-001A-10 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s10 1) (EQ s18 1)), p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-10 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:07] [INFO ] Implicit Places using invariants in 16 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-15 16:09:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-15 16:09:07] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 16:09:07] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 18/22 places, 14/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 13
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 17 cols
[2021-05-15 16:09:07] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 16:09:07] [INFO ] Implicit Places using invariants in 16 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 16/22 places, 13/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2021-05-15 16:09:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2021-05-15 16:09:07] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:09:07] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 3 iterations. Remains : 16/22 places, 13/16 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001A-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s5 0) (NEQ s10 0)), p1:(OR (NEQ s5 1) (NEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9437 reset in 79 ms.
Stack based approach found an accepted trace after 25 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-001A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-11 finished in 223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(X(F(p0)))&&(F(!p2)||p1))) U ((p3&&X((X(X(F(p0)))&&(F(!p2)||p4))))||X(G((F(p0)&&(F(!p2)||p5)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:07] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:08] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:08] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:08] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:08] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 638 ms :[(OR (NOT p0) (AND p2 (NOT p4) (NOT p5))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p5))), (OR (NOT p0) (AND p2 (NOT p3) (NOT p5)) (AND p2 (NOT p4) (NOT p5))), p2, (NOT p0), (OR (AND p2 (NOT p5)) (AND (NOT p0) p2)), (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (OR (AND (NOT p1) p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2 (NOT p5)) (AND (NOT p0) p2 (NOT p4))), (OR (AND p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2 (NOT p5)) (AND (NOT p0) p2)), (OR (AND p2 (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5)) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001A-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p2 (NOT p4) (NOT p5)), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p4) p5), acceptance={} source=0 dest: 5}, { cond=(NOT p0), acceptance={} source=0 dest: 6}, { cond=(OR (AND p1 p2 (NOT p5)) (AND p2 p4 (NOT p5))), acceptance={} source=0 dest: 8}, { cond=(AND p3 p1 p2 (NOT p4)), acceptance={} source=0 dest: 9}, { cond=(AND p3 p1 p2 (NOT p4)), acceptance={} source=0 dest: 10}, { cond=(AND (NOT p3) p1 p2 (NOT p4)), acceptance={} source=0 dest: 11}, { cond=(AND (NOT p3) p1 p2 (NOT p4)), acceptance={} source=0 dest: 12}], [{ cond=(AND (NOT p1) p2 (NOT p5)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 p5), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2 (NOT p5)), acceptance={} source=1 dest: 8}], [{ cond=p3, acceptance={} source=2 dest: 0}, { cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND p3 p2 (NOT p5)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p3) p2 (NOT p5)), acceptance={} source=2 dest: 12}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}, { cond=(AND p2 p0 (NOT p5)), acceptance={} source=4 dest: 7}], [{ cond=(AND p2 (NOT p5)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p5), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0) p5), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p1) p2 (NOT p4) (NOT p5)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p4) p5), acceptance={} source=9 dest: 5}, { cond=(OR (AND p1 p2 (NOT p5)) (AND p2 p4 (NOT p5))), acceptance={} source=9 dest: 8}, { cond=(AND p1 p2 (NOT p4) p5), acceptance={} source=9 dest: 13}], [{ cond=(AND p2 (NOT p0) p5), acceptance={} source=10 dest: 7}, { cond=(AND p3 p2 (NOT p4)), acceptance={} source=10 dest: 9}, { cond=(AND p3 p2 (NOT p4) (NOT p5)), acceptance={0} source=10 dest: 10}, { cond=(AND p3 p2 (NOT p4) p5), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p3) p2 (NOT p4) (NOT p5)), acceptance={0} source=10 dest: 12}, { cond=(AND (NOT p3) p2 (NOT p4) p5), acceptance={} source=10 dest: 12}, { cond=(AND p2 p4), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) p2 (NOT p5)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) p2 p5), acceptance={} source=11 dest: 5}, { cond=(AND p1 p2 (NOT p5)), acceptance={} source=11 dest: 8}, { cond=(AND p1 p2 p5), acceptance={} source=11 dest: 13}], [{ cond=(AND p2 (NOT p0) p5), acceptance={} source=12 dest: 7}, { cond=(AND p3 p2), acceptance={} source=12 dest: 9}, { cond=(AND p3 p2 (NOT p5)), acceptance={0} source=12 dest: 10}, { cond=(AND p3 p2 p5), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p3) p2), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p3) p2 (NOT p5)), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p3) p2 p5), acceptance={} source=12 dest: 12}], [{ cond=p2, acceptance={} source=13 dest: 7}]], initial=2, aps=[p1:(OR (NEQ s8 1) (NEQ s19 1)), p2:(EQ s18 1), p4:(OR (NEQ s8 1) (NEQ s19 1)), p5:(OR (NEQ s8 1) (NEQ s19 1)), p0:(NEQ s18 0), p3:(OR (NEQ s8 1) (NEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 97 ms.
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Knowledge obtained : [p1, (NOT p2), p4, p5, (NOT p0), p3]
Stuttering acceptance computed with spot in 660 ms :[(OR (NOT p0) (AND p2 (NOT p4) (NOT p5))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p5))), (OR (NOT p0) (AND p2 (NOT p3) (NOT p5)) (AND p2 (NOT p4) (NOT p5))), p2, (NOT p0), (OR (AND p2 (NOT p5)) (AND (NOT p0) p2)), (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (OR (AND (NOT p1) p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2 (NOT p5)) (AND (NOT p0) p2 (NOT p4))), (OR (AND p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2 (NOT p5)) (AND (NOT p0) p2)), (OR (AND p2 (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5)) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 580 ms :[(OR (NOT p0) (AND p2 (NOT p4) (NOT p5))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p5))), (OR (NOT p0) (AND p2 (NOT p3) (NOT p5)) (AND p2 (NOT p4) (NOT p5))), p2, (NOT p0), (OR (AND p2 (NOT p5)) (AND (NOT p0) p2)), (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p0)), (OR (AND (NOT p1) p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2 (NOT p5)) (AND (NOT p0) p2 (NOT p4))), (OR (AND p2 (NOT p4) (NOT p5)) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2 (NOT p5)) (AND (NOT p0) p2)), (OR (AND p2 (NOT p4) (NOT p5)) (AND p2 (NOT p3) (NOT p5)) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-15 16:09:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:10] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Product exploration explored 100000 steps with 28620 reset in 176 ms.
Product exploration explored 100000 steps with 28543 reset in 150 ms.
[2021-05-15 16:09:11] [INFO ] Flatten gal took : 2 ms
[2021-05-15 16:09:11] [INFO ] Flatten gal took : 1 ms
[2021-05-15 16:09:11] [INFO ] Time to serialize gal into /tmp/LTL12475406149807352539.gal : 0 ms
[2021-05-15 16:09:11] [INFO ] Time to serialize properties into /tmp/LTL777125568164504785.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12475406149807352539.gal, -t, CGAL, -LTL, /tmp/LTL777125568164504785.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12475406149807352539.gal -t CGAL -LTL /tmp/LTL777125568164504785.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X((X(X(F("(p18==1)"))))&&(("((p8==0)||(p19==0))")||(F("(p18==0)")))))U((X(G((F("(p18==1)"))&&(("((p8==0)||(p19==0))")||(F("(p18==0)"))))))||((X((X(X(F("(p18==1)"))))&&(("((p8==0)||(p19==0))")||(F("(p18==0)")))))&&("((p8==0)||(p19==0))")))))
Formula 0 simplified : !(X(XXF"(p18==1)" & ("((p8==0)||(p19==0))" | F"(p18==0)")) U (XG(F"(p18==1)" & ("((p8==0)||(p19==0))" | F"(p18==0)")) | ("((p8==0)||(p19==0))" & X(XXF"(p18==1)" & ("((p8==0)||(p19==0))" | F"(p18==0)")))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,0.023933,18656,1,0,9,1547,36,2,541,2113,34
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-001A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-001A-12 finished in 6536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2021-05-15 16:09:14] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:14] [INFO ] Implicit Places using invariants in 15 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-15 16:09:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-15 16:09:14] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 16:09:14] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 15/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-15 16:09:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 20 cols
[2021-05-15 16:09:14] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 16:09:14] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 15/16 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001A-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s12 1), p0:(AND (NEQ s7 0) (NEQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3072 reset in 102 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA ShieldIIPt-PT-001A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-13 finished in 467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:14] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:09:14] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:14] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 22 cols
[2021-05-15 16:09:14] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:09:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 16/16 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, true, true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-14 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&G((F(!p1)&&F(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 16 transition count 12
Applied a total of 8 rules in 3 ms. Remains 16 /22 variables (removed 6) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 16 cols
[2021-05-15 16:09:15] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 16:09:15] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
[2021-05-15 16:09:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2021-05-15 16:09:15] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 16:09:15] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 15/22 places, 12/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 11
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-15 16:09:15] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:09:15] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 11 rows 14 cols
[2021-05-15 16:09:15] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:09:15] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/22 places, 11/16 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, p0, p1, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-001A-15 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s12 1), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 8 reset in 93 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ShieldIIPt-PT-001A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001A-15 finished in 282 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621094956660

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

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