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-171662361400038.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 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 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 58K 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-02-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716769379730

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-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 00:23:01] [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:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:23:02] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-27 00:23:02] [INFO ] Transformed 86 places.
[2024-05-27 00:23:02] [INFO ] Transformed 56 transitions.
[2024-05-27 00:23:02] [INFO ] Found NUPN structural information;
[2024-05-27 00:23:02] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 76 transition count 56
Applied a total of 10 rules in 10 ms. Remains 76 /86 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-27 00:23:02] [INFO ] Computed 22 invariants in 18 ms
[2024-05-27 00:23:02] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-27 00:23:02] [INFO ] Invariant cache hit.
[2024-05-27 00:23:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [44, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 335 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 348 ms. Remains : 74/86 places, 56/56 transitions.
Support contains 34 out of 74 places after structural reductions.
[2024-05-27 00:23:02] [INFO ] Flatten gal took : 22 ms
[2024-05-27 00:23:02] [INFO ] Flatten gal took : 8 ms
[2024-05-27 00:23:02] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1643 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:23:03] [INFO ] Computed 20 invariants in 3 ms
[2024-05-27 00:23:03] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-27 00:23:03] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:13
[2024-05-27 00:23:03] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-27 00:23:03] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-27 00:23:03] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-27 00:23:03] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-05-27 00:23:03] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-05-27 00:23:03] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 10 different solutions.
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 12 properties in 8 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 27 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Discarding 4 places :
Implicit places reduction removed 4 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 30 rules applied. Total rules applied 31 place count 23 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 21 transition count 12
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 33 place count 21 transition count 5
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 55 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 3 transition count 3
Applied a total of 60 rules in 8 ms. Remains 3 /74 variables (removed 71) and now considering 3/56 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 3/74 places, 3/56 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 74 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 39 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 38 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 36 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 36 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 35 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 35 transition count 33
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 15 place count 34 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 34 transition count 32
Applied a total of 16 rules in 9 ms. Remains 34 /74 variables (removed 40) and now considering 32/56 (removed 24) transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-27 00:23:04] [INFO ] Computed 6 invariants in 0 ms
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 00:23:04] [INFO ] Invariant cache hit.
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [16, 20, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 82 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/74 places, 32/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 31/74 places, 32/56 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 146 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-00 finished in 281 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))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 68 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 52
Applied a total of 4 rules in 14 ms. Remains 68 /74 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 68 cols
[2024-05-27 00:23:04] [INFO ] Computed 18 invariants in 2 ms
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 00:23:04] [INFO ] Invariant cache hit.
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [41, 51, 57, 58]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 138 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/74 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 64/74 places, 52/56 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s16 1) (GEQ s63 1)) (AND (GEQ s14 1) (GEQ s57 1)) (AND (GEQ s13 1) (GEQ s58 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-02 finished in 203 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(p1)||p0)))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:23:04] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-27 00:23:04] [INFO ] Invariant cache hit.
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 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 129 ms. Remains : 73/74 places, 56/56 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s23 1), p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s5 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 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-03 finished in 262 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(F(p0))||G(p1))))'
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 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 /74 variables (removed 7) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 67 cols
[2024-05-27 00:23:04] [INFO ] Computed 18 invariants in 2 ms
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-27 00:23:04] [INFO ] Invariant cache hit.
[2024-05-27 00:23:04] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [40, 50, 56, 57]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 100 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/74 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 112 ms. Remains : 63/74 places, 51/56 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s11 1)) (OR (LT s0 1) (LT s10 1)) (OR (LT s0 1) (LT s12 1))), p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT ...], 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 18759 reset in 217 ms.
Product exploration explored 100000 steps with 18761 reset in 139 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 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-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-04 finished in 611 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&&X(G(p1)))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:23:05] [INFO ] Computed 20 invariants in 20 ms
[2024-05-27 00:23:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 00:23:05] [INFO ] Invariant cache hit.
[2024-05-27 00:23:05] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 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 144 ms. Remains : 73/74 places, 56/56 transitions.
Stuttering acceptance computed with spot in 834 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s24 1), p1:(OR (GEQ s4 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-07 finished in 997 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(G(!p0)) U (X(p1)&&F(p2)))))'
Support contains 12 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-27 00:23:06] [INFO ] Invariant cache hit.
[2024-05-27 00:23:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 00:23:06] [INFO ] Invariant cache hit.
[2024-05-27 00:23:06] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-27 00:23:06] [INFO ] Invariant cache hit.
[2024-05-27 00:23:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 74/74 places, 56/56 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s47 1) (GEQ s51 1) (GEQ s57 1)), p1:(AND (GEQ s40 1) (GEQ s41 1) (GEQ s42 1) (GEQ s43 1) (GEQ s9 1) (GEQ s46 1) (GEQ s50 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-08 finished in 379 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(F(p0))||G(!p1))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 24 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 23 transition count 20
Applied a total of 16 rules in 4 ms. Remains 23 /74 variables (removed 51) and now considering 20/56 (removed 36) transitions.
// Phase 1: matrix 20 rows 23 cols
[2024-05-27 00:23:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 00:23:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-27 00:23:06] [INFO ] Invariant cache hit.
[2024-05-27 00:23:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [11, 15, 16]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 60 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/74 places, 20/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 20/74 places, 20/56 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s8 1), p0:(GEQ s9 1)], 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 18008 reset in 153 ms.
Product exploration explored 100000 steps with 18002 reset in 122 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
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)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 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-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-09 finished in 486 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 U p1)||X((!p0||G(p2))))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:23:07] [INFO ] Computed 20 invariants in 0 ms
[2024-05-27 00:23:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 00:23:07] [INFO ] Invariant cache hit.
[2024-05-27 00:23:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 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 103 ms. Remains : 73/74 places, 56/56 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s17 1)), p0:(GEQ s21 1), p2:(OR (LT s13 1) (LT s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 110 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) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-10 finished in 681 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(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Graph (complete) has 129 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 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 68 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 68 transition count 52
Applied a total of 4 rules in 13 ms. Remains 68 /74 variables (removed 6) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 68 cols
[2024-05-27 00:23:08] [INFO ] Computed 18 invariants in 1 ms
[2024-05-27 00:23:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 00:23:08] [INFO ] Invariant cache hit.
[2024-05-27 00:23:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [41, 51, 57, 58]
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 : 64/74 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 64/74 places, 52/56 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18776 reset in 61 ms.
Product exploration explored 100000 steps with 18771 reset in 121 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-12 finished in 404 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 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-27 00:23:08] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 00:23:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 00:23:08] [INFO ] Invariant cache hit.
[2024-05-27 00:23:08] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/74 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 104 ms. Remains : 73/74 places, 56/56 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLFireability-13 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:(OR (LT s0 1) (LT s16 1)), p1:(GEQ s25 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 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLFireability-13 finished in 517 ms.
All properties solved by simple procedures.
Total runtime 7025 ms.

BK_STOP 1716769396902

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-02"
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-02, 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-171662361400038"
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 [ "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 ;