Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017300899.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300899
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.0K Apr 30 13:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 13:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 34K May 10 09:34 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-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652980965661

Running Version 202205111006
[2022-05-19 17:22:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:22:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:22:46] [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.
[2022-05-19 17:22:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 17:22:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2022-05-19 17:22:47] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-19 17:22:47] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 7 ms.
[2022-05-19 17:22:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 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 11 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).
Finished random walk after 2015 steps, including 265 resets, run visited all 26 properties in 212 ms. (steps per millisecond=9 )
[2022-05-19 17:22:47] [INFO ] Flatten gal took : 18 ms
[2022-05-19 17:22:47] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2022-05-19 17:22:47] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 6 ms.
[2022-05-19 17:22:47] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 59 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 56
Applied a total of 1 rules in 8 ms. Remains 85 /86 variables (removed 1) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 85 cols
[2022-05-19 17:22:47] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-19 17:22:48] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 56 rows 85 cols
[2022-05-19 17:22:48] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-19 17:22:48] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [52, 53, 54]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 283 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/86 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 82/86 places, 56/56 transitions.
Support contains 59 out of 82 places after structural reductions.
[2022-05-19 17:22:48] [INFO ] Flatten gal took : 21 ms
[2022-05-19 17:22:48] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:22:48] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1643 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 565 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 548 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 568 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 564 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 565 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 570 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 563 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 553 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 556 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 566 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Finished Best-First random walk after 8377 steps, including 214 resets, run visited all 14 properties in 54 ms. (steps per millisecond=155 )
Computed a total of 82 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!F(G(F(p0))) U X((G(p1)||p1)))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 56
Applied a total of 8 rules in 2 ms. Remains 74 /82 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:22:49] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-19 17:22:50] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:22:50] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-19 17:22:50] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:22:50] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-19 17:22:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/82 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 356 ms :[p1, p1, p1, true, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ (ADD s62 s63 s64) s1), p0:(LEQ 1 s68)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-00 finished in 606 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(X(p1))))))'
Support contains 9 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 76 transition count 56
Applied a total of 6 rules in 4 ms. Remains 76 /82 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:22:50] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-19 17:22:50] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:22:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:22:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 76 cols
[2022-05-19 17:22:50] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-19 17:22:50] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/82 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ (ADD s46 s47 s48) (ADD s73 s74 s75)), p1:(GT 2 (ADD s52 s53 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Computed a total of 76 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-01 finished in 875 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||p1))))'
Support contains 14 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 70 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 52
Applied a total of 3 rules in 21 ms. Remains 68 /82 variables (removed 14) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 68 cols
[2022-05-19 17:22:51] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-19 17:22:51] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 52 rows 68 cols
[2022-05-19 17:22:51] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-19 17:22:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [41, 42, 43]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 129 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 52/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/82 places, 52/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT s63 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)) (LEQ (ADD s56 s57 s58) s1)), p0:(LEQ (ADD s56 s57 s58) s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19081 reset in 262 ms.
Product exploration explored 100000 steps with 19068 reset in 172 ms.
Computed a total of 65 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1865 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 17:22:52] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 17:22:52] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:22:52] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2022-05-19 17:22:52] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:22:52] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 17:22:52] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Support contains 14 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 17:22:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 17:22:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 17:22:53] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-19 17:22:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-19 17:22:53] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 17:22:53] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-19 17:22:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 52/52 transitions.
Computed a total of 65 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1871 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 52 rows 65 cols
[2022-05-19 17:22:53] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 17:22:53] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:22:53] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:53] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:22:53] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 17:22:53] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19073 reset in 135 ms.
Product exploration explored 100000 steps with 19075 reset in 137 ms.
Built C files in :
/tmp/ltsmin15497888380755233150
[2022-05-19 17:22:54] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2022-05-19 17:22:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:54] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2022-05-19 17:22:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:54] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2022-05-19 17:22:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15497888380755233150
Running compilation step : cd /tmp/ltsmin15497888380755233150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin15497888380755233150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15497888380755233150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15167452096931273050.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-03 finished in 3367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 35 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 35 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 35 transition count 30
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 34 transition count 29
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 34 transition count 29
Applied a total of 16 rules in 9 ms. Remains 34 /82 variables (removed 48) and now considering 29/56 (removed 27) transitions.
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 17:22:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 17:22:54] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 17:22:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 17:22:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-19 17:22:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 34 cols
[2022-05-19 17:22:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 17:22:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/82 places, 29/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/82 places, 29/56 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-04 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 s1 (ADD s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-04 finished in 149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p1 U G(!p1))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 69 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 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 66 transition count 51
Applied a total of 5 rules in 12 ms. Remains 66 /82 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 17:22:54] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 17:22:55] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 17:22:55] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 17:22:55] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/82 places, 51/56 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s46 s47 s48)), p1:(GT 3 (ADD s31 s32 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 35968 reset in 123 ms.
Product exploration explored 100000 steps with 35964 reset in 170 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 1875 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 564 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:55] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 17:22:56] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:56] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:22:56] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:56] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:22:56] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-19 17:22:56] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 339 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:56] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-19 17:22:56] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:22:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 17:22:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:22:56] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:22:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 17:22:56] [INFO ] Computed and/alt/rep : 44/84/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 17:22:56] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:56] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-19 17:22:56] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 17:22:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-19 17:22:56] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:56] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-19 17:22:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 51/51 transitions.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 455 steps, including 80 resets, run visited all 3 properties in 2 ms. (steps per millisecond=227 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 51 rows 63 cols
[2022-05-19 17:22:57] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-19 17:22:57] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-19 17:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:22:58] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-19 17:22:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:22:58] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2022-05-19 17:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:22:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-19 17:22:58] [INFO ] Computed and/alt/rep : 44/84/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 17:22:58] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 35836 reset in 137 ms.
Product exploration explored 100000 steps with 35841 reset in 143 ms.
Built C files in :
/tmp/ltsmin7718202074807969378
[2022-05-19 17:22:58] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-19 17:22:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:58] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-19 17:22:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:58] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-19 17:22:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:22:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7718202074807969378
Running compilation step : cd /tmp/ltsmin7718202074807969378;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 134 ms.
Running link step : cd /tmp/ltsmin7718202074807969378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7718202074807969378;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13993034522307118310.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-05 finished in 3804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 73 transition count 56
Applied a total of 9 rules in 3 ms. Remains 73 /82 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:22:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:22:58] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:22:58] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-19 17:22:58] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:22:58] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-19 17:22:58] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/82 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-07 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 s31 s32 s33))], 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-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-07 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||F(X(p1)))) U G((p2 U p3))))'
Support contains 14 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 64 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 62 transition count 49
Applied a total of 5 rules in 13 ms. Remains 62 /82 variables (removed 20) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 62 cols
[2022-05-19 17:22:59] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-19 17:22:59] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 49 rows 62 cols
[2022-05-19 17:22:59] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-19 17:22:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [34, 35, 36]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 90 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/82 places, 49/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/82 places, 49/56 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p3 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ s55 s56), p2:(LEQ 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18)), p0:(LEQ s55 (ADD s52 s53 s54)), p1:(OR (LEQ 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18046 reset in 110 ms.
Product exploration explored 100000 steps with 18058 reset in 103 ms.
Computed a total of 59 stabilizing places and 49 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 59 transition count 49
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 p3 (NOT p2) p0 p1), (X (OR p3 p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (OR p3 p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (G p3)), (F (OR (G p2) (G (NOT p2)))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p3))
Knowledge based reduction with 15 factoid took 628 ms. Reduced automaton from 3 states, 9 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-08 finished in 1164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(p0 U !X((X(G(F(p1)))||X(p2)))))))'
Support contains 8 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 74 transition count 56
Applied a total of 8 rules in 4 ms. Remains 74 /82 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:23:00] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:23:00] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:23:00] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:00] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 74 cols
[2022-05-19 17:23:00] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/82 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(GT 2 (ADD s56 s57 s58)), p2:(LEQ (ADD s65 s66 s67) s1), p1:(LEQ 1 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21035 reset in 109 ms.
Product exploration explored 100000 steps with 21008 reset in 111 ms.
Computed a total of 74 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 10 states, 23 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-09 finished in 1149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X(p1))&&(F(p1)||F(p2))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 73 transition count 56
Applied a total of 9 rules in 3 ms. Remains 73 /82 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:01] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 17:23:01] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:01] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-19 17:23:01] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 73 cols
[2022-05-19 17:23:01] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/82 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/82 places, 56/56 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) p1), p1, p1, (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 1 s0) (LEQ 1 (ADD s52 s53 s54))), p1:(LEQ 1 (ADD s52 s53 s54)), p2:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT p1)), true, (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-11 finished in 876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!X(X(G(X(p0))))) U G(F(p1))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 69 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 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 66 transition count 51
Applied a total of 5 rules in 14 ms. Remains 66 /82 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 17:23:02] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-19 17:23:02] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 51 rows 66 cols
[2022-05-19 17:23:02] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-19 17:23:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [40, 41, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/82 places, 51/56 transitions.
Stuttering acceptance computed with spot in 27 ms :[p1]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT (ADD s52 s53 s54) (ADD s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18700 reset in 101 ms.
Product exploration explored 100000 steps with 18768 reset in 103 ms.
Computed a total of 63 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-13 finished in 505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0))&&F((X(X(F(p1)))||p2)))))'
Support contains 16 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 56/56 transitions.
Graph (complete) has 168 edges and 82 vertex of which 74 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output 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 71 transition count 53
Applied a total of 5 rules in 6 ms. Remains 71 /82 variables (removed 11) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 71 cols
[2022-05-19 17:23:02] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-19 17:23:02] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 53 rows 71 cols
[2022-05-19 17:23:02] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-19 17:23:02] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 114 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 53/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 68/82 places, 53/56 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s35 s36 s37) (ADD s29 s30 s31)), p2:(GT (ADD s62 s63 s64) s1), p1:(LEQ (ADD s47 s48 s49) (ADD s50 s51 s52))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 8042 steps with 1994 reset in 15 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-14 finished in 308 ms.
All properties solved by simple procedures.
Total runtime 16217 ms.

BK_STOP 1652980983420

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017300899"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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