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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.2K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 3.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652981059959

Running Version 202205111006
[2022-05-19 17:24:21] [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 17:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:24:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-19 17:24:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:24:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 589 ms
[2022-05-19 17:24:21] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 17:24:21] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2022-05-19 17:24:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 769 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 265 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 30 cols
[2022-05-19 17:24:22] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-19 17:24:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-19 17:24:22] [INFO ] After 63ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2022-05-19 17:24:22] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-19 17:24:22] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2022-05-19 17:24:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-19 17:24:23] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 17:24:23] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-19 17:24:23] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 5 properties in 5 ms.
[2022-05-19 17:24:23] [INFO ] Flatten gal took : 20 ms
[2022-05-19 17:24:23] [INFO ] Flatten gal took : 6 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:24:23] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 16 ms.
[2022-05-19 17:24:23] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 231 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 26 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 17:24:23] [INFO ] Computed 138 place invariants in 34 ms
[2022-05-19 17:24:23] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:23] [INFO ] Computed 138 place invariants in 13 ms
[2022-05-19 17:24:23] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:23] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:23] [INFO ] Dead Transitions using invariants and state equation in 113 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 231 out of 252 places after structural reductions.
[2022-05-19 17:24:23] [INFO ] Flatten gal took : 26 ms
[2022-05-19 17:24:23] [INFO ] Flatten gal took : 23 ms
[2022-05-19 17:24:23] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:24] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:24] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 19 ms returned sat
[2022-05-19 17:24:24] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2022-05-19 17:24:24] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 18 ms returned sat
[2022-05-19 17:24:25] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2022-05-19 17:24:25] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-05-19 17:24:26] [INFO ] After 1297ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 16 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 18 properties in 20 ms.
Successfully simplified 1 atomic propositions for a total of 14 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.2 ms
Discarding 251 places :
Also discarding 115 output transitions
Drop transitions removed 115 transitions
Applied a total of 1 rules in 5 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 17:24:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 17:24:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-19 17:24:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 17:24:26] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-19 17:24:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-19 17:24:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 17:24:26] [INFO ] Dead Transitions using invariants and state equation in 16 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 184 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-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 138 ms.
Product exploration explored 100000 steps with 50000 reset in 75 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 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-00 finished in 635 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 125 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.2 ms
Discarding 127 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 124 transition count 72
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 25 place count 122 transition count 70
Applied a total of 25 rules in 17 ms. Remains 122 /252 variables (removed 130) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 122 cols
[2022-05-19 17:24:27] [INFO ] Computed 54 place invariants in 1 ms
[2022-05-19 17:24:27] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 70 rows 122 cols
[2022-05-19 17:24:27] [INFO ] Computed 54 place invariants in 2 ms
[2022-05-19 17:24:27] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [78, 79, 80, 81, 82, 83, 84]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 158 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/252 places, 70/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/252 places, 70/116 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s1 1) (GEQ s8 1) (GEQ s15 1) (GEQ s22 1) (GEQ s29 1) (GEQ s36 1) (GEQ s43 1) (GEQ s78 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s21 1) (GEQ s2...], 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 9989 reset in 278 ms.
Product exploration explored 100000 steps with 9978 reset in 212 ms.
Computed a total of 115 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 115 transition count 70
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 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-01 finished in 890 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 51 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 17:24:28] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 17:24:28] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 17:24:28] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:28] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [183, 184, 185, 186, 187, 188, 189, 197, 198, 199, 200, 201, 202, 203]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 372 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 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s232 1), p1:(AND (OR (LT s0 1) (LT s215 1)) (OR (LT s0 1) (LT s216 1)) (OR (LT s0 1) (LT s217 1)) (OR (LT s0 1) (LT s211 1)) (OR (LT s0 1) (LT s21...], 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 10 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-02 finished in 605 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 17:24:28] [INFO ] Computed 138 place invariants in 8 ms
[2022-05-19 17:24:28] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:28] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:28] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 319 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 372 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-COL-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 s57 1) (GEQ s58 1) (GEQ s59 1) (GEQ s60 1) (GEQ s61 1) (GEQ s62 1) (GEQ s63 1) (GEQ s226 1)) (AND (GEQ s92 1) (GEQ s93 1) (GEQ s94 1) (GE...], 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 19 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-04 finished in 724 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.2 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 1 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 17:24:29] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 17:24:29] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 112 rows 242 cols
[2022-05-19 17:24:29] [INFO ] Computed 132 place invariants in 2 ms
[2022-05-19 17:24:29] [INFO ] Implicit Places using invariants and state equation in 200 ms returned [190, 191, 192, 193, 194, 195, 196]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 341 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 8 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 38 ms :[(OR (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s234 1), p2:(AND (OR (LT s0 1) (LT s215 1)) (OR (LT s0 1) (LT s216 1)) (OR (LT s0 1) (LT s217 1)) (OR (LT s0 1) (LT s211 1)) (OR (LT s0 1) (LT s21...], 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 9833 reset in 244 ms.
Product exploration explored 100000 steps with 9835 reset in 282 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 (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 268 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 38 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 (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 268 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 29 ms :[(OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 31 ms :[(OR (NOT p2) p1)]
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:31] [INFO ] Computed 126 place invariants in 8 ms
[2022-05-19 17:24:31] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 22 ms returned sat
[2022-05-19 17:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:24:31] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-19 17:24:31] [INFO ] Computed and/alt/rep : 104/286/104 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 17:24:31] [INFO ] Added : 0 causal constraints over 0 iterations in 23 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 10 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 17:24:31] [INFO ] Computed 126 place invariants in 12 ms
[2022-05-19 17:24:31] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:31] [INFO ] Computed 126 place invariants in 8 ms
[2022-05-19 17:24:31] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-19 17:24:31] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:31] [INFO ] Computed 126 place invariants in 9 ms
[2022-05-19 17:24:31] [INFO ] Dead Transitions using invariants and state equation in 92 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 (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 264 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 30 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 (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 270 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 28 ms :[(OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p2) p1)]
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:32] [INFO ] Computed 126 place invariants in 19 ms
[2022-05-19 17:24:32] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 21 ms returned sat
[2022-05-19 17:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:24:32] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-19 17:24:32] [INFO ] Computed and/alt/rep : 104/286/104 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 17:24:32] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 29 ms :[(OR (NOT p2) p1)]
Product exploration explored 100000 steps with 9843 reset in 147 ms.
Product exploration explored 100000 steps with 9838 reset in 302 ms.
Built C files in :
/tmp/ltsmin11428136415548941203
[2022-05-19 17:24:33] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-19 17:24:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:33] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-19 17:24:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:33] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-19 17:24:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:24:33] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11428136415548941203
Running compilation step : cd /tmp/ltsmin11428136415548941203;'/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 349 ms.
Running link step : cd /tmp/ltsmin11428136415548941203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11428136415548941203;'/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/stateBased678122142351208339.hoa' '--buchi-type=spotba'
LTSmin run took 9558 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-05 finished in 13887 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 17:24:43] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 17:24:43] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:43] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:24:43] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [197, 198, 199, 200, 201, 202, 203]
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 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 231 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-COL-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 s238 1)) (AND (GEQ s0 1) (GEQ s232 1)) (AND (GEQ s0 1) (GEQ s233 1)) (AND (GEQ s0 1) (GEQ s234 1)) (AND (GEQ s0 1) (GEQ s235 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47816 steps with 4704 reset in 63 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-06 finished in 626 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 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 20 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 17:24:43] [INFO ] Computed 138 place invariants in 4 ms
[2022-05-19 17:24:44] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 114 rows 250 cols
[2022-05-19 17:24:44] [INFO ] Computed 138 place invariants in 2 ms
[2022-05-19 17:24:44] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [183, 184, 185, 186, 187, 188, 189, 197, 198, 199, 200, 201, 202, 203]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 361 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 68 ms :[(NOT p1), true, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-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 s148 1) (GEQ s149 1) (GEQ s150 1) (GEQ s151 1) (GEQ s152 1) (GEQ s153 1) (GEQ s154 1) (GEQ s232 1)), p0:(OR (AND (GEQ s0 1) (GEQ s183 1)) (AN...], 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 2066 steps with 208 reset in 9 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-07 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)||p1)) U G(!p2))))'
Support contains 9 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 17:24:44] [INFO ] Computed 138 place invariants in 1 ms
[2022-05-19 17:24:44] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:24:44] [INFO ] Computed 138 place invariants in 4 ms
[2022-05-19 17:24:44] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 367 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 127 ms :[p2, p2, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s234 1) (LT s235 1) (LT s236 1) (LT s237 1) (LT s232 1) (LT s233 1) (LT s238 1)), p1:(GEQ s240 1), p0:(OR (LT s240 1) (GEQ s239 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 634 steps with 155 reset in 4 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-08 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F((F(p0)&&p1)) U p2))'
Support contains 72 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 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 3 place count 242 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 242 transition count 112
Applied a total of 4 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 17:24:44] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 17:24:45] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 112 rows 242 cols
[2022-05-19 17:24:45] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 17:24:45] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 320 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 6 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 205 ms :[true, p2, (AND p0 p2), p0, (AND p2 p1 p0), (AND p0 p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s231 1)) (AND (GEQ s0 1) (GEQ s225 1)) (AND (GEQ s0 1) (GEQ s226 1)) (AND (GEQ s0 1) (GEQ s227 1)) (AND (GEQ s0 1) (GEQ s228 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10242 reset in 546 ms.
Product exploration explored 100000 steps with 10261 reset in 557 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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1353 ms. Reduced automaton from 6 states, 21 edges and 3 AP to 6 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[true, p2, p0, (AND p0 p2), (AND p0 p1), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 1021 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 679450 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{0=1, 2=1, 3=1, 4=1, 6=1, 8=1, 9=1, 12=1}
Probabilistic random walk after 679450 steps, saw 105505 distinct states, run finished after 3002 ms. (steps per millisecond=226 ) properties seen :8
Running SMT prover for 5 properties.
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:52] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 17:24:52] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 22 ms returned sat
[2022-05-19 17:24:52] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 17:24:52] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 16 ms returned sat
[2022-05-19 17:24:52] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p1))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F p1), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p1))), (F p2), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 32 factoid took 1197 ms. Reduced automaton from 6 states, 21 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND (NOT p1) p2 p0), (AND p1 (NOT p2) p0)]
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p1) p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND (NOT p1) p2 p0), (AND p1 (NOT p2) p0)]
Support contains 72 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 112/112 transitions.
Applied a total of 0 rules in 1 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 17:24:54] [INFO ] Computed 126 place invariants in 6 ms
[2022-05-19 17:24:54] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:54] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 17:24:54] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:54] [INFO ] Computed 126 place invariants in 14 ms
[2022-05-19 17:24:54] [INFO ] Dead Transitions using invariants and state equation in 99 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 (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 702 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p1)), false, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), false, (AND (NOT p1) p2 p0), (AND p1 (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 1021 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 2043947 steps, run timeout after 3001 ms. (steps per millisecond=681 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 2043947 steps, saw 327413 distinct states, run finished after 3001 ms. (steps per millisecond=681 ) properties seen :6
Running SMT prover for 1 properties.
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:24:59] [INFO ] Computed 126 place invariants in 5 ms
[2022-05-19 17:24:59] [INFO ] [Real]Absence check using 0 positive and 126 generalized place invariants in 15 ms returned sat
[2022-05-19 17:24:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:24:59] [INFO ] [Nat]Absence check using 0 positive and 126 generalized place invariants in 13 ms returned sat
[2022-05-19 17:24:59] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p0) p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (AND (NOT p1) p2)), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 16 factoid took 921 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[true, (AND p0 p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (AND p0 p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p0)]
Stuttering acceptance computed with spot in 196 ms :[true, (AND p0 p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p0)]
Product exploration explored 100000 steps with 10240 reset in 312 ms.
Product exploration explored 100000 steps with 10255 reset in 310 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[true, (AND p0 p1 p2), p0, (AND p0 p1 p2), (AND p0 p2), (AND p1 p0)]
Support contains 72 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 112/112 transitions.
Applied a total of 0 rules in 12 ms. Remains 235 /235 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2022-05-19 17:25:02] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 112 rows 235 cols
[2022-05-19 17:25:02] [INFO ] Computed 126 place invariants in 2 ms
[2022-05-19 17:25:02] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 112/112 transitions.
Product exploration explored 100000 steps with 10238 reset in 314 ms.
Product exploration explored 100000 steps with 10252 reset in 334 ms.
Built C files in :
/tmp/ltsmin4511401258859698965
[2022-05-19 17:25:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4511401258859698965
Running compilation step : cd /tmp/ltsmin4511401258859698965;'/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 410 ms.
Running link step : cd /tmp/ltsmin4511401258859698965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4511401258859698965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10727255598127513740.hoa' '--buchi-type=spotba'
LTSmin run took 6718 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-09 finished in 25222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0)&&p2)))'
Support contains 9 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 10 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 17:25:10] [INFO ] Computed 138 place invariants in 5 ms
[2022-05-19 17:25:10] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:25:10] [INFO ] Computed 138 place invariants in 7 ms
[2022-05-19 17:25:10] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 344 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 4 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 111 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s239 1), p2:(OR (LT s239 1) (AND (GEQ s0 1) (GEQ s238 1)) (AND (GEQ s0 1) (GEQ s232 1)) (AND (GEQ s0 1) (GEQ s233 1)) (AND (GEQ s0 1) (GEQ s234 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-11 finished in 488 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 48 are kept as prefixes of interest. Removing 204 places using SCC suffix rule.1 ms
Discarding 204 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 47 transition count 36
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 1 with 2 rules applied. Total rules applied 38 place count 46 transition count 35
Applied a total of 38 rules in 13 ms. Remains 46 /252 variables (removed 206) and now considering 35/116 (removed 81) transitions.
// Phase 1: matrix 35 rows 46 cols
[2022-05-19 17:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 17:25:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 35 rows 46 cols
[2022-05-19 17:25:10] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-19 17:25:10] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [22, 23, 24, 25, 26, 27, 28]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 76 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/252 places, 35/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 39/252 places, 35/116 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-12 finished in 146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 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 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 241 transition count 111
Applied a total of 5 rules in 14 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2022-05-19 17:25:10] [INFO ] Computed 132 place invariants in 4 ms
[2022-05-19 17:25:10] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 111 rows 241 cols
[2022-05-19 17:25:10] [INFO ] Computed 132 place invariants in 3 ms
[2022-05-19 17:25:11] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 347 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/252 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 227/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s197 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s0 1) (GEQ s201 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-13 finished in 406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F((F(p0)&&p0)))||X(p1)))&&X(X(F(p2)))))'
Support contains 29 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 17:25:11] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 17:25:11] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 116 rows 252 cols
[2022-05-19 17:25:11] [INFO ] Computed 138 place invariants in 3 ms
[2022-05-19 17:25:11] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 327 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 137 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s169 1) (GEQ s204 1)) (AND (GEQ s172 1) (GEQ s207 1)) (AND (GEQ s173 1) (GEQ s208 1)) (AND (GEQ s170 1) (GEQ s205 1)) (AND (GEQ s171 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-14 finished in 492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((((p1 U p2)||!F(p2))&&p0))) U p3))'
Support contains 18 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 70 are kept as prefixes of interest. Removing 182 places using SCC suffix rule.1 ms
Discarding 182 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 70 transition count 54
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 1 with 2 rules applied. Total rules applied 30 place count 69 transition count 53
Applied a total of 30 rules in 4 ms. Remains 69 /252 variables (removed 183) and now considering 53/116 (removed 63) transitions.
// Phase 1: matrix 53 rows 69 cols
[2022-05-19 17:25:11] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 17:25:11] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 53 rows 69 cols
[2022-05-19 17:25:11] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 17:25:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-19 17:25:11] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 53 rows 69 cols
[2022-05-19 17:25:11] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-19 17:25:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/252 places, 53/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/252 places, 53/116 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p3), (NOT p0), (NOT p0), (AND (NOT p0) p2), false]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s67 1)), p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4...], 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-15 finished in 361 ms.
All properties solved by simple procedures.
Total runtime 50919 ms.

BK_STOP 1652981112449

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-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-COL-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-165277017300908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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