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.r168-tall-165277017400964.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 QuasiCertifProtocol-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400964
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 78K 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 QuasiCertifProtocol-PT-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652993021435

Running Version 202205111006
[2022-05-19 20:43:42] [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-19 20:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:43:42] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-19 20:43:42] [INFO ] Transformed 270 places.
[2022-05-19 20:43:42] [INFO ] Transformed 116 transitions.
[2022-05-19 20:43:42] [INFO ] Parsed PT model containing 270 places and 116 transitions in 179 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 4 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 223 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 20 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:43] [INFO ] Computed 138 place invariants in 22 ms
[2022-05-19 20:43:43] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:43] [INFO ] Computed 138 place invariants in 6 ms
[2022-05-19 20:43:43] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:43] [INFO ] Computed 138 place invariants in 7 ms
[2022-05-19 20:43:43] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/270 places, 116/116 transitions.
Support contains 223 out of 252 places after structural reductions.
[2022-05-19 20:43:43] [INFO ] Flatten gal took : 40 ms
[2022-05-19 20:43:43] [INFO ] Flatten gal took : 22 ms
[2022-05-19 20:43:43] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:44] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 20:43:45] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 21 ms returned sat
[2022-05-19 20:43:45] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-05-19 20:43:45] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 24 ms returned sat
[2022-05-19 20:43:45] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2022-05-19 20:43:46] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-05-19 20:43:46] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Finished Parikh walk after 55 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 14 properties in 20 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(!(false U p0))))))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 1 are kept as prefixes of interest. Removing 251 places using SCC suffix rule.5 ms
Discarding 251 places :
Also discarding 115 output transitions
Drop transitions removed 115 transitions
Applied a total of 1 rules in 9 ms. Remains 1 /252 variables (removed 251) and now considering 1/116 (removed 115) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-19 20:43:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 20:43:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-19 20:43:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 20:43:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-19 20:43:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-19 20:43:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 20:43:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/252 places, 1/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/252 places, 1/116 transitions.
Stuttering acceptance computed with spot in 182 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-00 finished in 706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(!(!G(X(G(p0))) U F(p0))))))'
Support contains 56 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 173 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.2 ms
Discarding 79 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 1 with 4 rules applied. Total rules applied 19 place count 170 transition count 82
Applied a total of 19 rules in 21 ms. Remains 170 /252 variables (removed 82) and now considering 82/116 (removed 34) transitions.
// Phase 1: matrix 82 rows 170 cols
[2022-05-19 20:43:47] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 20:43:47] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 82 rows 170 cols
[2022-05-19 20:43:47] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 20:43:47] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [125, 126, 148, 149, 150, 151, 152]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 231 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/252 places, 82/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/252 places, 82/116 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s48 1) (GEQ s49 1) (GEQ s58 1) (GEQ s60 1) (GEQ s61 1) (GEQ s62 1) (GEQ s63 1) (GEQ s83 1)) (AND (GEQ s40 1) (GEQ s41 1) (GEQ s42 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10000 reset in 384 ms.
Product exploration explored 100000 steps with 9997 reset in 219 ms.
Computed a total of 163 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 163 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-01 finished in 1052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Reduce places removed 1 places and 1 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 250 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 250 transition count 114
Applied a total of 3 rules in 45 ms. Remains 250 /252 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 20:43:48] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 20:43:48] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 20:43:48] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:43:48] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [146, 147, 148, 149, 153, 158, 159, 196, 197, 221, 222, 223, 224, 225]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 377 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/252 places, 114/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/252 places, 114/116 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-02 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s47 1), p1:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s30 1)) (OR (LT s0 1) (LT s26 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (LT s23 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 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-02 finished in 583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||G((X(G(p3))||p2)))))'
Support contains 77 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:49] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:43:49] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:43:49] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 20:43:49] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 303 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s19 1) (GEQ s159 1) (GEQ s164 1) (GEQ s175 1) (GEQ s182 1) (GEQ s185 1) (GEQ s188 1) (GEQ s197 1)) (AND (GEQ s16 1) (GEQ s149 1) (GEQ s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 42 steps with 3 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-04 finished in 728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(!(X(p0) U F(p1))))&&!(F(p0) U !p2)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 5 place count 242 transition count 112
Applied a total of 5 rules in 16 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2022-05-19 20:43:49] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 20:43:49] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 112 rows 242 cols
[2022-05-19 20:43:49] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 20:43:50] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [144, 145, 146, 147, 151, 156, 157]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 366 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/252 places, 112/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 235/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s233 1), p2:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s30 1)) (OR (LT s0 1) (LT s26 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (LT s23 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9831 reset in 252 ms.
Product exploration explored 100000 steps with 9832 reset in 293 ms.
Computed a total of 235 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 283 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 33 ms :[(OR (NOT p2) p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p2), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 366 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 39 ms :[(OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 27 ms :[(OR (NOT p2) p1)]
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 20:43:51] [INFO ] Computed 126 place invariants in 12 ms
[2022-05-19 20:43:51] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 27 ms returned sat
[2022-05-19 20:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:43:51] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-19 20:43:51] [INFO ] Computed and/alt/rep : 104/286/104 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 20:43:51] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG p1
Support contains 9 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 112/112 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 20:43:51] [INFO ] Computed 126 place invariants in 5 ms
[2022-05-19 20:43:52] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 20:43:52] [INFO ] Computed 126 place invariants in 5 ms
[2022-05-19 20:43:52] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-05-19 20:43:52] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 20:43:52] [INFO ] Computed 126 place invariants in 5 ms
[2022-05-19 20:43:52] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 112/112 transitions.
Computed a total of 235 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 471 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 34 ms :[(OR (NOT p2) p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p2), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 265 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 27 ms :[(OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p2) p1)]
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 20:43:53] [INFO ] Computed 126 place invariants in 11 ms
[2022-05-19 20:43:53] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 27 ms returned sat
[2022-05-19 20:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:43:53] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2022-05-19 20:43:53] [INFO ] Computed and/alt/rep : 104/286/104 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 20:43:53] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p2) p1)]
Product exploration explored 100000 steps with 9838 reset in 164 ms.
Product exploration explored 100000 steps with 9831 reset in 288 ms.
Built C files in :
/tmp/ltsmin8563441630024912041
[2022-05-19 20:43:54] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-19 20:43:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:43:54] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-19 20:43:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:43:54] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-19 20:43:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 20:43:54] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8563441630024912041
Running compilation step : cd /tmp/ltsmin8563441630024912041;'/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 845 ms.
Running link step : cd /tmp/ltsmin8563441630024912041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8563441630024912041;'/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/stateBased13310277387529479160.hoa' '--buchi-type=spotba'
LTSmin run took 8556 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-05 finished in 13986 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p0) U F(p1))||X((p0 U (p0 U p2))))))'
Support contains 72 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:03] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:03] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:03] [INFO ] Computed 138 place invariants in 8 ms
[2022-05-19 20:44:04] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 315 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s14 1)) (AND (GEQ s0 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s11 1)) (AND (GEQ s0 1) (GEQ s13 1)) (AND (GEQ s0 1) (GEQ s8 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 53251 steps with 5234 reset in 80 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-06 finished in 633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U p1))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 250 transition count 114
Applied a total of 3 rules in 19 ms. Remains 250 /252 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 20:44:04] [INFO ] Computed 138 place invariants in 4 ms
[2022-05-19 20:44:04] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 20:44:04] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [146, 147, 148, 149, 153, 158, 159, 196, 197, 221, 222, 223, 224, 225]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 380 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/252 places, 114/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 236 /236 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 236/252 places, 114/116 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s228 1) (GEQ s229 1) (GEQ s231 1) (GEQ s232 1) (GEQ s233 1) (GEQ s234 1) (GEQ s235 1)), p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (...], 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]]
Stuttering criterion allowed to conclude after 299 steps with 30 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-07 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G(p1))))'
Support contains 3 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:04] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-19 20:44:05] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:05] [INFO ] Computed 138 place invariants in 6 ms
[2022-05-19 20:44:05] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 394 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s52 1), p0:(AND (GEQ s0 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-08 finished in 548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&!(p1 U p2)))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:05] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:05] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:05] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 20:44:05] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 378 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-09 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: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(OR p2 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s57 1), p2:(AND (GEQ s0 1) (GEQ s14 1)), p1:(GEQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-09 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:06] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-19 20:44:06] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:06] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:06] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 350 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-11 automaton TGBA Formula[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:(LT s51 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 6156 steps with 606 reset in 16 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-11 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&X(p1)&&(p0 U X(p2)))))'
Support contains 17 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:06] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-19 20:44:06] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:06] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 20:44:06] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 339 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s90 1) (GEQ s92 1) (GEQ s93 1) (GEQ s94 1) (GEQ s95 1) (GEQ s96 1) (GEQ s97 1)), p2:(GEQ s47 1), p1:(OR (LT s57 1) (LT s208 1) (LT...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-12 finished in 619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:07] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:07] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 20:44:07] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 20:44:07] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 374 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s57 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][false, false]]
Product exploration explored 100000 steps with 36504 reset in 267 ms.
Product exploration explored 100000 steps with 36492 reset in 242 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-13 finished in 1168 ms.
All properties solved by simple procedures.
Total runtime 25666 ms.

BK_STOP 1652993048654

--------------------
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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r168-tall-165277017400964"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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