About the Execution of LoLa+red for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2128.768 | 538375.00 | 605744.00 | 1882.80 | FTFFFFFFTFFFTTFF | normal |
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-167873948500852.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-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500852
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678916683065
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-COL-32
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:44:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 21:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:44:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 21:44:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 21:44:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 723 ms
[2023-03-15 21:44:45] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 21:44:45] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-15 21:44:45] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 226 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 21:44:45] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-15 21:44:46] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 21:44:46] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 21:44:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-15 21:44:46] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 21:44:46] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-15 21:44:46] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 76 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 2 ms.
[2023-03-15 21:44:46] [INFO ] Flatten gal took : 23 ms
[2023-03-15 21:44:46] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-15 21:44:46] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 29 ms.
[2023-03-15 21:44:46] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 3637 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 39 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:44:46] [INFO ] Computed 3232 place invariants in 242 ms
[2023-03-15 21:44:47] [INFO ] Implicit Places using invariants in 1455 ms returned []
[2023-03-15 21:44:47] [INFO ] Invariant cache hit.
[2023-03-15 21:44:50] [INFO ] Implicit Places using invariants and state equation in 2656 ms returned []
Implicit Place search using SMT with State Equation took 4112 ms to find 0 implicit places.
[2023-03-15 21:44:50] [INFO ] Invariant cache hit.
[2023-03-15 21:44:51] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4856 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3637 out of 3736 places after structural reductions.
[2023-03-15 21:44:51] [INFO ] Flatten gal took : 237 ms
[2023-03-15 21:44:52] [INFO ] Flatten gal took : 159 ms
[2023-03-15 21:44:52] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-15 21:44:53] [INFO ] Invariant cache hit.
[2023-03-15 21:44:55] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 702 ms returned sat
[2023-03-15 21:44:56] [INFO ] After 2470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-15 21:44:58] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 724 ms returned sat
[2023-03-15 21:45:21] [INFO ] After 21983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 21:45:21] [INFO ] After 21993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 21:45:21] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 16 Parikh solutions to 9 different solutions.
Parikh walk visited 15 properties in 48 ms.
Support contains 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.19 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 303 rules applied. Total rules applied 304 place count 3636 transition count 267
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 339 place count 3601 transition count 267
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 339 place count 3601 transition count 168
Deduced a syphon composed of 99 places in 4 ms
Ensure Unique test removed 98 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 635 place count 3404 transition count 168
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 636 place count 3404 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 637 place count 3403 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 637 place count 3403 transition count 166
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 640 place count 3401 transition count 166
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 1056 places
Reduce places removed 1089 places and 0 transitions.
Iterating global reduction 4 with 1122 rules applied. Total rules applied 1762 place count 2312 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1763 place count 2311 transition count 132
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 1796 place count 2278 transition count 132
Applied a total of 1796 rules in 609 ms. Remains 2278 /3736 variables (removed 1458) and now considering 132/506 (removed 374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 2278/3736 places, 132/506 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=21 )
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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' '!(G((p0 U (F(G(p2))||p1))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.27 ms
Discarding 34 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
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 3700 transition count 502
Applied a total of 4 rules in 882 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 21:45:23] [INFO ] Computed 3200 place invariants in 97 ms
[2023-03-15 21:45:27] [INFO ] Implicit Places using invariants in 3933 ms returned []
[2023-03-15 21:45:27] [INFO ] Invariant cache hit.
[2023-03-15 21:45:32] [INFO ] Implicit Places using invariants and state equation in 5320 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 9265 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 150 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10298 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3492 1)) (AND (GEQ s0 1) (GEQ s3490 1)) (AND (GEQ s0 1) (GEQ s3493 1)) (AND (GEQ s0 1) (GEQ s3491 1)) (AND (GEQ s0 1) (GEQ s3...], 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 39 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-00 finished in 10871 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||G(p1)||G(p2)))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 583 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 21:45:33] [INFO ] Computed 3200 place invariants in 73 ms
[2023-03-15 21:45:39] [INFO ] Implicit Places using invariants in 6097 ms returned []
[2023-03-15 21:45:39] [INFO ] Invariant cache hit.
[2023-03-15 21:45:50] [INFO ] Implicit Places using invariants and state equation in 10362 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16493 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 317 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17397 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2467 reset in 716 ms.
Product exploration explored 100000 steps with 2460 reset in 670 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
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 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 325 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-01 finished in 19846 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)&&F(G(p1)))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 125 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:45:53] [INFO ] Computed 3232 place invariants in 75 ms
[2023-03-15 21:45:58] [INFO ] Implicit Places using invariants in 4962 ms returned []
[2023-03-15 21:45:58] [INFO ] Invariant cache hit.
[2023-03-15 21:46:05] [INFO ] Implicit Places using invariants and state equation in 7592 ms returned []
Implicit Place search using SMT with State Equation took 12561 ms to find 0 implicit places.
[2023-03-15 21:46:05] [INFO ] Invariant cache hit.
[2023-03-15 21:46:07] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14086 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-02 finished in 14292 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((G(p1)||p0))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.11 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 285 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-15 21:46:07] [INFO ] Computed 3200 place invariants in 76 ms
[2023-03-15 21:46:09] [INFO ] Implicit Places using invariants in 2249 ms returned []
[2023-03-15 21:46:09] [INFO ] Invariant cache hit.
[2023-03-15 21:46:18] [INFO ] Implicit Places using invariants and state equation in 8690 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10951 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3666/3736 places, 501/506 transitions.
Applied a total of 0 rules in 143 ms. Remains 3666 /3666 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11384 ms. Remains : 3666/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-03 finished in 11515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Support contains 67 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:46:19] [INFO ] Computed 3232 place invariants in 84 ms
[2023-03-15 21:46:25] [INFO ] Implicit Places using invariants in 6149 ms returned []
[2023-03-15 21:46:25] [INFO ] Invariant cache hit.
[2023-03-15 21:46:35] [INFO ] Implicit Places using invariants and state equation in 10555 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16733 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17222 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, p1, true, p1]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-04 finished in 17365 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(((p1&&X(p1))||p0))&&(X(G(p2))||F(p3))))'
Support contains 2245 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 47 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:46:36] [INFO ] Invariant cache hit.
[2023-03-15 21:46:40] [INFO ] Implicit Places using invariants in 3857 ms returned []
[2023-03-15 21:46:40] [INFO ] Invariant cache hit.
[2023-03-15 21:46:46] [INFO ] Implicit Places using invariants and state equation in 6249 ms returned []
Implicit Place search using SMT with State Equation took 10122 ms to find 0 implicit places.
[2023-03-15 21:46:46] [INFO ] Invariant cache hit.
[2023-03-15 21:46:47] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11526 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s2181 1) (GEQ s2214 1) (GEQ s2247 1) (GEQ s2280 1) (GEQ s2313 1) (GEQ s2346 1) (GEQ s2379 1) (GEQ s2412 1) (GEQ s2445 1) (GEQ s2478 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 11 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-05 finished in 11759 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))&&F(p1)) U G(p0)))'
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 247 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:46:48] [INFO ] Invariant cache hit.
[2023-03-15 21:46:54] [INFO ] Implicit Places using invariants in 5877 ms returned []
[2023-03-15 21:46:54] [INFO ] Invariant cache hit.
[2023-03-15 21:47:04] [INFO ] Implicit Places using invariants and state equation in 10681 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16590 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 262 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17099 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3666 1) (LT s3667 1) (LT s3664 1) (LT s3665 1) (LT s3674 1) (LT s3675 1) (LT s3672 1) (LT s3673 1) (LT s3670 1) (LT s3671 1) (LT s3668 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 2676 reset in 553 ms.
Product exploration explored 100000 steps with 2680 reset in 512 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 361 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 118 ms. (steps per millisecond=79 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 120 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 21:47:08] [INFO ] Computed 3200 place invariants in 437 ms
[2023-03-15 21:47:14] [INFO ] Implicit Places using invariants in 6543 ms returned []
[2023-03-15 21:47:14] [INFO ] Invariant cache hit.
[2023-03-15 21:47:25] [INFO ] Implicit Places using invariants and state equation in 10667 ms returned []
Implicit Place search using SMT with State Equation took 17214 ms to find 0 implicit places.
[2023-03-15 21:47:25] [INFO ] Invariant cache hit.
[2023-03-15 21:47:26] [INFO ] Dead Transitions using invariants and state equation in 1422 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18892 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9356 steps, run visited all 1 properties in 112 ms. (steps per millisecond=83 )
Probabilistic random walk after 9356 steps, saw 9187 distinct states, run finished after 113 ms. (steps per millisecond=82 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2672 reset in 481 ms.
Product exploration explored 100000 steps with 2678 reset in 506 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3669 transition count 506
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 626 ms. Remains 3669 /3703 variables (removed 34) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:47:30] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 506 rows 3669 cols
[2023-03-15 21:47:30] [INFO ] Computed 3168 place invariants in 631 ms
[2023-03-15 21:47:32] [INFO ] Dead Transitions using invariants and state equation in 2049 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2749 ms. Remains : 3669/3703 places, 506/506 transitions.
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 21:47:32] [INFO ] Computed 3200 place invariants in 426 ms
[2023-03-15 21:47:39] [INFO ] Implicit Places using invariants in 6502 ms returned []
[2023-03-15 21:47:39] [INFO ] Invariant cache hit.
[2023-03-15 21:47:51] [INFO ] Implicit Places using invariants and state equation in 12455 ms returned []
Implicit Place search using SMT with State Equation took 18964 ms to find 0 implicit places.
[2023-03-15 21:47:51] [INFO ] Invariant cache hit.
[2023-03-15 21:47:52] [INFO ] Dead Transitions using invariants and state equation in 1408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20630 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 65181 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) U p1) U p2)||G((G(p3)||X(p1))))))'
Support contains 1158 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 130 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:47:53] [INFO ] Computed 3232 place invariants in 71 ms
[2023-03-15 21:47:58] [INFO ] Implicit Places using invariants in 5084 ms returned []
[2023-03-15 21:47:58] [INFO ] Invariant cache hit.
[2023-03-15 21:48:07] [INFO ] Implicit Places using invariants and state equation in 9189 ms returned []
Implicit Place search using SMT with State Equation took 14274 ms to find 0 implicit places.
[2023-03-15 21:48:07] [INFO ] Invariant cache hit.
[2023-03-15 21:48:08] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15061 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 614 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s3607 1)) (AND (GEQ s0 1) (GEQ s3608 1)) (AND (GEQ s0 1) (GEQ s3605 1)) (AND (GEQ s0 1) (GEQ s3606 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-07 finished in 15730 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((X(G(p1))&&p0)))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.14 ms
Discarding 34 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 3700 transition count 502
Applied a total of 3 rules in 562 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 21:48:09] [INFO ] Computed 3200 place invariants in 68 ms
[2023-03-15 21:48:15] [INFO ] Implicit Places using invariants in 5976 ms returned []
[2023-03-15 21:48:15] [INFO ] Invariant cache hit.
[2023-03-15 21:48:25] [INFO ] Implicit Places using invariants and state equation in 10522 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16508 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 291 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17363 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s3573 1)) (OR (LT s0 1) (LT s3572 1)) (OR (LT s0 1) (LT s3571 1)) (OR (LT s0 1) (LT s3570 1)) (OR (LT s0 1) (LT s3577 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2466 reset in 772 ms.
Product exploration explored 100000 steps with 2464 reset in 822 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 349 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 514129 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 514129 steps, saw 87770 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-15 21:48:32] [INFO ] Computed 3136 place invariants in 652 ms
[2023-03-15 21:48:34] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 704 ms returned sat
[2023-03-15 21:48:35] [INFO ] After 2447ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 444 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 35 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 275 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-15 21:48:36] [INFO ] Invariant cache hit.
[2023-03-15 21:48:42] [INFO ] Implicit Places using invariants in 5998 ms returned []
[2023-03-15 21:48:42] [INFO ] Invariant cache hit.
[2023-03-15 21:48:53] [INFO ] Implicit Places using invariants and state equation in 11221 ms returned []
Implicit Place search using SMT with State Equation took 17224 ms to find 0 implicit places.
[2023-03-15 21:48:53] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 21:48:53] [INFO ] Invariant cache hit.
[2023-03-15 21:48:54] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18877 ms. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), true, (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 8 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-08 finished in 46758 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))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.16 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3700 transition count 502
Applied a total of 5 rules in 567 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 21:48:56] [INFO ] Computed 3200 place invariants in 72 ms
[2023-03-15 21:49:02] [INFO ] Implicit Places using invariants in 6076 ms returned []
[2023-03-15 21:49:02] [INFO ] Invariant cache hit.
[2023-03-15 21:49:12] [INFO ] Implicit Places using invariants and state equation in 10304 ms returned [3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16401 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3667/3736 places, 502/506 transitions.
Applied a total of 0 rules in 264 ms. Remains 3667 /3667 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17233 ms. Remains : 3667/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3525 1)) (AND (GEQ s0 1) (GEQ s3523 1)) (AND (GEQ s0 1) (GEQ s3526 1)) (AND (GEQ s0 1) (GEQ s3524 1)) (AND (GEQ s0 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-10 finished in 17298 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((p0 U (p1||G(p0))))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 263 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:49:13] [INFO ] Computed 3232 place invariants in 72 ms
[2023-03-15 21:49:19] [INFO ] Implicit Places using invariants in 6144 ms returned []
[2023-03-15 21:49:19] [INFO ] Invariant cache hit.
[2023-03-15 21:49:30] [INFO ] Implicit Places using invariants and state equation in 11003 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17164 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 306 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17734 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s3700 1) (LT s3701 1)), p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22310 reset in 1037 ms.
Product exploration explored 100000 steps with 22417 reset in 1027 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 269 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 21:49:34] [INFO ] Computed 3200 place invariants in 434 ms
[2023-03-15 21:49:35] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 702 ms returned sat
[2023-03-15 21:49:36] [INFO ] After 1280ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 21:49:36] [INFO ] After 1427ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-15 21:49:36] [INFO ] After 2652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 257 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:49:37] [INFO ] Invariant cache hit.
[2023-03-15 21:49:43] [INFO ] Implicit Places using invariants in 6389 ms returned []
[2023-03-15 21:49:44] [INFO ] Invariant cache hit.
[2023-03-15 21:49:56] [INFO ] Implicit Places using invariants and state equation in 12844 ms returned []
Implicit Place search using SMT with State Equation took 19238 ms to find 0 implicit places.
[2023-03-15 21:49:56] [INFO ] Invariant cache hit.
[2023-03-15 21:49:58] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20908 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:49:59] [INFO ] Invariant cache hit.
[2023-03-15 21:50:00] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 681 ms returned sat
[2023-03-15 21:50:01] [INFO ] After 1255ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 21:50:01] [INFO ] After 1402ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-15 21:50:01] [INFO ] After 2576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22143 reset in 997 ms.
Product exploration explored 100000 steps with 22501 reset in 1003 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 103 are kept as prefixes of interest. Removing 3600 places using SCC suffix rule.7 ms
Discarding 3600 places :
Also discarding 237 output transitions
Drop transitions removed 237 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 103 transition count 71
Applied a total of 199 rules in 14 ms. Remains 103 /3703 variables (removed 3600) and now considering 71/506 (removed 435) transitions.
[2023-03-15 21:50:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 103 cols
[2023-03-15 21:50:04] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-15 21:50:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/3703 places, 71/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 103/3703 places, 71/506 transitions.
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 267 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 21:50:05] [INFO ] Computed 3200 place invariants in 402 ms
[2023-03-15 21:50:11] [INFO ] Implicit Places using invariants in 6600 ms returned []
[2023-03-15 21:50:11] [INFO ] Invariant cache hit.
[2023-03-15 21:50:25] [INFO ] Implicit Places using invariants and state equation in 13514 ms returned []
Implicit Place search using SMT with State Equation took 20172 ms to find 0 implicit places.
[2023-03-15 21:50:25] [INFO ] Invariant cache hit.
[2023-03-15 21:50:26] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21790 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-11 finished in 73604 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 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 250 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:50:26] [INFO ] Computed 3232 place invariants in 66 ms
[2023-03-15 21:50:32] [INFO ] Implicit Places using invariants in 5969 ms returned []
[2023-03-15 21:50:32] [INFO ] Invariant cache hit.
[2023-03-15 21:50:43] [INFO ] Implicit Places using invariants and state equation in 10390 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16379 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16880 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-12 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:(AND (OR (LT s0 1) (LT s3499 1)) (OR (LT s0 1) (LT s3509 1)) (OR (LT s0 1) (LT s3508 1)) (OR (LT s0 1) (LT s3511 1)) (OR (LT s0 1) (LT s3510 1)) (OR (L...], 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 4016 reset in 475 ms.
Product exploration explored 100000 steps with 3993 reset in 485 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 78 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-COL-32-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-12 finished in 18665 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))))'
Support contains 1 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 252 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:50:45] [INFO ] Invariant cache hit.
[2023-03-15 21:50:51] [INFO ] Implicit Places using invariants in 6086 ms returned []
[2023-03-15 21:50:51] [INFO ] Invariant cache hit.
[2023-03-15 21:51:02] [INFO ] Implicit Places using invariants and state equation in 10914 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 17010 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17521 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-13 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: 1}]], initial=2, aps=[p0:(LT s3700 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1245 ms.
Product exploration explored 100000 steps with 33333 reset in 1237 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-13 finished in 20708 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((X((!p1 U (p2||G(!p1)))) U (p1&&X((!p1 U (p2||G(!p1)))))))||p0)))'
Support contains 34 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 253 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:51:06] [INFO ] Invariant cache hit.
[2023-03-15 21:51:12] [INFO ] Implicit Places using invariants in 6000 ms returned []
[2023-03-15 21:51:12] [INFO ] Invariant cache hit.
[2023-03-15 21:51:23] [INFO ] Implicit Places using invariants and state equation in 10817 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16842 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17346 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p2)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s3601 1) (GEQ s3600 1) (GEQ s3603 1) (GEQ s3602 1) (GEQ s3599 1) (GEQ s3598 1) (GEQ s3609 1) (GEQ s3608 1) (GEQ s3611 1) (GEQ s3610 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13217 reset in 887 ms.
Product exploration explored 100000 steps with 13084 reset in 892 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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) p2), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (AND (NOT p2) p1), true, false, false]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-15 21:51:27] [INFO ] Computed 3200 place invariants in 389 ms
[2023-03-15 21:51:29] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 667 ms returned sat
[2023-03-15 21:51:29] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2023-03-15 21:51:30] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 676 ms returned sat
[2023-03-15 21:51:31] [INFO ] After 1475ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-15 21:51:32] [INFO ] After 1889ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-15 21:51:32] [INFO ] After 3440ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 74 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 3 properties in 4 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p0) p2 p1))), (G (OR p0 p2 (NOT p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p1), (F (AND (NOT p2) p1)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 758 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
[2023-03-15 21:51:33] [INFO ] Invariant cache hit.
[2023-03-15 21:51:40] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 5497 ms returned sat
[2023-03-15 21:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:51:48] [INFO ] [Real]Absence check using state equation in 8331 ms returned unknown
Could not prove EG (NOT p1)
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 261 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:51:48] [INFO ] Invariant cache hit.
[2023-03-15 21:51:54] [INFO ] Implicit Places using invariants in 6065 ms returned []
[2023-03-15 21:51:54] [INFO ] Invariant cache hit.
[2023-03-15 21:52:07] [INFO ] Implicit Places using invariants and state equation in 12211 ms returned []
Implicit Place search using SMT with State Equation took 18311 ms to find 0 implicit places.
[2023-03-15 21:52:07] [INFO ] Invariant cache hit.
[2023-03-15 21:52:08] [INFO ] Dead Transitions using invariants and state equation in 1349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19948 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511601 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511601 steps, saw 87632 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:52:12] [INFO ] Invariant cache hit.
[2023-03-15 21:52:12] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : []
Property proved to be false thanks to knowledge :(G (OR p0 (NOT p1)))
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-14 finished in 67050 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))&&F(p1)) U G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-32-LTLFireability-06
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.11 ms
Discarding 34 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 3700 transition count 502
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 3700 transition count 502
Applied a total of 4 rules in 789 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-15 21:52:13] [INFO ] Computed 3200 place invariants in 61 ms
[2023-03-15 21:52:19] [INFO ] Implicit Places using invariants in 5908 ms returned []
[2023-03-15 21:52:19] [INFO ] Invariant cache hit.
[2023-03-15 21:52:33] [INFO ] Implicit Places using invariants and state equation in 13592 ms returned [3400, 3401, 3402, 3403, 3404, 3405, 3406, 3407, 3408, 3409, 3410, 3411, 3412, 3413, 3414, 3415, 3416, 3417, 3418, 3419, 3420, 3421, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3430, 3431, 3432, 3466, 3467, 3468, 3469, 3470, 3471, 3472, 3473, 3474, 3475, 3476, 3477, 3478, 3479, 3480, 3481, 3482, 3483, 3484, 3485, 3486, 3487, 3488, 3489, 3490, 3491, 3492, 3493, 3494, 3495, 3496, 3497, 3498]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 19513 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 263 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 20565 ms. Remains : 3634/3736 places, 502/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s3600 1) (LT s3601 1) (LT s3598 1) (LT s3599 1) (LT s3608 1) (LT s3609 1) (LT s3606 1) (LT s3607 1) (LT s3604 1) (LT s3605 1) (LT s3602 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2463 reset in 493 ms.
Product exploration explored 100000 steps with 2467 reset in 517 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 314 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1529066 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :{}
Probabilistic random walk after 1529066 steps, saw 235523 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-15 21:52:39] [INFO ] Computed 3136 place invariants in 484 ms
[2023-03-15 21:52:40] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 650 ms returned sat
[2023-03-15 21:52:40] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:52:41] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 655 ms returned sat
[2023-03-15 21:52:42] [INFO ] After 1502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:52:43] [INFO ] After 1636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-15 21:52:43] [INFO ] After 2783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 222 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-15 21:52:43] [INFO ] Invariant cache hit.
[2023-03-15 21:52:49] [INFO ] Implicit Places using invariants in 5719 ms returned []
[2023-03-15 21:52:49] [INFO ] Invariant cache hit.
[2023-03-15 21:53:01] [INFO ] Implicit Places using invariants and state equation in 11492 ms returned []
Implicit Place search using SMT with State Equation took 17243 ms to find 0 implicit places.
[2023-03-15 21:53:01] [INFO ] Invariant cache hit.
[2023-03-15 21:53:02] [INFO ] Dead Transitions using invariants and state equation in 1301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18795 ms. Remains : 3634/3634 places, 502/502 transitions.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1525352 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1525352 steps, saw 235064 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:53:06] [INFO ] Invariant cache hit.
[2023-03-15 21:53:07] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 646 ms returned sat
[2023-03-15 21:53:07] [INFO ] After 1048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:53:08] [INFO ] [Nat]Absence check using 0 positive and 3136 generalized place invariants in 648 ms returned sat
[2023-03-15 21:53:10] [INFO ] After 1469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:53:10] [INFO ] After 1612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-15 21:53:10] [INFO ] After 2728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2463 reset in 502 ms.
Product exploration explored 100000 steps with 2463 reset in 508 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3634 transition count 502
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 384 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2023-03-15 21:53:12] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 502 rows 3634 cols
[2023-03-15 21:53:12] [INFO ] Computed 3136 place invariants in 467 ms
[2023-03-15 21:53:14] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3634 places, 502/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2237 ms. Remains : 3634/3634 places, 502/502 transitions.
Support contains 33 out of 3634 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3634/3634 places, 502/502 transitions.
Applied a total of 0 rules in 233 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
// Phase 1: matrix 502 rows 3634 cols
[2023-03-15 21:53:14] [INFO ] Computed 3136 place invariants in 474 ms
[2023-03-15 21:53:20] [INFO ] Implicit Places using invariants in 6157 ms returned []
[2023-03-15 21:53:20] [INFO ] Invariant cache hit.
[2023-03-15 21:53:31] [INFO ] Implicit Places using invariants and state equation in 11181 ms returned []
Implicit Place search using SMT with State Equation took 17350 ms to find 0 implicit places.
[2023-03-15 21:53:31] [INFO ] Invariant cache hit.
[2023-03-15 21:53:33] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18982 ms. Remains : 3634/3634 places, 502/502 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLFireability-06 finished in 80237 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((p0 U (p1||G(p0))))))'
[2023-03-15 21:53:33] [INFO ] Flatten gal took : 202 ms
[2023-03-15 21:53:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 21:53:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 9 ms.
Total runtime 529043 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-32
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678917221440
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-32-LTLFireability-11
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-COL-32-LTLFireability-11
lola: result : false
lola: markings : 271
lola: fired transitions : 271
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-32-LTLFireability-06
lola: time limit : 3594 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-COL-32-LTLFireability-06
lola: result : false
lola: markings : 271
lola: fired transitions : 271
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-32-LTLFireability-06: LTL false LTL model checker
QuasiCertifProtocol-COL-32-LTLFireability-11: LTL false LTL model checker
Time elapsed: 6 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
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-COL-32, 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-167873948500852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 '
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 ;