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-167873948500859.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 55K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678917011083

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:50:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 21:50:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:50:12] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-15 21:50:12] [INFO ] Transformed 86 places.
[2023-03-15 21:50:12] [INFO ] Transformed 56 transitions.
[2023-03-15 21:50:12] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 56
Applied a total of 2 rules in 9 ms. Remains 84 /86 variables (removed 2) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 84 cols
[2023-03-15 21:50:12] [INFO ] Computed 30 place invariants in 14 ms
[2023-03-15 21:50:13] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-15 21:50:13] [INFO ] Invariant cache hit.
[2023-03-15 21:50:13] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [48, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 455 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 466 ms. Remains : 82/86 places, 56/56 transitions.
Support contains 58 out of 82 places after structural reductions.
[2023-03-15 21:50:13] [INFO ] Flatten gal took : 23 ms
[2023-03-15 21:50:13] [INFO ] Flatten gal took : 10 ms
[2023-03-15 21:50:13] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1652 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 30) seen :9
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 56 rows 82 cols
[2023-03-15 21:50:13] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-15 21:50:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 21:50:13] [INFO ] [Real]Absence check using 5 positive and 23 generalized place invariants in 3 ms returned sat
[2023-03-15 21:50:13] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-15 21:50:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:50:13] [INFO ] [Nat]Absence check using 5 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-15 21:50:14] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2023-03-15 21:50:14] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 21:50:14] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :2
Fused 10 Parikh solutions to 2 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 4 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 82 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 56
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' '!(F((G(p0)||G(F(p1)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 167 edges and 82 vertex of which 73 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 70 transition count 51
Applied a total of 5 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 70 cols
[2023-03-15 21:50:14] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 21:50:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-15 21:50:14] [INFO ] Invariant cache hit.
[2023-03-15 21:50:14] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [43, 53, 59, 60]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 148 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/82 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 66/82 places, 51/56 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s31 s32 s37) (ADD s57 s58 s64)), p1:(LEQ 1 (ADD s31 s32 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18729 reset in 257 ms.
Product exploration explored 100000 steps with 18726 reset in 132 ms.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
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 (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1882 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Probably explored full state space saw : 455 states, properties seen :1
Probabilistic random walk after 1567 steps, saw 455 distinct states, run finished after 21 ms. (steps per millisecond=74 ) properties seen :1
Explored full state space saw : 455 states, properties seen :0
Exhaustive walk after 1567 steps, saw 455 distinct states, run finished after 3 ms. (steps per millisecond=522 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 261 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-PT-02-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-02 finished in 1771 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((!(p0 U p1)||(X(p2)&&p0))))'
Support contains 9 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 56
Applied a total of 8 rules in 7 ms. Remains 74 /82 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2023-03-15 21:50:16] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 21:50:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-15 21:50:16] [INFO ] Invariant cache hit.
[2023-03-15 21:50:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/82 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 73/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, p1, (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 (ADD s62 s63 s69)), p0:(GT s24 s25), p2:(GT s23 (ADD s4 s5 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16419 reset in 113 ms.
Product exploration explored 100000 steps with 16419 reset in 171 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (OR (AND (NOT p0) p1) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), true, (X (X (OR (AND (NOT p0) p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1434 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, p1, (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (NOT p2) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 555 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 551 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 558 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 565 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 555 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 56 rows 73 cols
[2023-03-15 21:50:19] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 21:50:19] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2023-03-15 21:50:19] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-15 21:50:19] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 2 ms returned sat
[2023-03-15 21:50:19] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-15 21:50:19] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-15 21:50:19] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 3 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2))))), (X (OR (AND (NOT p0) p1) (NOT p2))), (X (NOT (AND p0 p1 p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))))), true, (X (X (OR (AND (NOT p0) p1) (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (G (NOT (AND p1 p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND (NOT p1) p2 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (NOT (OR (AND p1 (NOT p0)) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (AND p1 (NOT p0)))
Knowledge based reduction with 29 factoid took 466 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-03 finished in 3537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 7 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 56
Applied a total of 8 rules in 5 ms. Remains 74 /82 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2023-03-15 21:50:19] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 21:50:19] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-15 21:50:19] [INFO ] Invariant cache hit.
[2023-03-15 21:50:19] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/82 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 73/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s7 s8 s9)), p1:(LEQ s24 (ADD s19 s20 s22))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-04 finished in 255 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&&F(p1)))||X(p1)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 77 transition count 56
Applied a total of 5 rules in 1 ms. Remains 77 /82 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2023-03-15 21:50:19] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-15 21:50:20] [INFO ] Invariant cache hit.
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 76/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (ADD s4 s5 s6) (ADD s71 s73 s74)), p0:(LEQ s28 (ADD s34 s35 s40))], 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-05 finished in 303 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&&G(F(p1)))))'
Support contains 24 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 77 transition count 56
Applied a total of 5 rules in 10 ms. Remains 77 /82 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2023-03-15 21:50:20] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-15 21:50:20] [INFO ] Invariant cache hit.
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 76/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s68 s69 s70) (ADD s26 s27 s29 s30 s31 s32 s33 s34 s35)), p1:(GT (ADD s52 s58 s59) (ADD s45 s46 s47 s48 s49 s50 s51 s56 s57))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 9 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-07 finished in 297 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(X(F((p0||G(p1))))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 56
Applied a total of 8 rules in 1 ms. Remains 74 /82 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2023-03-15 21:50:20] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-15 21:50:20] [INFO ] Invariant cache hit.
[2023-03-15 21:50:20] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/82 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 73/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT s23 s15), p0:(LEQ s25 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 135 ms.
Product exploration explored 100000 steps with 20000 reset in 130 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-09 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 167 edges and 82 vertex of which 70 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 68 transition count 52
Applied a total of 5 rules in 6 ms. Remains 68 /82 variables (removed 14) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 68 cols
[2023-03-15 21:50:21] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-15 21:50:21] [INFO ] Invariant cache hit.
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 118 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/82 places, 52/56 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 67/82 places, 52/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s55 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-11 finished in 183 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(F(p1))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 167 edges and 82 vertex of which 70 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 67 transition count 51
Applied a total of 5 rules in 10 ms. Remains 67 /82 variables (removed 15) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 67 cols
[2023-03-15 21:50:21] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-15 21:50:21] [INFO ] Invariant cache hit.
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [40, 50, 56, 57]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 104 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 63/82 places, 51/56 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s14 s7), p1:(LEQ s9 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 64989 steps with 12194 reset in 52 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-12 finished in 264 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((G(p0) U p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 75 transition count 56
Applied a total of 7 rules in 1 ms. Remains 75 /82 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 75 cols
[2023-03-15 21:50:21] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-15 21:50:21] [INFO ] Invariant cache hit.
[2023-03-15 21:50:21] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-15 21:50:21] [INFO ] Invariant cache hit.
[2023-03-15 21:50:21] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/82 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 75/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s34 s4), p0:(GT 1 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 75 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 56
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 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-15 finished in 711 ms.
All properties solved by simple procedures.
Total runtime 9962 ms.
ITS solved all properties within timeout

BK_STOP 1678917023703

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality"
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-167873948500859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;