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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716769505863

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-PT-06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 00:25:07] [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-27 00:25:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:25:07] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-27 00:25:07] [INFO ] Transformed 270 places.
[2024-05-27 00:25:07] [INFO ] Transformed 116 transitions.
[2024-05-27 00:25:07] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 195 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 258 transition count 116
Applied a total of 12 rules in 11 ms. Remains 258 /270 variables (removed 12) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 258 cols
[2024-05-27 00:25:07] [INFO ] Computed 143 invariants in 20 ms
[2024-05-27 00:25:07] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-27 00:25:07] [INFO ] Invariant cache hit.
[2024-05-27 00:25:07] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-27 00:25:07] [INFO ] Invariant cache hit.
[2024-05-27 00:25:08] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 258/270 places, 116/116 transitions.
Support contains 195 out of 258 places after structural reductions.
[2024-05-27 00:25:08] [INFO ] Flatten gal took : 39 ms
[2024-05-27 00:25:08] [INFO ] Flatten gal took : 18 ms
[2024-05-27 00:25:08] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 31) seen :7
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2024-05-27 00:25:08] [INFO ] Invariant cache hit.
[2024-05-27 00:25:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 00:25:09] [INFO ] [Real]Absence check using 2 positive and 141 generalized place invariants in 22 ms returned sat
[2024-05-27 00:25:09] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2024-05-27 00:25:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 00:25:09] [INFO ] [Nat]Absence check using 2 positive and 141 generalized place invariants in 20 ms returned sat
[2024-05-27 00:25:10] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :17
[2024-05-27 00:25:10] [INFO ] After 1040ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :17
Attempting to minimize the solution found.
Minimization took 445 ms.
[2024-05-27 00:25:11] [INFO ] After 2248ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :17
Fused 24 Parikh solutions to 16 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 13 properties in 19 ms.
Support contains 5 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 207 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 194 transition count 50
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 187 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 186 transition count 49
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 83 place count 186 transition count 31
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 52 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 171 place count 116 transition count 31
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 54 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 253 place count 48 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 254 place count 47 transition count 16
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 45 transition count 16
Applied a total of 256 rules in 24 ms. Remains 45 /258 variables (removed 213) and now considering 16/116 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 45/258 places, 16/116 transitions.
Finished random walk after 44 steps, including 6 resets, run visited all 4 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 258 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 258 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 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 253 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 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 25 ms. Remains 252 /258 variables (removed 6) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 252 cols
[2024-05-27 00:25:11] [INFO ] Computed 138 invariants in 7 ms
[2024-05-27 00:25:11] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-27 00:25:11] [INFO ] Invariant cache hit.
[2024-05-27 00:25:12] [INFO ] Implicit Places using invariants and state equation in 198 ms returned [148, 149, 150, 151, 155, 160, 161, 198, 199, 223, 224, 225, 226, 227]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 342 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/258 places, 115/116 transitions.
Applied a total of 0 rules in 8 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 376 ms. Remains : 238/258 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 277 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s220 s221 s222 s223 s224 s225 s227) (ADD s8 s9 s10 s11 s12 s13 s14)), p0:(LEQ 1 s53), p2:(LEQ (ADD s55 s56 s57 s59 s60 s61 s62 s63 s64 s65 s6...], 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 10240 reset in 322 ms.
Product exploration explored 100000 steps with 10239 reset in 251 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 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (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 3233 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 72 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 243 ms. (steps per millisecond=707 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 243 ms. (steps per millisecond=707 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (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 814 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 77 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 77 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 9 ms. Remains 238 /238 variables (removed 0) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 238 cols
[2024-05-27 00:25:17] [INFO ] Computed 126 invariants in 11 ms
[2024-05-27 00:25:17] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-27 00:25:17] [INFO ] Invariant cache hit.
[2024-05-27 00:25:18] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-27 00:25:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 00:25:18] [INFO ] Invariant cache hit.
[2024-05-27 00:25:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 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 82 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 54 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 1026 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 171851 steps, run visited all 1 properties in 186 ms. (steps per millisecond=923 )
Probabilistic random walk after 171851 steps, saw 29132 distinct states, run finished after 187 ms. (steps per millisecond=918 ) 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 103 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 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10253 reset in 193 ms.
Product exploration explored 100000 steps with 10246 reset in 212 ms.
Built C files in :
/tmp/ltsmin6493810236708877387
[2024-05-27 00:25:19] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-27 00:25:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:25:19] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-27 00:25:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:25:19] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-27 00:25:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 00:25:19] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6493810236708877387
Running compilation step : cd /tmp/ltsmin6493810236708877387;'/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 414 ms.
Running link step : cd /tmp/ltsmin6493810236708877387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6493810236708877387;'/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/stateBased15566841063278140904.hoa' '--buchi-type=spotba'
LTSmin run took 584 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-00 finished in 8788 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 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 244 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 241 transition count 111
Applied a total of 5 rules in 17 ms. Remains 241 /258 variables (removed 17) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-27 00:25:20] [INFO ] Computed 132 invariants in 5 ms
[2024-05-27 00:25:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 00:25:20] [INFO ] Invariant cache hit.
[2024-05-27 00:25:20] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [144, 145, 146, 147, 151, 156, 157, 194, 195, 219, 220, 221, 222, 223]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 292 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 227/258 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 317 ms. Remains : 227/258 places, 111/116 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s51 s52 s53 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 s85 s86...], 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 10 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-01 finished in 362 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 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 172 transition count 84
Applied a total of 16 rules in 9 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-27 00:25:20] [INFO ] Computed 90 invariants in 1 ms
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 00:25:21] [INFO ] Invariant cache hit.
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [127, 128, 150, 151, 152, 153, 154]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 219 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s148 s149 s150 s151 s152 s153 s164) s35), p1:(GT 2 (ADD s82 s83 s84 s85 s88 s93 s94))], 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 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-02 finished in 393 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 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 5 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-27 00:25:21] [INFO ] Computed 139 invariants in 13 ms
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-27 00:25:21] [INFO ] Invariant cache hit.
[2024-05-27 00:25:21] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [148, 149, 150, 151, 155, 160, 161]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 354 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 7 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 368 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 351 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-PT-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 s191 s192 s216 s217 s218 s219 s220)), p0:(AND (LEQ 3 s8) (LEQ (ADD s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 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 248 ms.
Product exploration explored 100000 steps with 33333 reset in 212 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 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (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-PT-06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-04 finished in 1287 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 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.3 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 173 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 84
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 172 transition count 84
Applied a total of 18 rules in 17 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-27 00:25:22] [INFO ] Computed 90 invariants in 1 ms
[2024-05-27 00:25:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 00:25:22] [INFO ] Invariant cache hit.
[2024-05-27 00:25:22] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [81, 82, 83, 84, 87, 92, 93]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 194 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/258 places, 84/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 165/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-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 s131 s132 s133 s134 s159 s161 s162) (ADD s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 ...], 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 19 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-05 finished in 350 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 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 254 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 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 17 ms. Remains 253 /258 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 253 cols
[2024-05-27 00:25:23] [INFO ] Computed 139 invariants in 4 ms
[2024-05-27 00:25:23] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 00:25:23] [INFO ] Invariant cache hit.
[2024-05-27 00:25:23] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [149, 150, 151, 152, 156, 161, 162, 199, 200, 224, 225, 226, 227, 228]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 421 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/258 places, 115/116 transitions.
Applied a total of 0 rules in 5 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 444 ms. Remains : 239/258 places, 115/116 transitions.
Stuttering acceptance computed with spot in 202 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-PT-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 s55), p2:(GT (ADD s208 s209 s210 s211 s212 s213 s214) s54), p1:(LEQ s14 s55)], 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 30 steps with 2 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-07 finished in 673 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)))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 252 transition count 116
Applied a total of 6 rules in 6 ms. Remains 252 /258 variables (removed 6) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-27 00:25:23] [INFO ] Computed 138 invariants in 2 ms
[2024-05-27 00:25:23] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-27 00:25:23] [INFO ] Invariant cache hit.
[2024-05-27 00:25:24] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 358 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/258 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 366 ms. Remains : 245/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-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:(GT 3 s52)], 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]]
Product exploration explored 100000 steps with 9831 reset in 106 ms.
Product exploration explored 100000 steps with 9838 reset in 112 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 984 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 168 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2306614 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :{}
Probabilistic random walk after 2306614 steps, saw 352576 distinct states, run finished after 3006 ms. (steps per millisecond=767 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 245 cols
[2024-05-27 00:25:27] [INFO ] Computed 132 invariants in 12 ms
[2024-05-27 00:25:27] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 18 ms returned sat
[2024-05-27 00:25:27] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-08 finished in 4102 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||(p1&&F(p0))))))'
Support contains 1 out of 258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 4 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-27 00:25:27] [INFO ] Computed 139 invariants in 3 ms
[2024-05-27 00:25:27] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-27 00:25:27] [INFO ] Invariant cache hit.
[2024-05-27 00:25:28] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [148, 149, 150, 155, 160, 161]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 424 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 247/258 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 247 /247 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 431 ms. Remains : 247/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s148)], 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][false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-09 finished in 843 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)&&F(G(p1))))'
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Graph (complete) has 806 edges and 258 vertex of which 173 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.4 ms
Discarding 85 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 172 transition count 84
Applied a total of 16 rules in 15 ms. Remains 172 /258 variables (removed 86) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 172 cols
[2024-05-27 00:25:28] [INFO ] Computed 90 invariants in 1 ms
[2024-05-27 00:25:28] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-27 00:25:28] [INFO ] Invariant cache hit.
[2024-05-27 00:25:28] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [82, 84, 85, 88, 93, 94, 127, 128, 150, 151, 152, 153, 154]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 250 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/258 places, 84/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 159/258 places, 84/116 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s132), p1:(GT s82 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-10 finished in 389 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))'
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 3 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-27 00:25:28] [INFO ] Computed 139 invariants in 1 ms
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-27 00:25:29] [INFO ] Invariant cache hit.
[2024-05-27 00:25:29] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 448 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 456 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s245)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 186 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 : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 1385 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-12 finished in 2341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p0)||F(p1))))))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 116/116 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 253 transition count 116
Applied a total of 5 rules in 2 ms. Remains 253 /258 variables (removed 5) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 253 cols
[2024-05-27 00:25:31] [INFO ] Computed 138 invariants in 1 ms
[2024-05-27 00:25:31] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 00:25:31] [INFO ] Invariant cache hit.
[2024-05-27 00:25:31] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 346 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/258 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 350 ms. Remains : 246/258 places, 116/116 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s245 s40), p0:(LEQ 1 s245)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9832 reset in 180 ms.
Product exploration explored 100000 steps with 9838 reset in 111 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 p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 982 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1504297 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :{0=1}
Probabilistic random walk after 1504297 steps, saw 240425 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 246 cols
[2024-05-27 00:25:35] [INFO ] Computed 132 invariants in 4 ms
[2024-05-27 00:25:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 00:25:35] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 787 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLCardinality-15 finished in 5355 ms.
All properties solved by simple procedures.
Total runtime 29433 ms.

BK_STOP 1716769544516

--------------------
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-PT-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-PT-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-171662361400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "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 ;