Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 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-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678912954936

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 20:42:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 20:42:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 20:42:36] [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.
[2023-03-15 20:42:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 20:42:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2023-03-15 20:42:37] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 20:42:37] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-15 20:42:37] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 362 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10003 steps, including 134 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 20:42:37] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-15 20:42:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 20:42:37] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-15 20:42:37] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-15 20:42:37] [INFO ] Flatten gal took : 19 ms
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 20:42:37] [INFO ] Flatten gal took : 4 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2023-03-15 20:42:37] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 20 ms.
[2023-03-15 20:42:37] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 844 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1377 transition count 296
Applied a total of 21 rules in 65 ms. Remains 1377 /1398 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1377 cols
[2023-03-15 20:42:37] [INFO ] Computed 1082 place invariants in 46 ms
[2023-03-15 20:42:38] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-15 20:42:38] [INFO ] Invariant cache hit.
[2023-03-15 20:42:40] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2495 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1358/1398 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1358 /1358 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2591 ms. Remains : 1358/1398 places, 296/296 transitions.
Support contains 844 out of 1358 places after structural reductions.
[2023-03-15 20:42:40] [INFO ] Flatten gal took : 86 ms
[2023-03-15 20:42:40] [INFO ] Flatten gal took : 75 ms
[2023-03-15 20:42:40] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 825 out of 1358 places (down from 844) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 296 rows 1358 cols
[2023-03-15 20:42:41] [INFO ] Computed 1063 place invariants in 75 ms
[2023-03-15 20:42:42] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 20:42:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-15 20:42:42] [INFO ] [Nat]Absence check using 1 positive and 1062 generalized place invariants in 181 ms returned sat
[2023-03-15 20:42:49] [INFO ] After 6931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 20:42:55] [INFO ] After 12444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 5718 ms.
[2023-03-15 20:43:00] [INFO ] After 18874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=17 )
Parikh walk visited 8 properties in 29 ms.
Computed a total of 1358 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1358 transition count 296
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1356 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1355 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1355 transition count 294
Applied a total of 5 rules in 211 ms. Remains 1355 /1358 variables (removed 3) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2023-03-15 20:43:01] [INFO ] Computed 1062 place invariants in 62 ms
[2023-03-15 20:43:02] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2023-03-15 20:43:02] [INFO ] Invariant cache hit.
[2023-03-15 20:43:04] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned [1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2934 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1358 places, 294/296 transitions.
Applied a total of 0 rules in 54 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3199 ms. Remains : 1336/1358 places, 294/296 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1252 s1253 s1254 s1255)) (LEQ 1 s1)), p2:(AN...], 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 6237 reset in 1930 ms.
Product exploration explored 100000 steps with 6262 reset in 1911 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 421 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-15 20:43:09] [INFO ] Computed 1044 place invariants in 136 ms
[2023-03-15 20:43:09] [INFO ] After 122ms 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:43:09] [INFO ] Invariant cache hit.
[2023-03-15 20:43:11] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 893 ms returned sat
[2023-03-15 20:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:43:13] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2023-03-15 20:43:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:43:15] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 910 ms returned sat
[2023-03-15 20:43:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:43:18] [INFO ] [Nat]Absence check using state equation in 3189 ms returned sat
[2023-03-15 20:43:18] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 22 ms.
[2023-03-15 20:43:18] [INFO ] Added : 15 causal constraints over 3 iterations in 244 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 42 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-15 20:43:18] [INFO ] Invariant cache hit.
[2023-03-15 20:43:19] [INFO ] Implicit Places using invariants in 969 ms returned []
[2023-03-15 20:43:19] [INFO ] Invariant cache hit.
[2023-03-15 20:43:21] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2688 ms to find 0 implicit places.
[2023-03-15 20:43:21] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 20:43:21] [INFO ] Invariant cache hit.
[2023-03-15 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3215 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:43:22] [INFO ] Invariant cache hit.
[2023-03-15 20:43:24] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 901 ms returned sat
[2023-03-15 20:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:43:26] [INFO ] [Real]Absence check using state equation in 2745 ms returned sat
[2023-03-15 20:43:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:43:28] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 936 ms returned sat
[2023-03-15 20:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:43:31] [INFO ] [Nat]Absence check using state equation in 3115 ms returned sat
[2023-03-15 20:43:31] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 22 ms.
[2023-03-15 20:43:31] [INFO ] Added : 15 causal constraints over 3 iterations in 225 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6237 reset in 791 ms.
Product exploration explored 100000 steps with 6246 reset in 780 ms.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 34 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-15 20:43:33] [INFO ] Invariant cache hit.
[2023-03-15 20:43:34] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-15 20:43:34] [INFO ] Invariant cache hit.
[2023-03-15 20:43:36] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2645 ms to find 0 implicit places.
[2023-03-15 20:43:36] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 20:43:36] [INFO ] Invariant cache hit.
[2023-03-15 20:43:36] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3140 ms. Remains : 1336/1336 places, 294/294 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 35479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 559 are kept as prefixes of interest. Removing 799 places using SCC suffix rule.3 ms
Discarding 799 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 559 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 559 transition count 183
Applied a total of 58 rules in 34 ms. Remains 559 /1358 variables (removed 799) and now considering 183/296 (removed 113) transitions.
// Phase 1: matrix 183 rows 559 cols
[2023-03-15 20:43:36] [INFO ] Computed 378 place invariants in 6 ms
[2023-03-15 20:43:36] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-15 20:43:36] [INFO ] Invariant cache hit.
[2023-03-15 20:43:37] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-15 20:43:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 20:43:37] [INFO ] Invariant cache hit.
[2023-03-15 20:43:37] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1358 places, 183/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 559/1358 places, 183/296 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 ...], 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 10580 reset in 656 ms.
Product exploration explored 100000 steps with 10549 reset in 656 ms.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 421 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 393 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 20:43:39] [INFO ] Invariant cache hit.
[2023-03-15 20:43:39] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 60 ms returned sat
[2023-03-15 20:43:39] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:43:40] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 56 ms returned sat
[2023-03-15 20:43:42] [INFO ] After 1974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 20:43:43] [INFO ] After 2994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1244 ms.
[2023-03-15 20:43:44] [INFO ] After 4404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 510 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-15 20:43:45] [INFO ] Invariant cache hit.
[2023-03-15 20:43:45] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-15 20:43:45] [INFO ] Invariant cache hit.
[2023-03-15 20:43:45] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-15 20:43:45] [INFO ] Invariant cache hit.
[2023-03-15 20:43:45] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 559/559 places, 183/183 transitions.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 389 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 20:43:46] [INFO ] Invariant cache hit.
[2023-03-15 20:43:46] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 57 ms returned sat
[2023-03-15 20:43:46] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 20:43:46] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 55 ms returned sat
[2023-03-15 20:43:49] [INFO ] After 2541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 20:43:50] [INFO ] After 3095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 767 ms.
[2023-03-15 20:43:50] [INFO ] After 4025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10657 reset in 584 ms.
Product exploration explored 100000 steps with 10630 reset in 592 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 26 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-15 20:43:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 20:43:53] [INFO ] Invariant cache hit.
[2023-03-15 20:43:53] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 559/559 places, 183/183 transitions.
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-15 20:43:53] [INFO ] Invariant cache hit.
[2023-03-15 20:43:53] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-15 20:43:53] [INFO ] Invariant cache hit.
[2023-03-15 20:43:53] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-15 20:43:53] [INFO ] Invariant cache hit.
[2023-03-15 20:43:53] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 559/559 places, 183/183 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-01 finished in 17413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(!p0)))'
Support contains 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 47 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 20:43:54] [INFO ] Computed 1044 place invariants in 72 ms
[2023-03-15 20:43:55] [INFO ] Implicit Places using invariants in 1346 ms returned []
[2023-03-15 20:43:55] [INFO ] Invariant cache hit.
[2023-03-15 20:43:57] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 3520 ms to find 0 implicit places.
[2023-03-15 20:43:57] [INFO ] Invariant cache hit.
[2023-03-15 20:43:58] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4015 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102) s1336)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 4161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1336 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 1335 transition count 293
Applied a total of 3 rules in 108 ms. Remains 1335 /1358 variables (removed 23) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2023-03-15 20:43:58] [INFO ] Computed 1044 place invariants in 22 ms
[2023-03-15 20:43:59] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2023-03-15 20:43:59] [INFO ] Invariant cache hit.
[2023-03-15 20:44:01] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3384 ms to find 0 implicit places.
[2023-03-15 20:44:01] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 20:44:01] [INFO ] Invariant cache hit.
[2023-03-15 20:44:02] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3975 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334) (ADD s1293 s1294 s1295 s12...], 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 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 4103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p0))))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1 are kept as prefixes of interest. Removing 1357 places using SCC suffix rule.4 ms
Discarding 1357 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 7 ms. Remains 1 /1358 variables (removed 1357) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-15 20:44:02] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-15 20:44:02] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-15 20:44:02] [INFO ] Invariant cache hit.
[2023-03-15 20:44:02] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-15 20:44:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 20:44:02] [INFO ] Invariant cache hit.
[2023-03-15 20:44:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1358 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 1/1358 places, 1/296 transitions.
Stuttering acceptance computed with spot in 112 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
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 (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 44 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 20:44:02] [INFO ] Computed 1044 place invariants in 93 ms
[2023-03-15 20:44:04] [INFO ] Implicit Places using invariants in 1275 ms returned []
[2023-03-15 20:44:04] [INFO ] Invariant cache hit.
[2023-03-15 20:44:06] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 3465 ms to find 0 implicit places.
[2023-03-15 20:44:06] [INFO ] Invariant cache hit.
[2023-03-15 20:44:06] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3947 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-06 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=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102)), p1:(LEQ s1335 (ADD s13...], nbAcceptance=0, 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 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-06 finished in 4201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 19 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 178 are kept as prefixes of interest. Removing 1180 places using SCC suffix rule.3 ms
Discarding 1180 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
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 1 with 4 rules applied. Total rules applied 80 place count 175 transition count 123
Applied a total of 80 rules in 14 ms. Remains 175 /1358 variables (removed 1183) and now considering 123/296 (removed 173) transitions.
// Phase 1: matrix 123 rows 175 cols
[2023-03-15 20:44:07] [INFO ] Computed 54 place invariants in 0 ms
[2023-03-15 20:44:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-15 20:44:07] [INFO ] Invariant cache hit.
[2023-03-15 20:44:07] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 238 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/1358 places, 123/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 156/1358 places, 123/296 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], 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 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-07 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(X(!p2)&&p1)))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1356 transition count 296
Applied a total of 2 rules in 49 ms. Remains 1356 /1358 variables (removed 2) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2023-03-15 20:44:07] [INFO ] Computed 1062 place invariants in 12 ms
[2023-03-15 20:44:08] [INFO ] Implicit Places using invariants in 1174 ms returned []
[2023-03-15 20:44:08] [INFO ] Invariant cache hit.
[2023-03-15 20:44:10] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 3409 ms to find 0 implicit places.
[2023-03-15 20:44:10] [INFO ] Invariant cache hit.
[2023-03-15 20:44:11] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3906 ms. Remains : 1356/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 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}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s1354 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4418 reset in 591 ms.
Product exploration explored 100000 steps with 4414 reset in 525 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 943 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 20:44:14] [INFO ] Invariant cache hit.
[2023-03-15 20:44:14] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 178 ms returned sat
[2023-03-15 20:44:14] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-15 20:44:14] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 166 ms returned sat
[2023-03-15 20:44:16] [INFO ] After 1620ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 833 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:44:17] [INFO ] Invariant cache hit.
[2023-03-15 20:44:18] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 664 ms returned sat
[2023-03-15 20:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:20] [INFO ] [Real]Absence check using state equation in 2418 ms returned sat
[2023-03-15 20:44:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:44:21] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 658 ms returned sat
[2023-03-15 20:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:24] [INFO ] [Nat]Absence check using state equation in 2754 ms returned sat
[2023-03-15 20:44:24] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2023-03-15 20:44:24] [INFO ] Added : 0 causal constraints over 0 iterations in 106 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1356 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 : 1356/1356 places, 296/296 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1355 transition count 295
Applied a total of 3 rules in 140 ms. Remains 1355 /1356 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-15 20:44:24] [INFO ] Computed 1062 place invariants in 6 ms
[2023-03-15 20:44:25] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2023-03-15 20:44:25] [INFO ] Invariant cache hit.
[2023-03-15 20:44:27] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 3318 ms to find 0 implicit places.
[2023-03-15 20:44:28] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 20:44:28] [INFO ] Invariant cache hit.
[2023-03-15 20:44:28] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1356 places, 295/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3940 ms. Remains : 1355/1356 places, 295/296 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:44:29] [INFO ] Invariant cache hit.
[2023-03-15 20:44:30] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 640 ms returned sat
[2023-03-15 20:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:32] [INFO ] [Real]Absence check using state equation in 2158 ms returned sat
[2023-03-15 20:44:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:44:33] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 663 ms returned sat
[2023-03-15 20:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:35] [INFO ] [Nat]Absence check using state equation in 2491 ms returned sat
[2023-03-15 20:44:35] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 20 ms.
[2023-03-15 20:44:36] [INFO ] Added : 0 causal constraints over 0 iterations in 93 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10766 reset in 387 ms.
Product exploration explored 100000 steps with 10848 reset in 408 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.2 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 6 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-15 20:44:36] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-15 20:44:36] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-15 20:44:37] [INFO ] Invariant cache hit.
[2023-03-15 20:44:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-15 20:44:37] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 20:44:37] [INFO ] Invariant cache hit.
[2023-03-15 20:44:37] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 177/1355 places, 125/295 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 29935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 36 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-15 20:44:37] [INFO ] Computed 1044 place invariants in 81 ms
[2023-03-15 20:44:38] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2023-03-15 20:44:38] [INFO ] Invariant cache hit.
[2023-03-15 20:44:40] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
[2023-03-15 20:44:40] [INFO ] Invariant cache hit.
[2023-03-15 20:44:41] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3856 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10 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 s0)], 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 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 3950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1317 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.3 ms
Discarding 41 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 1314 transition count 291
Applied a total of 5 rules in 81 ms. Remains 1314 /1358 variables (removed 44) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2023-03-15 20:44:41] [INFO ] Computed 1026 place invariants in 86 ms
[2023-03-15 20:44:42] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2023-03-15 20:44:42] [INFO ] Invariant cache hit.
[2023-03-15 20:44:44] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3316 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1358 places, 291/296 transitions.
Applied a total of 0 rules in 74 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3472 ms. Remains : 1295/1358 places, 291/296 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11 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 1 s0)], 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 4215 reset in 222 ms.
Product exploration explored 100000 steps with 4215 reset in 225 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 291 rows 1295 cols
[2023-03-15 20:44:45] [INFO ] Computed 1008 place invariants in 130 ms
[2023-03-15 20:44:47] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 824 ms returned sat
[2023-03-15 20:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:49] [INFO ] [Real]Absence check using state equation in 2648 ms returned sat
[2023-03-15 20:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:44:50] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 794 ms returned sat
[2023-03-15 20:44:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:44:54] [INFO ] [Nat]Absence check using state equation in 3142 ms returned sat
[2023-03-15 20:44:54] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 19 ms.
[2023-03-15 20:44:54] [INFO ] Added : 9 causal constraints over 2 iterations in 178 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 40 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-15 20:44:54] [INFO ] Invariant cache hit.
[2023-03-15 20:44:55] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2023-03-15 20:44:55] [INFO ] Invariant cache hit.
[2023-03-15 20:44:57] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 3328 ms to find 0 implicit places.
[2023-03-15 20:44:57] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 20:44:57] [INFO ] Invariant cache hit.
[2023-03-15 20:44:58] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3795 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-15 20:44:58] [INFO ] Invariant cache hit.
[2023-03-15 20:44:59] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 856 ms returned sat
[2023-03-15 20:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:02] [INFO ] [Real]Absence check using state equation in 2581 ms returned sat
[2023-03-15 20:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:45:03] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 790 ms returned sat
[2023-03-15 20:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:09] [INFO ] [Nat]Absence check using state equation in 5448 ms returned sat
[2023-03-15 20:45:09] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 19 ms.
[2023-03-15 20:45:09] [INFO ] Added : 76 causal constraints over 16 iterations in 749 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4208 reset in 211 ms.
Product exploration explored 100000 steps with 4210 reset in 223 ms.
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 46 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-15 20:45:10] [INFO ] Invariant cache hit.
[2023-03-15 20:45:11] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2023-03-15 20:45:11] [INFO ] Invariant cache hit.
[2023-03-15 20:45:13] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
[2023-03-15 20:45:13] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 20:45:13] [INFO ] Invariant cache hit.
[2023-03-15 20:45:13] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3680 ms. Remains : 1295/1295 places, 291/291 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 32765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1354 transition count 293
Applied a total of 5 rules in 83 ms. Remains 1354 /1358 variables (removed 4) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1354 cols
[2023-03-15 20:45:14] [INFO ] Computed 1062 place invariants in 47 ms
[2023-03-15 20:45:15] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2023-03-15 20:45:15] [INFO ] Invariant cache hit.
[2023-03-15 20:45:17] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3658 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Applied a total of 0 rules in 44 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3786 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1315 (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 3888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(X(!p2)&&p1)))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-09
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1356 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1355 transition count 295
Applied a total of 4 rules in 131 ms. Remains 1355 /1358 variables (removed 3) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-15 20:45:18] [INFO ] Computed 1062 place invariants in 11 ms
[2023-03-15 20:45:19] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2023-03-15 20:45:19] [INFO ] Invariant cache hit.
[2023-03-15 20:45:21] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 3415 ms to find 0 implicit places.
[2023-03-15 20:45:21] [INFO ] Invariant cache hit.
[2023-03-15 20:45:22] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1358 places, 295/296 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3988 ms. Remains : 1355/1358 places, 295/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 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}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4419 reset in 503 ms.
Product exploration explored 100000 steps with 4422 reset in 545 ms.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 952 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 20:45:24] [INFO ] Invariant cache hit.
[2023-03-15 20:45:25] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 178 ms returned sat
[2023-03-15 20:45:25] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-15 20:45:25] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 176 ms returned sat
[2023-03-15 20:45:26] [INFO ] After 786ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 965 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:45:27] [INFO ] Invariant cache hit.
[2023-03-15 20:45:28] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 690 ms returned sat
[2023-03-15 20:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:30] [INFO ] [Real]Absence check using state equation in 2170 ms returned sat
[2023-03-15 20:45:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:45:31] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 696 ms returned sat
[2023-03-15 20:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:33] [INFO ] [Nat]Absence check using state equation in 2506 ms returned sat
[2023-03-15 20:45:34] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 41 ms.
[2023-03-15 20:45:34] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1355 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 : 1355/1355 places, 295/295 transitions.
Applied a total of 0 rules in 47 ms. Remains 1355 /1355 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-15 20:45:34] [INFO ] Invariant cache hit.
[2023-03-15 20:45:35] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2023-03-15 20:45:35] [INFO ] Invariant cache hit.
[2023-03-15 20:45:37] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 3468 ms to find 0 implicit places.
[2023-03-15 20:45:37] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 20:45:37] [INFO ] Invariant cache hit.
[2023-03-15 20:45:38] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3972 ms. Remains : 1355/1355 places, 295/295 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
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 p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-15 20:45:38] [INFO ] Invariant cache hit.
[2023-03-15 20:45:39] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 693 ms returned sat
[2023-03-15 20:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:42] [INFO ] [Real]Absence check using state equation in 2193 ms returned sat
[2023-03-15 20:45:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 20:45:43] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 674 ms returned sat
[2023-03-15 20:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 20:45:45] [INFO ] [Nat]Absence check using state equation in 2446 ms returned sat
[2023-03-15 20:45:45] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 34 ms.
[2023-03-15 20:45:45] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10839 reset in 386 ms.
Product exploration explored 100000 steps with 10724 reset in 378 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.9 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 15 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-15 20:45:46] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-15 20:45:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-15 20:45:46] [INFO ] Invariant cache hit.
[2023-03-15 20:45:46] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-15 20:45:46] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 20:45:46] [INFO ] Invariant cache hit.
[2023-03-15 20:45:46] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 177/1355 places, 125/295 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 28859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-15 20:45:47] [INFO ] Flatten gal took : 48 ms
[2023-03-15 20:45:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-15 20:45:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1358 places, 296 transitions and 2948 arcs took 3 ms.
Total runtime 190689 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-18
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678913313846

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-18-LTLCardinality-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/900 5/32 QuasiCertifProtocol-COL-18-LTLCardinality-01 488372 m, 97674 m/sec, 2142288 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-COL-18-LTLCardinality-01
lola: result : true
lola: markings : 709044
lola: fired transitions : 3306780
lola: time used : 8.000000
lola: memory pages used : 7
lola: LAUNCH task # 7 (type EXCL) for 6 QuasiCertifProtocol-COL-18-LTLCardinality-09
lola: time limit : 1197 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 2/1197 3/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 261740 m, 52348 m/sec, 1082216 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 7/1197 9/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 870515 m, 121755 m/sec, 3264017 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 12/1197 14/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 1392308 m, 104358 m/sec, 5530227 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 17/1197 19/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 1960272 m, 113592 m/sec, 7744411 t fired, .

Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 22/1197 23/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 2457515 m, 99448 m/sec, 9857668 t fired, .

Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 27/1197 28/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 2956049 m, 99706 m/sec, 12030882 t fired, .

Time elapsed: 35 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 32/1197 32/32 QuasiCertifProtocol-COL-18-LTLCardinality-09 3398262 m, 88442 m/sec, 14139750 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for QuasiCertifProtocol-COL-18-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 QuasiCertifProtocol-COL-18-LTLCardinality-11
lola: time limit : 1777 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for QuasiCertifProtocol-COL-18-LTLCardinality-11
lola: result : false
lola: markings : 159
lola: fired transitions : 160
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-18-LTLCardinality-00
lola: time limit : 3555 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3555 3/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 288832 m, 57766 m/sec, 2183545 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3555 4/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 519584 m, 46150 m/sec, 4398878 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3555 6/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 773970 m, 50877 m/sec, 6615735 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3555 8/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 988588 m, 42923 m/sec, 8775682 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3555 9/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 1199756 m, 42233 m/sec, 10935927 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3555 11/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 1431012 m, 46251 m/sec, 13077604 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3555 13/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 1645936 m, 42984 m/sec, 15186149 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3555 14/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 1855301 m, 41873 m/sec, 17296247 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3555 16/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2040969 m, 37133 m/sec, 19384514 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3555 17/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2203557 m, 32517 m/sec, 21487867 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3555 18/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2350681 m, 29424 m/sec, 23577277 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3555 19/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2540287 m, 37921 m/sec, 25604615 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3555 20/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2683685 m, 28679 m/sec, 27689663 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3555 21/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 2829597 m, 29182 m/sec, 29799815 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3555 23/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3015425 m, 37165 m/sec, 31879360 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3555 24/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3228805 m, 42676 m/sec, 33869175 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3555 26/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3415209 m, 37280 m/sec, 35900687 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3555 27/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3596714 m, 36301 m/sec, 37946631 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3555 28/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3738565 m, 28370 m/sec, 40032174 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3555 29/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 3882398 m, 28766 m/sec, 42107712 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3555 30/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 4037530 m, 31026 m/sec, 44157827 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3555 31/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 4211319 m, 34757 m/sec, 46182719 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3555 32/32 QuasiCertifProtocol-COL-18-LTLCardinality-00 4342228 m, 26181 m/sec, 48311689 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-COL-18-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-18-LTLCardinality-00: LTL unknown AGGR
QuasiCertifProtocol-COL-18-LTLCardinality-01: LTL true LTL model checker
QuasiCertifProtocol-COL-18-LTLCardinality-09: LTL unknown AGGR
QuasiCertifProtocol-COL-18-LTLCardinality-11: LTL false LTL model checker


Time elapsed: 165 secs. Pages in use: 32

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-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-COL-18, 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 r295-tall-167873948400827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 ;