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.r295-tall-167873948500876.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 lolaxred
Input is QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500876
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 30K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:20 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 6.3K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K 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-PT-10-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678917617137

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:00:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 22:00:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:00:18] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-15 22:00:18] [INFO ] Transformed 550 places.
[2023-03-15 22:00:18] [INFO ] Transformed 176 transitions.
[2023-03-15 22:00:18] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 354 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 24 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2023-03-15 22:00:19] [INFO ] Computed 350 place invariants in 23 ms
[2023-03-15 22:00:19] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-15 22:00:19] [INFO ] Invariant cache hit.
[2023-03-15 22:00:19] [INFO ] Implicit Places using invariants and state equation in 349 ms returned [303, 304, 311, 313, 314, 315, 316, 317, 318, 355]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 709 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 743 ms. Remains : 514/550 places, 176/176 transitions.
Support contains 354 out of 514 places after structural reductions.
[2023-03-15 22:00:20] [INFO ] Flatten gal took : 55 ms
[2023-03-15 22:00:20] [INFO ] Flatten gal took : 29 ms
[2023-03-15 22:00:20] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 24) seen :7
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 22:00:20] [INFO ] Computed 340 place invariants in 6 ms
[2023-03-15 22:00:21] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 166 ms returned sat
[2023-03-15 22:00:22] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:16
[2023-03-15 22:00:22] [INFO ] After 256ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:16
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 22:00:22] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:16
[2023-03-15 22:00:22] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 50 ms returned sat
[2023-03-15 22:00:23] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-15 22:00:23] [INFO ] After 1310ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-03-15 22:00:24] [INFO ] After 2263ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 16 properties in 16 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
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(X((F(G(p0))&&G(p1)))))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:24] [INFO ] Invariant cache hit.
[2023-03-15 22:00:25] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-15 22:00:25] [INFO ] Invariant cache hit.
[2023-03-15 22:00:25] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 947 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 24 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 991 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s77 1), p0:(LT s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6916 reset in 279 ms.
Product exploration explored 100000 steps with 6925 reset in 196 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 13 ms. (steps per millisecond=36 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 13 ms. (steps per millisecond=36 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 513 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 23 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 22:00:27] [INFO ] Computed 340 place invariants in 31 ms
[2023-03-15 22:00:28] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-15 22:00:28] [INFO ] Invariant cache hit.
[2023-03-15 22:00:28] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2023-03-15 22:00:28] [INFO ] Invariant cache hit.
[2023-03-15 22:00:28] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1066 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471 steps, run visited all 1 properties in 7 ms. (steps per millisecond=67 )
Probabilistic random walk after 471 steps, saw 448 distinct states, run finished after 7 ms. (steps per millisecond=67 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6927 reset in 225 ms.
Product exploration explored 100000 steps with 6918 reset in 149 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 346 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.9 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 346 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 346 transition count 130
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 24 rules in 66 ms. Remains 346 /513 variables (removed 167) and now considering 130/176 (removed 46) transitions.
[2023-03-15 22:00:30] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 130 rows 346 cols
[2023-03-15 22:00:30] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-15 22:00:30] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/513 places, 130/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 346/513 places, 130/176 transitions.
Support contains 1 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 22:00:30] [INFO ] Computed 340 place invariants in 24 ms
[2023-03-15 22:00:30] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-15 22:00:30] [INFO ] Invariant cache hit.
[2023-03-15 22:00:31] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-15 22:00:31] [INFO ] Invariant cache hit.
[2023-03-15 22:00:31] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1129 ms. Remains : 513/513 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-00 finished in 6954 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)||X(F(p1)))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 22:00:31] [INFO ] Computed 340 place invariants in 4 ms
[2023-03-15 22:00:32] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-15 22:00:32] [INFO ] Invariant cache hit.
[2023-03-15 22:00:32] [INFO ] Implicit Places using invariants and state equation in 603 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 919 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 936 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s468 1) (GEQ s469 1) (GEQ s470 1) (GEQ s471 1) (GEQ s472 1) (GEQ s473 1) (GEQ s474 1) (GEQ s475 1) (GEQ s476 1) (GEQ s478 1) (GEQ...], 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 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-01 finished in 1067 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(X(F(p0)))))'
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:32] [INFO ] Invariant cache hit.
[2023-03-15 22:00:33] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-15 22:00:33] [INFO ] Invariant cache hit.
[2023-03-15 22:00:33] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 947 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 967 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LT s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15334 reset in 244 ms.
Product exploration explored 100000 steps with 15427 reset in 288 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-03 finished in 1889 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((X(G((G(F(!p1)) U p2)))||p0)))'
Support contains 45 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:34] [INFO ] Invariant cache hit.
[2023-03-15 22:00:35] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-15 22:00:35] [INFO ] Invariant cache hit.
[2023-03-15 22:00:35] [INFO ] Implicit Places using invariants and state equation in 512 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 823 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 848 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), p1, p1, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s480 1)) (AND (GEQ s68 1) (GEQ s421 1)) (AND (GEQ s72 1) (GEQ s425 1)) (AND (GEQ s69 1) (GEQ s481 1)) (AND (GEQ s81 1) (GEQ s...], 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]]
Stuttering criterion allowed to conclude after 38488 steps with 2662 reset in 122 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-04 finished in 1187 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)))||G(((p2||X(p0))&&p1))))'
Support contains 276 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:35] [INFO ] Invariant cache hit.
[2023-03-15 22:00:36] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-15 22:00:36] [INFO ] Invariant cache hit.
[2023-03-15 22:00:36] [INFO ] Implicit Places using invariants and state equation in 403 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 588 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 596 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s10 1) (LT s174 1) (LT s175 1) (LT s176 1) (LT s177 1) (LT s194 1) (LT s195 1) (LT s197 1) (LT s198 1) (LT s199 1) (LT s200 1) (LT s201 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6923 reset in 324 ms.
Product exploration explored 100000 steps with 6926 reset in 337 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 356 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 22:00:38] [INFO ] Computed 340 place invariants in 24 ms
[2023-03-15 22:00:38] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 50 ms returned sat
[2023-03-15 22:00:38] [INFO ] After 250ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 22:00:39] [INFO ] After 427ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-15 22:00:39] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 414 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:39] [INFO ] Invariant cache hit.
[2023-03-15 22:00:40] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-15 22:00:40] [INFO ] Invariant cache hit.
[2023-03-15 22:00:40] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2023-03-15 22:00:40] [INFO ] Invariant cache hit.
[2023-03-15 22:00:40] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:00:41] [INFO ] Invariant cache hit.
[2023-03-15 22:00:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 51 ms returned sat
[2023-03-15 22:00:41] [INFO ] After 331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 22:00:42] [INFO ] After 480ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:00:42] [INFO ] After 624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:00:42] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2023-03-15 22:00:42] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:00:42] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-15 22:00:42] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6924 reset in 327 ms.
Product exploration explored 100000 steps with 6931 reset in 331 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 501 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Discarding 12 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
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 501 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 27 ms. Remains 501 /513 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:44] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 176 rows 501 cols
[2023-03-15 22:00:44] [INFO ] Computed 330 place invariants in 19 ms
[2023-03-15 22:00:44] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/513 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 501/513 places, 176/176 transitions.
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 22:00:44] [INFO ] Computed 340 place invariants in 21 ms
[2023-03-15 22:00:44] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-15 22:00:44] [INFO ] Invariant cache hit.
[2023-03-15 22:00:45] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-15 22:00:45] [INFO ] Invariant cache hit.
[2023-03-15 22:00:45] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 513/513 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 9676 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)||(p1&&X(p0)))))'
Support contains 23 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 22:00:45] [INFO ] Computed 340 place invariants in 6 ms
[2023-03-15 22:00:45] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-15 22:00:45] [INFO ] Invariant cache hit.
[2023-03-15 22:00:46] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 881 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s68 1)) (AND (GEQ s0 1) (GEQ s69 1)) (AND (GEQ s0 1) (GEQ s81 1)) (AND (GEQ s0 1) (GEQ s67 1)) (AND (GEQ s0 1) (GEQ s79 1)) (A...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-07 finished in 1068 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)))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:46] [INFO ] Invariant cache hit.
[2023-03-15 22:00:46] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-15 22:00:46] [INFO ] Invariant cache hit.
[2023-03-15 22:00:47] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 919 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 941 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s63 1) (GEQ s467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-08 finished in 1056 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(F(p1))||(G(p3)&&p2))))'
Support contains 27 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 22:00:47] [INFO ] Invariant cache hit.
[2023-03-15 22:00:48] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-15 22:00:48] [INFO ] Invariant cache hit.
[2023-03-15 22:00:48] [INFO ] Implicit Places using invariants and state equation in 588 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/514 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 905 ms. Remains : 513/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p3 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s57 1) (GEQ s464 1)), p2:(AND (GEQ s75 1) (GEQ s452 1) (GEQ s453 1) (GEQ s454 1) (GEQ s455 1) (GEQ s459 1) (GEQ s485 1) (GEQ s486 1) (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 4 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-09 finished in 1049 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)&&F(G(p1)))))'
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 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 500 transition count 172
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 500 transition count 172
Applied a total of 4 rules in 44 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-15 22:00:48] [INFO ] Computed 330 place invariants in 8 ms
[2023-03-15 22:00:49] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-15 22:00:49] [INFO ] Invariant cache hit.
[2023-03-15 22:00:49] [INFO ] Implicit Places using invariants and state equation in 515 ms returned [307, 419, 420, 421, 422, 423, 424, 476, 479, 480, 481, 482]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 826 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/514 places, 172/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 488 /488 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 883 ms. Remains : 488/514 places, 172/176 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-11 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:(AND (GEQ s0 1) (GEQ s77 1)), p1:(OR (LT s49 1) (LT s484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-11 finished in 1014 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(F(!p0))||(F(!p0)&&F((!p1&&X(G(p2))))))))'
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 22:00:49] [INFO ] Computed 340 place invariants in 10 ms
[2023-03-15 22:00:50] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-15 22:00:50] [INFO ] Invariant cache hit.
[2023-03-15 22:00:50] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-15 22:00:50] [INFO ] Invariant cache hit.
[2023-03-15 22:00:50] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1063 ms. Remains : 514/514 places, 176/176 transitions.
Stuttering acceptance computed with spot in 288 ms :[p0, p0, p0, (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s29 1) (GEQ s331 1) (GEQ s340 1) (GEQ s343 1) (GEQ s363 1) (GEQ s368 1) (GEQ s386 1) (GEQ s394 1) (GEQ s399 1) (GEQ s419 1) (GEQ s434 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6931 reset in 185 ms.
Product exploration explored 100000 steps with 6917 reset in 191 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
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 p1)), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 14 factoid took 405 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-13 finished in 2254 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||G(!p1))))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 359 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.5 ms
Discarding 155 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 358 transition count 130
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 358 transition count 130
Applied a total of 24 rules in 25 ms. Remains 358 /514 variables (removed 156) and now considering 130/176 (removed 46) transitions.
// Phase 1: matrix 130 rows 358 cols
[2023-03-15 22:00:52] [INFO ] Computed 230 place invariants in 2 ms
[2023-03-15 22:00:52] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-15 22:00:52] [INFO ] Invariant cache hit.
[2023-03-15 22:00:52] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [165, 268, 269, 270, 271, 272, 273, 323, 326, 327, 328, 329]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 524 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/514 places, 130/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 346 /346 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 346/514 places, 130/176 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s53 1), p0:(GEQ s57 1)], nbAcceptance=1, 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 14 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-14 finished in 608 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)))'
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 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 499 transition count 171
Applied a total of 5 rules in 23 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2023-03-15 22:00:52] [INFO ] Computed 330 place invariants in 6 ms
[2023-03-15 22:00:52] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-15 22:00:52] [INFO ] Invariant cache hit.
[2023-03-15 22:00:53] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 791 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/514 places, 171/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 824 ms. Remains : 487/514 places, 171/176 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s39 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]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-15 finished in 898 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(G(p0))&&G(p1)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-10-LTLFireability-00
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 2 out of 514 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 347 are kept as prefixes of interest. Removing 167 places using SCC suffix rule.2 ms
Discarding 167 places :
Also discarding 25 output transitions
Drop transitions removed 25 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 346 transition count 128
Applied a total of 23 rules in 14 ms. Remains 346 /514 variables (removed 168) and now considering 128/176 (removed 48) transitions.
// Phase 1: matrix 128 rows 346 cols
[2023-03-15 22:00:53] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-15 22:00:53] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-15 22:00:53] [INFO ] Invariant cache hit.
[2023-03-15 22:00:54] [INFO ] Implicit Places using invariants and state equation in 314 ms returned [164, 267, 268, 269, 270, 271, 272, 322, 325, 326, 327, 328]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 516 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 334/514 places, 128/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 536 ms. Remains : 334/514 places, 128/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s54 1), p0:(LT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6651 reset in 162 ms.
Product exploration explored 100000 steps with 6640 reset in 174 ms.
Computed a total of 334 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 334 transition count 128
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 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 619 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 483 steps, run visited all 1 properties in 4 ms. (steps per millisecond=120 )
Probabilistic random walk after 483 steps, saw 461 distinct states, run finished after 4 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 334 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 334 cols
[2023-03-15 22:00:55] [INFO ] Computed 210 place invariants in 4 ms
[2023-03-15 22:00:55] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-15 22:00:55] [INFO ] Invariant cache hit.
[2023-03-15 22:00:56] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-15 22:00:56] [INFO ] Invariant cache hit.
[2023-03-15 22:00:56] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 334/334 places, 128/128 transitions.
Computed a total of 334 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 334 transition count 128
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 : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 617 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 483 steps, run visited all 1 properties in 4 ms. (steps per millisecond=120 )
Probabilistic random walk after 483 steps, saw 461 distinct states, run finished after 4 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [p1, (X (X p1)), (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6631 reset in 167 ms.
Product exploration explored 100000 steps with 6647 reset in 167 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 334/334 places, 128/128 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 334 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 18 ms. Remains 334 /334 variables (removed 0) and now considering 129/128 (removed -1) transitions.
[2023-03-15 22:00:57] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 129 rows 334 cols
[2023-03-15 22:00:57] [INFO ] Computed 210 place invariants in 1 ms
[2023-03-15 22:00:57] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 334/334 places, 129/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 334/334 places, 129/128 transitions.
Support contains 1 out of 334 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 334 /334 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 334 cols
[2023-03-15 22:00:57] [INFO ] Computed 210 place invariants in 1 ms
[2023-03-15 22:00:57] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-15 22:00:57] [INFO ] Invariant cache hit.
[2023-03-15 22:00:58] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-15 22:00:58] [INFO ] Invariant cache hit.
[2023-03-15 22:00:58] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 334/334 places, 128/128 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-00 finished in 4821 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)))||G(((p2||X(p0))&&p1))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-10-LTLFireability-05
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 514 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 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 500 transition count 172
Applied a total of 5 rules in 14 ms. Remains 500 /514 variables (removed 14) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-15 22:00:58] [INFO ] Computed 330 place invariants in 6 ms
[2023-03-15 22:00:58] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-15 22:00:58] [INFO ] Invariant cache hit.
[2023-03-15 22:00:59] [INFO ] Implicit Places using invariants and state equation in 352 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 538 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 499/514 places, 172/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 559 ms. Remains : 499/514 places, 172/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (LT s10 1) (LT s171 1) (LT s172 1) (LT s173 1) (LT s174 1) (LT s191 1) (LT s192 1) (LT s194 1) (LT s195 1) (LT s196 1) (LT s197 1) (LT s198 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6923 reset in 322 ms.
Product exploration explored 100000 steps with 6926 reset in 335 ms.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
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 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 441 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 696 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 172 rows 499 cols
[2023-03-15 22:01:00] [INFO ] Computed 330 place invariants in 16 ms
[2023-03-15 22:01:00] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 46 ms returned sat
[2023-03-15 22:01:01] [INFO ] After 305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 22:01:01] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-15 22:01:01] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:01:01] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 44 ms returned sat
[2023-03-15 22:01:02] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:01:02] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-15 22:01:02] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (X (NOT p0))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p2 (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 338 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 22:01:02] [INFO ] Invariant cache hit.
[2023-03-15 22:01:03] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-15 22:01:03] [INFO ] Invariant cache hit.
[2023-03-15 22:01:03] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-15 22:01:03] [INFO ] Invariant cache hit.
[2023-03-15 22:01:03] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 499/499 places, 172/172 transitions.
Computed a total of 499 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 499 transition count 172
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) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:01:04] [INFO ] Invariant cache hit.
[2023-03-15 22:01:04] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 47 ms returned sat
[2023-03-15 22:01:04] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:01:05] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 46 ms returned sat
[2023-03-15 22:01:05] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:01:05] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-15 22:01:05] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (AND p2 (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 (NOT p0) p1))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 6929 reset in 330 ms.
Product exploration explored 100000 steps with 6921 reset in 334 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 14 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 22:01:07] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 22:01:07] [INFO ] Invariant cache hit.
[2023-03-15 22:01:07] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 499/499 places, 172/172 transitions.
Support contains 276 out of 499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 499/499 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 499 /499 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 22:01:07] [INFO ] Invariant cache hit.
[2023-03-15 22:01:07] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-15 22:01:07] [INFO ] Invariant cache hit.
[2023-03-15 22:01:07] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-15 22:01:07] [INFO ] Invariant cache hit.
[2023-03-15 22:01:08] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 499/499 places, 172/172 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLFireability-05 finished in 9818 ms.
[2023-03-15 22:01:08] [INFO ] Flatten gal took : 25 ms
[2023-03-15 22:01:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-15 22:01:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 514 places, 176 transitions and 1172 arcs took 2 ms.
Total runtime 49611 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA QuasiCertifProtocol-PT-10-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678917745271

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-10-LTLFireability-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 3/32 QuasiCertifProtocol-PT-10-LTLFireability-05 378671 m, 75734 m/sec, 2728268 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 6/32 QuasiCertifProtocol-PT-10-LTLFireability-05 732429 m, 70751 m/sec, 5457325 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1799 8/32 QuasiCertifProtocol-PT-10-LTLFireability-05 1072923 m, 68098 m/sec, 8092145 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1799 11/32 QuasiCertifProtocol-PT-10-LTLFireability-05 1389995 m, 63414 m/sec, 10687895 t fired, .

Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1799 13/32 QuasiCertifProtocol-PT-10-LTLFireability-05 1712120 m, 64425 m/sec, 13292601 t fired, .

Time elapsed: 26 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1799 15/32 QuasiCertifProtocol-PT-10-LTLFireability-05 2042174 m, 66010 m/sec, 15929865 t fired, .

Time elapsed: 31 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1799 17/32 QuasiCertifProtocol-PT-10-LTLFireability-05 2348805 m, 61326 m/sec, 18509721 t fired, .

Time elapsed: 36 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1799 20/32 QuasiCertifProtocol-PT-10-LTLFireability-05 2644322 m, 59103 m/sec, 21011594 t fired, .

Time elapsed: 41 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1799 21/32 QuasiCertifProtocol-PT-10-LTLFireability-05 2927939 m, 56723 m/sec, 23490618 t fired, .

Time elapsed: 46 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1799 24/32 QuasiCertifProtocol-PT-10-LTLFireability-05 3231988 m, 60809 m/sec, 26005610 t fired, .

Time elapsed: 51 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1799 26/32 QuasiCertifProtocol-PT-10-LTLFireability-05 3552992 m, 64200 m/sec, 28566902 t fired, .

Time elapsed: 56 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1799 28/32 QuasiCertifProtocol-PT-10-LTLFireability-05 3850485 m, 59498 m/sec, 31085553 t fired, .

Time elapsed: 61 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1799 30/32 QuasiCertifProtocol-PT-10-LTLFireability-05 4145849 m, 59072 m/sec, 33557805 t fired, .

Time elapsed: 66 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1799 32/32 QuasiCertifProtocol-PT-10-LTLFireability-05 4425147 m, 55859 m/sec, 36000150 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-PT-10-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-10-LTLFireability-00
lola: time limit : 3524 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-PT-10-LTLFireability-00
lola: result : false
lola: markings : 95
lola: fired transitions : 95
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-10-LTLFireability-00: LTL false LTL model checker
QuasiCertifProtocol-PT-10-LTLFireability-05: LTL unknown AGGR


Time elapsed: 76 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is QuasiCertifProtocol-PT-10, 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 r295-tall-167873948500876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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