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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 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 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 61K 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-COL-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716762226865

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 22:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:23:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 22:23:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:23:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 528 ms
[2024-05-26 22:23:49] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:23:49] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 7 ms.
[2024-05-26 22:23:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 763 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 352 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 342 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 369 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 351 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:23:50] [INFO ] Computed 5 invariants in 10 ms
[2024-05-26 22:23:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-26 22:23:50] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2024-05-26 22:23:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 22:23:50] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2024-05-26 22:23:50] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-26 22:23:50] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Parikh walk visited 3 properties in 3 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:23:50] [INFO ] Flatten gal took : 45 ms
[2024-05-26 22:23:50] [INFO ] Flatten gal took : 4 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:23:50] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 9 ms.
[2024-05-26 22:23:50] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 246 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 255 transition count 116
Applied a total of 15 rules in 9 ms. Remains 255 /270 variables (removed 15) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 255 cols
[2024-05-26 22:23:50] [INFO ] Computed 140 invariants in 9 ms
[2024-05-26 22:23:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-26 22:23:50] [INFO ] Invariant cache hit.
[2024-05-26 22:23:50] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-26 22:23:50] [INFO ] Invariant cache hit.
[2024-05-26 22:23:51] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 255/270 places, 116/116 transitions.
Support contains 246 out of 255 places after structural reductions.
[2024-05-26 22:23:51] [INFO ] Flatten gal took : 21 ms
[2024-05-26 22:23:51] [INFO ] Flatten gal took : 17 ms
[2024-05-26 22:23:51] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 984 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 24) seen :7
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-26 22:23:51] [INFO ] Invariant cache hit.
[2024-05-26 22:23:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 22:23:51] [INFO ] [Real]Absence check using 1 positive and 139 generalized place invariants in 25 ms returned sat
[2024-05-26 22:23:51] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-26 22:23:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 22:23:51] [INFO ] [Nat]Absence check using 1 positive and 139 generalized place invariants in 33 ms returned sat
[2024-05-26 22:23:52] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-05-26 22:23:53] [INFO ] After 956ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 480 ms.
[2024-05-26 22:23:53] [INFO ] After 1666ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Finished Parikh walk after 50 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 15 properties in 9 ms.
Support contains 56 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 243 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 229 transition count 60
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 8 rules applied. Total rules applied 77 place count 228 transition count 53
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 84 place count 221 transition count 53
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 84 place count 221 transition count 31
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 148 place count 179 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 148 place count 179 transition count 29
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 3 with 5 rules applied. Total rules applied 153 place count 176 transition count 29
Applied a total of 153 rules in 29 ms. Remains 176 /255 variables (removed 79) and now considering 29/116 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 176/255 places, 29/116 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-COL-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 255 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 255 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(p0) U (p1&&G(F(p2)))))'
Support contains 65 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 253 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output 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 252 transition count 115
Applied a total of 2 rules in 31 ms. Remains 252 /255 variables (removed 3) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-05-26 22:23:53] [INFO ] Computed 138 invariants in 7 ms
[2024-05-26 22:23:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-26 22:23:54] [INFO ] Invariant cache hit.
[2024-05-26 22:23:54] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [184, 185, 186, 187, 188, 189, 190, 198, 199, 200, 201, 202, 203, 204]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 353 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/255 places, 115/116 transitions.
Applied a total of 0 rules in 16 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 238/255 places, 115/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 279 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s163 s164 s165 s166 s167 s168 s169) (ADD s226 s227 s228 s229 s230 s231 s232)), p0:(LEQ 1 s235), p2:(LEQ (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10243 reset in 355 ms.
Product exploration explored 100000 steps with 10267 reset in 222 ms.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
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) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 719 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1028 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 552 steps, run visited all 1 properties in 9 ms. (steps per millisecond=61 )
Probabilistic random walk after 552 steps, saw 514 distinct states, run finished after 10 ms. (steps per millisecond=55 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p2)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 15 factoid took 763 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
Support contains 50 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 115/115 transitions.
Applied a total of 0 rules in 13 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-05-26 22:23:56] [INFO ] Computed 126 invariants in 9 ms
[2024-05-26 22:23:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-26 22:23:57] [INFO ] Invariant cache hit.
[2024-05-26 22:23:57] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-26 22:23:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 22:23:57] [INFO ] Invariant cache hit.
[2024-05-26 22:23:57] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 238/238 places, 115/115 transitions.
Computed a total of 238 stabilizing places and 115 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 115
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 552 steps, run visited all 1 properties in 5 ms. (steps per millisecond=110 )
Probabilistic random walk after 552 steps, saw 514 distinct states, run finished after 6 ms. (steps per millisecond=92 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10242 reset in 161 ms.
Product exploration explored 100000 steps with 10258 reset in 167 ms.
Built C files in :
/tmp/ltsmin9173073288037739939
[2024-05-26 22:23:58] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-26 22:23:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:23:58] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-26 22:23:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:23:58] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-26 22:23:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 22:23:58] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9173073288037739939
Running compilation step : cd /tmp/ltsmin9173073288037739939;'/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 388 ms.
Running link step : cd /tmp/ltsmin9173073288037739939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9173073288037739939;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9447668358893379851.hoa' '--buchi-type=spotba'
LTSmin run took 1435 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-00 finished in 6895 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 49 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 244 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 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 20 ms. Remains 241 /255 variables (removed 14) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-26 22:24:00] [INFO ] Computed 132 invariants in 6 ms
[2024-05-26 22:24:00] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-26 22:24:00] [INFO ] Invariant cache hit.
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 313 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/255 places, 111/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 340 ms. Remains : 227/255 places, 111/116 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-01 finished in 394 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)&&F((p1 U (G(p1)||(p1&&G(p0))))))))'
Support contains 15 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 125 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.2 ms
Discarding 130 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 124 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 124 transition count 72
Applied a total of 22 rules in 15 ms. Remains 124 /255 variables (removed 131) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 124 cols
[2024-05-26 22:24:01] [INFO ] Computed 54 invariants in 2 ms
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-26 22:24:01] [INFO ] Invariant cache hit.
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [78, 79, 80, 81, 82, 83, 84]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 168 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/255 places, 72/116 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 117/255 places, 72/116 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s50 s51 s52 s53 s54 s55 s56) s115), p1:(GT 2 (ADD s78 s79 s80 s81 s82 s83 s84))], nbAcceptance=2, 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 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-02 finished in 385 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&&X(G((!p0||G(p1)))))) U (p2||X(X(p3)))))'
Support contains 66 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 253 transition count 116
Applied a total of 2 rules in 5 ms. Remains 253 /255 variables (removed 2) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-26 22:24:01] [INFO ] Computed 139 invariants in 5 ms
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-26 22:24:01] [INFO ] Invariant cache hit.
[2024-05-26 22:24:01] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [198, 199, 200, 201, 202, 203, 204]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 368 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/255 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 375 ms. Remains : 246/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) p0 (NOT p3)), true, (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 7}, { cond=(NOT p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ 2 (ADD s184 s185 s186 s187 s188 s189 s190)), p0:(AND (LEQ 3 s1) (LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Product exploration explored 100000 steps with 33333 reset in 190 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 p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-04 finished in 1244 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)&&X(G(p1)))))'
Support contains 64 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 125 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.2 ms
Discarding 130 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 125 transition count 73
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 23 place count 124 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 124 transition count 72
Applied a total of 24 rules in 12 ms. Remains 124 /255 variables (removed 131) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 124 cols
[2024-05-26 22:24:02] [INFO ] Computed 54 invariants in 15 ms
[2024-05-26 22:24:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 22:24:02] [INFO ] Invariant cache hit.
[2024-05-26 22:24:02] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [85, 86, 87, 88, 89, 90, 91]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 156 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/255 places, 72/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 117/255 places, 72/116 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-05 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:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 335 steps with 31 reset in 3 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-05 finished in 312 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&&F(p1)) U (G((p0&&F(p1)))||(p0&&F(p1)&&G(p2)))))))'
Support contains 10 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 253 transition count 115
Applied a total of 2 rules in 18 ms. Remains 253 /255 variables (removed 2) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-05-26 22:24:03] [INFO ] Computed 139 invariants in 3 ms
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [185, 186, 187, 188, 189, 190, 191, 199, 200, 201, 202, 203, 204, 205]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 396 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/255 places, 115/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 239/255 places, 115/116 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s2), p2:(GT (ADD s178 s179 s180 s181 s182 s183 s184) s236), p1:(LEQ s1 s2)], nbAcceptance=2, 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 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-07 finished in 591 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((p0&&X((p0 U (p1||G(p0))))))))'
Support contains 49 out of 255 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 116
Applied a total of 3 rules in 2 ms. Remains 252 /255 variables (removed 3) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-26 22:24:03] [INFO ] Computed 138 invariants in 3 ms
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-26 22:24:03] [INFO ] Invariant cache hit.
[2024-05-26 22:24:03] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 289 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/255 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 292 ms. Remains : 245/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-08 finished in 390 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 56 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Graph (complete) has 789 edges and 255 vertex of which 244 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /255 variables (removed 14) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-26 22:24:04] [INFO ] Computed 132 invariants in 8 ms
[2024-05-26 22:24:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-26 22:24:04] [INFO ] Invariant cache hit.
[2024-05-26 22:24:04] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [176, 177, 178, 179, 180, 181, 182, 190, 191, 192, 193, 194, 195, 196]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 301 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/255 places, 111/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 227/255 places, 111/116 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s197 s198 s199 s200 s201 s202 s203) (ADD s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-10 finished in 372 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((G(p0)||G(F(p1))))))'
Support contains 63 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 116/116 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 116
Applied a total of 3 rules in 4 ms. Remains 252 /255 variables (removed 3) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-26 22:24:04] [INFO ] Computed 138 invariants in 3 ms
[2024-05-26 22:24:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-26 22:24:04] [INFO ] Invariant cache hit.
[2024-05-26 22:24:04] [INFO ] Implicit Places using invariants and state equation in 197 ms returned [197, 198, 199, 200, 201, 202, 203]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 317 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/255 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 322 ms. Remains : 245/255 places, 116/116 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 (ADD s204 s205 s206 s207 s208 s209 s210)), p1:(GT (ADD s155 s156 s157 s158 s159 s160 s161) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-06-LTLCardinality-15 finished in 525 ms.
All properties solved by simple procedures.
Total runtime 16214 ms.

BK_STOP 1716762246916

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-06"
export BK_EXAMINATION="LTLCardinality"
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-COL-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361300007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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