Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951000812.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r297-tall-167873951000812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.6K Feb 26 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679655205248

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 10:53:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 10:53:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:53:27] [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.
[2023-03-24 10:53:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 10:53:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2023-03-24 10:53:27] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 10:53:28] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-24 10:53:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-06 FALSE 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 10 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 10000 steps, including 759 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 19) seen :13
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 347 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 10:53:28] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-24 10:53:29] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 10:53:29] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-24 10:53:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 10:53:29] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-24 10:53:29] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-24 10:53:29] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 6 properties in 3 ms.
[2023-03-24 10:53:29] [INFO ] Flatten gal took : 25 ms
[2023-03-24 10:53:29] [INFO ] Flatten gal took : 8 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2023-03-24 10:53:29] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 11 ms.
[2023-03-24 10:53:29] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 245 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 9 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-24 10:53:29] [INFO ] Computed 138 place invariants in 11 ms
[2023-03-24 10:53:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-24 10:53:29] [INFO ] Invariant cache hit.
[2023-03-24 10:53:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-24 10:53:29] [INFO ] Invariant cache hit.
[2023-03-24 10:53:29] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 245 out of 252 places after structural reductions.
[2023-03-24 10:53:29] [INFO ] Flatten gal took : 24 ms
[2023-03-24 10:53:29] [INFO ] Flatten gal took : 30 ms
[2023-03-24 10:53:30] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 244 out of 252 places (down from 245) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 985 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 15 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 1000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=142 ) 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 15 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 18 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 9 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 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-24 10:53:30] [INFO ] Invariant cache hit.
[2023-03-24 10:53:30] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 21 ms returned sat
[2023-03-24 10:53:30] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-24 10:53:30] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 19 ms returned sat
[2023-03-24 10:53:31] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-24 10:53:31] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-24 10:53:32] [INFO ] After 1282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Finished Parikh walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 18 properties in 14 ms.
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||((!p0||G(!p1)) U p2)))'
Support contains 65 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 12 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-24 10:53:32] [INFO ] Invariant cache hit.
[2023-03-24 10:53:32] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-24 10:53:32] [INFO ] Invariant cache hit.
[2023-03-24 10:53:32] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-24 10:53:32] [INFO ] Invariant cache hit.
[2023-03-24 10:53:33] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 252/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), true, (NOT p2), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s249 1), p0:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ s120 1) (GEQ s127 1) (GEQ s134 1) (GEQ s141 1) (GEQ s197 1)) (AND (GEQ s105 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 5 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-00 finished in 963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p1 U (p2||G(!p1))))))'
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 14 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-24 10:53:33] [INFO ] Invariant cache hit.
[2023-03-24 10:53:33] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-24 10:53:33] [INFO ] Invariant cache hit.
[2023-03-24 10:53:33] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 400 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 LTL mode , in 2 iterations and 419 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s186 1) (GEQ s200 1)) (AND (GEQ s184 1) (GEQ s198 1)) (AND (GEQ s188 1) (GEQ s202 1)) (AND (GEQ s183 1) (GEQ s197 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28865 reset in 378 ms.
Product exploration explored 100000 steps with 28926 reset in 256 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 : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 9 factoid took 487 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 984 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 180 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-24 10:53:35] [INFO ] Computed 132 place invariants in 19 ms
[2023-03-24 10:53:35] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 18 ms returned sat
[2023-03-24 10:53:35] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 10:53:35] [INFO ] After 72ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:53:35] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:53:35] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 21 ms returned sat
[2023-03-24 10:53:35] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:53:35] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-24 10:53:35] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 9 factoid took 534 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 151 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 16 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-24 10:53:36] [INFO ] Invariant cache hit.
[2023-03-24 10:53:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-24 10:53:36] [INFO ] Invariant cache hit.
[2023-03-24 10:53:37] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-24 10:53:37] [INFO ] Invariant cache hit.
[2023-03-24 10:53:37] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 245/245 places, 116/116 transitions.
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 : [(AND p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 10:53:37] [INFO ] Invariant cache hit.
[2023-03-24 10:53:37] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 18 ms returned sat
[2023-03-24 10:53:38] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 10:53:38] [INFO ] After 77ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:53:38] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 10:53:38] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 19 ms returned sat
[2023-03-24 10:53:38] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 10:53:38] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-24 10:53:38] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 4 factoid took 322 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 32505 reset in 191 ms.
Product exploration explored 100000 steps with 32677 reset in 205 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 31 ms. Remains 245 /245 variables (removed 0) and now considering 117/116 (removed -1) transitions.
[2023-03-24 10:53:39] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 117 rows 245 cols
[2023-03-24 10:53:39] [INFO ] Computed 132 place invariants in 6 ms
[2023-03-24 10:53:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/245 places, 117/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 245/245 places, 117/116 transitions.
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 245 cols
[2023-03-24 10:53:39] [INFO ] Computed 132 place invariants in 4 ms
[2023-03-24 10:53:40] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-24 10:53:40] [INFO ] Invariant cache hit.
[2023-03-24 10:53:40] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-24 10:53:40] [INFO ] Invariant cache hit.
[2023-03-24 10:53:40] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-01 finished in 7042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(!p0)&&G(p1)))))'
Support contains 15 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
[2023-03-24 10:53:40] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-24 10:53:40] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-24 10:53:40] [INFO ] Invariant cache hit.
[2023-03-24 10:53:40] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 429 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 LTL mode , in 2 iterations and 437 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(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][false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-02 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0&&(p1 U p2))) U (p3&&F(G(p4))))))'
Support contains 121 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
Applied a total of 2 rules in 14 ms. Remains 250 /252 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2023-03-24 10:53:41] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-24 10:53:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-24 10:53:41] [INFO ] Invariant cache hit.
[2023-03-24 10:53:41] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [183, 184, 185, 186, 187, 188, 189]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 310 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/252 places, 114/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 243/252 places, 114/116 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p3) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p4), (OR (NOT p4) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p3 (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p4)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}], [{ cond=p4, acceptance={} source=4 dest: 4}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(LT s239 1), 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 s183 1)) (AND (GEQ s7 1) (GEQ s14 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-03 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 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.2 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 20 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2023-03-24 10:53:41] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-24 10:53:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-24 10:53:41] [INFO ] Invariant cache hit.
[2023-03-24 10:53:42] [INFO ] Implicit Places using invariants and state equation in 240 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 394 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 228/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s148 1) (GEQ s197 1)) (AND (GEQ s152 1) (GEQ s201 1)) (AND (GEQ s149 1) (GEQ s198 1)) (AND (GEQ s151 1) (GEQ s200 1)) (AND (GEQ s153 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-04 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 71 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.3 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
[2023-03-24 10:53:42] [INFO ] Computed 132 place invariants in 8 ms
[2023-03-24 10:53:42] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-24 10:53:42] [INFO ] Invariant cache hit.
[2023-03-24 10:53:42] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [176, 177, 178, 179, 180, 181, 182]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 353 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 373 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s214 1) (GEQ s213 1) (GEQ s212 1) (GEQ s211 1) (GEQ s217 1) (GEQ s216 1) (GEQ s215 1)), p1:(OR (AND (GEQ s99 1) (GEQ s106 1) (GEQ s113 1) (GEQ...], 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 14841 reset in 290 ms.
Product exploration explored 100000 steps with 14848 reset in 315 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
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 p0) (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-05 finished in 1260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 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
[2023-03-24 10:53:43] [INFO ] Computed 138 place invariants in 7 ms
[2023-03-24 10:53:43] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-24 10:53:43] [INFO ] Invariant cache hit.
[2023-03-24 10:53:43] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 399 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 LTL mode , in 2 iterations and 405 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s222 1)) (AND (GEQ s0 1) (GEQ s223 1)) (AND (GEQ s0 1) (GEQ s224 1)) (AND (GEQ s0 1) (GEQ s218 1)) (AND (GEQ s0 1) (GEQ s219 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-07 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||((p1||G(p0))&&p2))))'
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.
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 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
[2023-03-24 10:53:43] [INFO ] Computed 132 place invariants in 4 ms
[2023-03-24 10:53:44] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-24 10:53:44] [INFO ] Invariant cache hit.
[2023-03-24 10:53:44] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [190, 191, 192, 193, 194, 195, 196]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 399 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 SI_LTL mode , in 2 iterations and 424 ms. Remains : 235/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (LT s0 1) (LT s190 1)) (OR (LT s0 1) (LT s191 1)) (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-08 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((!p0||G(p1)))||(!p2&&(!p0||G(p1)))))))'
Support contains 65 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 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-24 10:53:44] [INFO ] Computed 138 place invariants in 2 ms
[2023-03-24 10:53:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-24 10:53:44] [INFO ] Invariant cache hit.
[2023-03-24 10:53:44] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 354 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 LTL mode , in 2 iterations and 357 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT 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=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1)), p1:(AND (GEQ s239 1) (OR (AND (GEQ s57 1) (GEQ s58 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]]
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Product exploration explored 100000 steps with 50000 reset in 231 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 12 factoid took 377 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-09 finished in 1478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&X(p0))))'
Support contains 22 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 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-24 10:53:45] [INFO ] Invariant cache hit.
[2023-03-24 10:53:46] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-24 10:53:46] [INFO ] Invariant cache hit.
[2023-03-24 10:53:46] [INFO ] Implicit Places using invariants and state equation in 267 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 441 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 LTL mode , in 2 iterations and 444 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, true, true, (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s186 1) (LT s200 1)) (OR (LT s184 1) (LT s198 1)) (OR (LT s188 1) (LT s202 1)) (OR (LT s183 1) (LT s197 1)) (OR (LT s185 1) (LT s199 1)) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 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 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!p1)))'
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 1 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2023-03-24 10:53:46] [INFO ] Invariant cache hit.
[2023-03-24 10:53:46] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-24 10:53:46] [INFO ] Invariant cache hit.
[2023-03-24 10:53:46] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 402 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 LTL mode , in 2 iterations and 406 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) p1), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s239 1), p1:(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 s...], 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]]
Entered a terminal (fully accepting) state of product in 1 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 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U !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.2 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 1 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 17 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2023-03-24 10:53:47] [INFO ] Computed 132 place invariants in 2 ms
[2023-03-24 10:53:47] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-24 10:53:47] [INFO ] Invariant cache hit.
[2023-03-24 10:53:47] [INFO ] Implicit Places using invariants and state equation in 241 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 398 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 SI_LTL mode , in 2 iterations and 421 ms. Remains : 227/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s192 1)) (OR (LT s0 1) (LT s193 1)) (OR (LT s0 1) (LT s194 1)) (OR (LT s0 1) (LT s195 1)) (OR (LT s0 1) (LT s196 1)) (OR (LT s0 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, 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 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G(F(!p1))))))'
Support contains 16 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
[2023-03-24 10:53:47] [INFO ] Computed 138 place invariants in 6 ms
[2023-03-24 10:53:47] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-24 10:53:47] [INFO ] Invariant cache hit.
[2023-03-24 10:53:48] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 494 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 LTL mode , in 2 iterations and 500 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), p1, 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=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s162 1) (LT s163 1) (LT s164 1) (LT s165 1) (LT s166 1) (LT s167 1) (LT s168 1) (LT s241 1)), p1:(AND (OR (LT s0 1) (LT s206 1)) (OR (LT s0 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9826 reset in 133 ms.
Product exploration explored 100000 steps with 9838 reset in 140 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 : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 713 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 180 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 192 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 116 rows 245 cols
[2023-03-24 10:53:49] [INFO ] Computed 132 place invariants in 8 ms
[2023-03-24 10:53:49] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 22 ms returned sat
[2023-03-24 10:53:49] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 10:53:49] [INFO ] After 106ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 10:53:49] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 10:53:50] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 21 ms returned sat
[2023-03-24 10:53:50] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 10:53:50] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-24 10:53:50] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 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.
[2023-03-24 10:53:50] [INFO ] Invariant cache hit.
[2023-03-24 10:53:51] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-24 10:53:51] [INFO ] Invariant cache hit.
[2023-03-24 10:53:51] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-24 10:53:51] [INFO ] Invariant cache hit.
[2023-03-24 10:53:51] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 245/245 places, 116/116 transitions.
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 : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 985 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 189 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 10:53:52] [INFO ] Invariant cache hit.
[2023-03-24 10:53:52] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 20 ms returned sat
[2023-03-24 10:53:52] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 10:53:52] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 10:53:52] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 10:53:52] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 20 ms returned sat
[2023-03-24 10:53:52] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 10:53:52] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-24 10:53:52] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 445 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 9837 reset in 140 ms.
Product exploration explored 100000 steps with 9837 reset in 142 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 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 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 27 ms. Remains 237 /245 variables (removed 8) and now considering 115/116 (removed 1) transitions.
[2023-03-24 10:53:54] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 115 rows 237 cols
[2023-03-24 10:53:54] [INFO ] Computed 126 place invariants in 8 ms
[2023-03-24 10:53:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/245 places, 115/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 237/245 places, 115/116 transitions.
Support contains 16 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 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.
// Phase 1: matrix 116 rows 245 cols
[2023-03-24 10:53:54] [INFO ] Computed 132 place invariants in 5 ms
[2023-03-24 10:53:54] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-24 10:53:54] [INFO ] Invariant cache hit.
[2023-03-24 10:53:54] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-24 10:53:54] [INFO ] Invariant cache hit.
[2023-03-24 10:53:54] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 245/245 places, 116/116 transitions.
Treatment of property QuasiCertifProtocol-COL-06-LTLFireability-14 finished in 7287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(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 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-24 10:53:54] [INFO ] Computed 138 place invariants in 3 ms
[2023-03-24 10:53:55] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-24 10:53:55] [INFO ] Invariant cache hit.
[2023-03-24 10:53:55] [INFO ] Implicit Places using invariants and state equation in 285 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 468 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 LTL mode , in 2 iterations and 475 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s240 1), p2:(LT s239 1), p1:(OR (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s232 1) (GEQ s233 1) (GEQ s238 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11 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 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(!p1 U (p2||G(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&G(F(!p1))))))'
[2023-03-24 10:53:55] [INFO ] Flatten gal took : 14 ms
[2023-03-24 10:53:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-24 10:53:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 2 ms.
Total runtime 28617 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1473/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1473/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-COL-06-LTLFireability-01
Could not compute solution for formula : QuasiCertifProtocol-COL-06-LTLFireability-14

BK_STOP 1679655237888

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name QuasiCertifProtocol-COL-06-LTLFireability-01
ltl formula formula --ltl=/tmp/1473/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 252 places, 116 transitions and 590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1473/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1473/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1473/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1473/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name QuasiCertifProtocol-COL-06-LTLFireability-14
ltl formula formula --ltl=/tmp/1473/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 252 places, 116 transitions and 590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1473/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1473/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1473/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1473/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r297-tall-167873951000812"
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 ;