Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361400043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is QuasiCertifProtocol-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:43 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-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716769519545

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 00:25:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 00:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:25:21] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-05-27 00:25:21] [INFO ] Transformed 270 places.
[2024-05-27 00:25:21] [INFO ] Transformed 116 transitions.
[2024-05-27 00:25:21] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 16 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:25:21] [INFO ] Computed 138 invariants in 23 ms
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-27 00:25:21] [INFO ] Invariant cache hit.
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-27 00:25:21] [INFO ] Invariant cache hit.
[2024-05-27 00:25:22] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 140 out of 252 places after structural reductions.
[2024-05-27 00:25:22] [INFO ] Flatten gal took : 37 ms
[2024-05-27 00:25:22] [INFO ] Flatten gal took : 18 ms
[2024-05-27 00:25:22] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 29) seen :4
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-27 00:25:22] [INFO ] Invariant cache hit.
[2024-05-27 00:25:23] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 19 ms returned sat
[2024-05-27 00:25:23] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-27 00:25:23] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 25 ms returned sat
[2024-05-27 00:25:24] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :20
[2024-05-27 00:25:24] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :20
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-27 00:25:24] [INFO ] After 1233ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :20
Fused 24 Parikh solutions to 17 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 17 properties in 20 ms.
Support contains 17 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 133 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 119 transition count 39
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 114 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 113 transition count 38
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 77 place count 113 transition count 29
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 108 place count 91 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 91 transition count 28
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 3 with 3 rules applied. Total rules applied 111 place count 89 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 28 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 149 place count 56 transition count 23
Applied a total of 149 rules in 19 ms. Remains 56 /252 variables (removed 196) and now considering 23/116 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 56/252 places, 23/116 transitions.
Finished random walk after 7724 steps, including 728 resets, run visited all 3 properties in 21 ms. (steps per millisecond=367 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
Applied a total of 3 rules in 29 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2024-05-27 00:25:26] [INFO ] Computed 132 invariants in 6 ms
[2024-05-27 00:25:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-27 00:25:26] [INFO ] Invariant cache hit.
[2024-05-27 00:25:26] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [145, 146, 147, 148, 152, 157, 158, 195, 196, 220, 221, 222, 223, 224]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 405 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 228/252 places, 112/116 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10251 reset in 367 ms.
Product exploration explored 100000 steps with 10247 reset in 281 ms.
Computed a total of 228 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 1320 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-01 finished in 3436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p1)))&&p0)))'
Support contains 22 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:25:28] [INFO ] Computed 138 invariants in 2 ms
[2024-05-27 00:25:28] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-27 00:25:28] [INFO ] Invariant cache hit.
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 375 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s30 1)) (AND (GEQ s0 1) (GEQ s26 1)) (AND (GEQ s0 1) (GEQ s29 1)) (AND (GEQ s0 1) (GEQ s23 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-02 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&(F(p2) U p3))))'
Support contains 25 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:25:29] [INFO ] Invariant cache hit.
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 00:25:29] [INFO ] Invariant cache hit.
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 357 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s52 1), p1:(AND (OR (LT s0 1) (LT s5 1)) (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s7 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s0 1) (LT s1 1)) (OR (L...], 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]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-03 finished in 623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 64 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-27 00:25:29] [INFO ] Computed 132 invariants in 4 ms
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-27 00:25:29] [INFO ] Invariant cache hit.
[2024-05-27 00:25:30] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [194, 195, 219, 220, 221, 222, 223]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 274 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-04 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}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s35 1)) (OR (LT s0 1) (LT s36 1)) (OR (LT s0 1) (LT s42 1)) (OR (LT s0 1) (LT s39 1)) (OR (LT s0 1) (LT s38 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10246 reset in 225 ms.
Product exploration explored 100000 steps with 10259 reset in 214 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-04 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 173 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.2 ms
Discarding 79 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 171 transition count 83
Applied a total of 17 rules in 15 ms. Remains 171 /252 variables (removed 81) and now considering 83/116 (removed 33) transitions.
// Phase 1: matrix 83 rows 171 cols
[2024-05-27 00:25:30] [INFO ] Computed 90 invariants in 1 ms
[2024-05-27 00:25:30] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-27 00:25:30] [INFO ] Invariant cache hit.
[2024-05-27 00:25:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [81, 82, 83, 84, 87, 92, 93, 126, 127, 149, 150, 151, 152, 153]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 264 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/252 places, 83/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 157/252 places, 83/116 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10015 reset in 149 ms.
Product exploration explored 100000 steps with 10002 reset in 169 ms.
Computed a total of 157 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 83
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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-05 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(F(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:25:31] [INFO ] Computed 138 invariants in 6 ms
[2024-05-27 00:25:31] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 00:25:31] [INFO ] Invariant cache hit.
[2024-05-27 00:25:31] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 363 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 367 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s30 1)) (AND (GEQ s0 1) (GEQ s26 1)) (AND (GEQ s0 1) (GEQ s29 1)) (AND (GEQ s0 1) (GEQ s23 1)) (A...], 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 50000 reset in 213 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-06 finished in 969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 5 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:25:32] [INFO ] Invariant cache hit.
[2024-05-27 00:25:32] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-27 00:25:32] [INFO ] Invariant cache hit.
[2024-05-27 00:25:32] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 343 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p3) p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p3) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s27 1)), p3:(AND (LT s52 1) (NOT (AND (GEQ s0 1) (GEQ s17 1)))), p2:(AND (GEQ s0 1) (GEQ s17 1)), p1:(LT s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p3 (NOT p2) p1), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) p2 (NOT p1))))), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 p3) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) p2 (NOT p1)))))), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 p3) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 (NOT p2) (NOT p1)))))), (F (G p0)), (F (G p3)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 159 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-08 finished in 1146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:25:33] [INFO ] Invariant cache hit.
[2024-05-27 00:25:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 00:25:33] [INFO ] Invariant cache hit.
[2024-05-27 00:25:33] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [147, 148, 149, 150, 154, 160]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 342 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 246/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, p0, (AND p0 p1), p1, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (GEQ s19 1) (GEQ s160 1) (GEQ s165 1) (GEQ s176 1) (GEQ s183 1) (GEQ s186 1) (GEQ s189 1) (GEQ s198 1)), p1:(AND (GEQ s107 1) (GEQ s108 1) (GEQ s1...], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9830 reset in 122 ms.
Product exploration explored 100000 steps with 9835 reset in 134 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 180 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1093972 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1093972 steps, saw 176975 distinct states, run finished after 3003 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 116 rows 246 cols
[2024-05-27 00:25:38] [INFO ] Computed 132 invariants in 5 ms
[2024-05-27 00:25:38] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2024-05-27 00:25:38] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-27 00:25:38] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 17 ms returned sat
[2024-05-27 00:25:38] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-27 00:25:38] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-27 00:25:38] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 44 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 4 properties in 1 ms.
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 116/116 transitions.
Graph (complete) has 685 edges and 246 vertex of which 127 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 113 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 111 transition count 40
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 71 place count 111 transition count 19
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 133 place count 70 transition count 19
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 134 place count 70 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 69 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 135 place count 69 transition count 17
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 138 place count 67 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 66 transition count 16
Applied a total of 139 rules in 8 ms. Remains 66 /246 variables (removed 180) and now considering 16/116 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 66/246 places, 16/116 transitions.
Finished random walk after 190 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=95 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 1163 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 288 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:25:40] [INFO ] Invariant cache hit.
[2024-05-27 00:25:40] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 00:25:40] [INFO ] Invariant cache hit.
[2024-05-27 00:25:40] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-27 00:25:40] [INFO ] Invariant cache hit.
[2024-05-27 00:25:40] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 246/246 places, 116/116 transitions.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Incomplete random walk after 10000 steps, including 983 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 892658 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892658 steps, saw 146222 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-27 00:25:44] [INFO ] Invariant cache hit.
[2024-05-27 00:25:44] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2024-05-27 00:25:44] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-27 00:25:44] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 18 ms returned sat
[2024-05-27 00:25:45] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-27 00:25:45] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-27 00:25:45] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 4 properties in 2 ms.
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 116/116 transitions.
Graph (complete) has 685 edges and 246 vertex of which 127 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Drop transitions removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 113 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 111 transition count 40
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 71 place count 111 transition count 19
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 133 place count 70 transition count 19
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 134 place count 70 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 69 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 135 place count 69 transition count 17
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 138 place count 67 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 66 transition count 16
Applied a total of 139 rules in 12 ms. Remains 66 /246 variables (removed 180) and now considering 16/116 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 66/246 places, 16/116 transitions.
Finished random walk after 254 steps, including 15 resets, run visited all 1 properties in 1 ms. (steps per millisecond=254 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 265 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 202 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 237 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Product exploration explored 100000 steps with 9836 reset in 129 ms.
Product exploration explored 100000 steps with 9836 reset in 143 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 116/116 transitions.
Graph (complete) has 685 edges and 246 vertex of which 238 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 238 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 22 ms. Remains 238 /246 variables (removed 8) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:25:46] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 116 rows 238 cols
[2024-05-27 00:25:46] [INFO ] Computed 126 invariants in 2 ms
[2024-05-27 00:25:46] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/246 places, 116/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 238/246 places, 116/116 transitions.
Built C files in :
/tmp/ltsmin16108408793253307827
[2024-05-27 00:25:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16108408793253307827
Running compilation step : cd /tmp/ltsmin16108408793253307827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 323 ms.
Running link step : cd /tmp/ltsmin16108408793253307827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16108408793253307827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13405644437877739321.hoa' '--buchi-type=spotba'
LTSmin run took 4618 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-09 finished in 18427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:25:52] [INFO ] Computed 138 invariants in 2 ms
[2024-05-27 00:25:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-27 00:25:52] [INFO ] Invariant cache hit.
[2024-05-27 00:25:52] [INFO ] Implicit Places using invariants and state equation in 200 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 338 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s10 1), p1:(OR (LT s51 1) (LT s37 1) (LT s239 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 9835 reset in 115 ms.
Product exploration explored 100000 steps with 9827 reset in 122 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1090763 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :{}
Probabilistic random walk after 1090763 steps, saw 176556 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 116 rows 245 cols
[2024-05-27 00:25:56] [INFO ] Computed 132 invariants in 11 ms
[2024-05-27 00:25:56] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2024-05-27 00:25:56] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-27 00:25:56] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 16 ms returned sat
[2024-05-27 00:25:56] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-27 00:25:56] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-27 00:25:56] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 46 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 ms.
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 127 are kept as prefixes of interest. Removing 118 places using SCC suffix rule.0 ms
Discarding 118 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 114 transition count 39
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 77 place count 108 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 107 transition count 38
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 78 place count 107 transition count 17
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 62 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 182 place count 24 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 23 transition count 17
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 183 place count 23 transition count 10
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 203 place count 10 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 9 transition count 10
Applied a total of 204 rules in 4 ms. Remains 9 /245 variables (removed 236) and now considering 10/116 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 9/245 places, 10/116 transitions.
Finished random walk after 54 steps, including 10 resets, run visited all 2 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 311 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 116/116 transitions.
Graph (complete) has 677 edges and 245 vertex of which 237 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 113
Applied a total of 2 rules in 19 ms. Remains 236 /245 variables (removed 9) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 236 cols
[2024-05-27 00:25:57] [INFO ] Computed 126 invariants in 2 ms
[2024-05-27 00:25:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-27 00:25:57] [INFO ] Invariant cache hit.
[2024-05-27 00:25:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [189, 190, 214, 215, 216, 217, 218]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 320 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/245 places, 113/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 229/245 places, 113/116 transitions.
Computed a total of 229 stabilizing places and 113 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 113
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) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 388 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 1030 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 985646 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 985646 steps, saw 164576 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 113 rows 229 cols
[2024-05-27 00:26:02] [INFO ] Computed 120 invariants in 13 ms
[2024-05-27 00:26:02] [INFO ] [Real]Absence check using 0 positive and 120 generalized place invariants in 23 ms returned sat
[2024-05-27 00:26:02] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-27 00:26:02] [INFO ] [Nat]Absence check using 0 positive and 120 generalized place invariants in 14 ms returned sat
[2024-05-27 00:26:02] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1)), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 18 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-10 finished in 10415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0||(X(G(p2))&&p1))))||G(p3)))'
Support contains 11 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 8 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-27 00:26:02] [INFO ] Computed 132 invariants in 5 ms
[2024-05-27 00:26:02] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 00:26:02] [INFO ] Invariant cache hit.
[2024-05-27 00:26:02] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [144, 145, 146, 147, 151, 156, 194, 195, 219, 220, 221, 222, 223]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 316 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 228/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s0 1) (GEQ s35 1)), p1:(AND (GEQ s101 1) (GEQ s102 1) (GEQ s103 1) (GEQ s108 1) (GEQ s109 1) (GEQ s110 1) (GEQ s111 1) (GEQ s151 1)), p0:(AND...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-11 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1||F(p2)))&&X(G(p0))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:26:02] [INFO ] Computed 138 invariants in 2 ms
[2024-05-27 00:26:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-27 00:26:03] [INFO ] Invariant cache hit.
[2024-05-27 00:26:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 372 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 377 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 388 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s48 1)), p2:(GEQ s26 1), p0:(GEQ s10 1)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-12 finished in 786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:26:03] [INFO ] Invariant cache hit.
[2024-05-27 00:26:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-27 00:26:03] [INFO ] Invariant cache hit.
[2024-05-27 00:26:04] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 345 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s149 1) (GEQ s157 1) (GEQ s170 1) (GEQ s176 1) (GEQ s187 1) (GEQ s199 1) (GEQ s200 1)), p0:(AND (GEQ s47 1) (GEQ s237 1) (GEQ s23...], 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 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-13 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-27 00:26:04] [INFO ] Invariant cache hit.
[2024-05-27 00:26:04] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-27 00:26:04] [INFO ] Invariant cache hit.
[2024-05-27 00:26:04] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 328 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=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 s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 43495 ms.

BK_STOP 1716769572045

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;