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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 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 131K 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-32-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678916492867

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-32
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:41:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 21:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:41:34] [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 21:41:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 21:41:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2023-03-15 21:41:35] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 18 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 21:41:35] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-15 21:41:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 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 10012 steps, including 230 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 23) seen :10
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 21:41:36] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-15 21:41:36] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-15 21:41:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 21:41:36] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-15 21:41:36] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-15 21:41:36] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 8 different solutions.
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=171 )
Parikh walk visited 8 properties in 21 ms.
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 21:41:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-15 21:41:36] [INFO ] Flatten gal took : 20 ms
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 21:41:36] [INFO ] Flatten gal took : 5 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-15 21:41:36] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 28 ms.
[2023-03-15 21:41:36] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 1426 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 3772 transition count 506
Applied a total of 34 rules in 363 ms. Remains 3772 /3806 variables (removed 34) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3772 cols
[2023-03-15 21:41:37] [INFO ] Computed 3267 place invariants in 175 ms
[2023-03-15 21:41:39] [INFO ] Implicit Places using invariants in 2314 ms returned []
[2023-03-15 21:41:39] [INFO ] Invariant cache hit.
[2023-03-15 21:41:41] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2023-03-15 21:41:41] [INFO ] Invariant cache hit.
[2023-03-15 21:41:43] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3772/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6215 ms. Remains : 3772/3806 places, 506/506 transitions.
Support contains 1426 out of 3772 places after structural reductions.
[2023-03-15 21:41:43] [INFO ] Flatten gal took : 199 ms
[2023-03-15 21:41:43] [INFO ] Flatten gal took : 134 ms
[2023-03-15 21:41:43] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-15 21:41:44] [INFO ] Invariant cache hit.
[2023-03-15 21:41:45] [INFO ] After 991ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-15 21:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-15 21:41:47] [INFO ] [Nat]Absence check using 2 positive and 3265 generalized place invariants in 755 ms returned sat
[2023-03-15 21:42:10] [INFO ] After 22798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 21:42:10] [INFO ] After 22810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-15 21:42:10] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 12 ms.
Support contains 1226 out of 3772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3772 transition count 501
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3771 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 3770 transition count 500
Applied a total of 8 rules in 298 ms. Remains 3770 /3772 variables (removed 2) and now considering 500/506 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 3770/3772 places, 500/506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 350724 steps, run timeout after 3004 ms. (steps per millisecond=116 ) properties seen :{0=1, 1=1, 4=1, 5=1}
Probabilistic random walk after 350724 steps, saw 67380 distinct states, run finished after 3005 ms. (steps per millisecond=116 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 500 rows 3770 cols
[2023-03-15 21:42:15] [INFO ] Computed 3270 place invariants in 79 ms
[2023-03-15 21:42:15] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2023-03-15 21:42:16] [INFO ] [Real]Absence check using 35 positive and 3235 generalized place invariants in 800 ms returned sat
[2023-03-15 21:42:16] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 21:42:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2023-03-15 21:42:17] [INFO ] [Nat]Absence check using 35 positive and 3235 generalized place invariants in 779 ms returned sat
[2023-03-15 21:42:21] [INFO ] After 4506ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 3772 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3772 transition count 506
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' '!(X(X(X((X(!p0) U (X(G(!p0))||(p1&&X(!p0))))))))'
Support contains 100 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3737 transition count 506
Applied a total of 35 rules in 481 ms. Remains 3737 /3772 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2023-03-15 21:42:22] [INFO ] Computed 3233 place invariants in 309 ms
[2023-03-15 21:42:25] [INFO ] Implicit Places using invariants in 3258 ms returned []
[2023-03-15 21:42:25] [INFO ] Invariant cache hit.
[2023-03-15 21:42:35] [INFO ] Implicit Places using invariants and state equation in 10841 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14107 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3772 places, 506/506 transitions.
Applied a total of 0 rules in 274 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14869 ms. Remains : 3704/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 341 ms :[p0, p0, p0, p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-00 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=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s3500 s3501 s3502 s3503 s3504 s3505 s3506 s3507 s3508 s3509 s3510 s3511 s3512 s3513 s3514 s3515 s3516 s3517 s3518 s3519 s3520 s3521 s3522 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-00 finished in 15269 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(F(p0))))'
Support contains 34 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 256 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:42:36] [INFO ] Computed 3232 place invariants in 83 ms
[2023-03-15 21:42:42] [INFO ] Implicit Places using invariants in 6136 ms returned []
[2023-03-15 21:42:42] [INFO ] Invariant cache hit.
[2023-03-15 21:42:53] [INFO ] Implicit Places using invariants and state equation in 10361 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16514 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 274 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17044 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s3565 s3566 s3567 s3568 s3569 s3570 s3571 s3572 s3573 s3574 s3575 s3576 s3577 s3578 s3579 s3580 s3581 s3582 s3583 s3584 s3585 s3586 s3587 s35...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1309 ms.
Product exploration explored 100000 steps with 33333 reset in 1225 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-03 finished in 20316 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 34 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 3737 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.37 ms
Discarding 35 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3734 transition count 503
Applied a total of 5 rules in 632 ms. Remains 3734 /3772 variables (removed 38) and now considering 503/506 (removed 3) transitions.
// Phase 1: matrix 503 rows 3734 cols
[2023-03-15 21:42:57] [INFO ] Computed 3233 place invariants in 78 ms
[2023-03-15 21:43:00] [INFO ] Implicit Places using invariants in 3232 ms returned []
[2023-03-15 21:43:00] [INFO ] Invariant cache hit.
[2023-03-15 21:43:12] [INFO ] Implicit Places using invariants and state equation in 11873 ms returned [3434, 3435, 3436, 3437, 3438, 3439, 3440, 3441, 3442, 3443, 3444, 3445, 3446, 3447, 3448, 3449, 3450, 3451, 3452, 3453, 3454, 3455, 3456, 3457, 3458, 3459, 3460, 3461, 3462, 3463, 3464, 3465, 3466, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 15110 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3668/3772 places, 503/506 transitions.
Applied a total of 0 rules in 289 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16034 ms. Remains : 3668/3772 places, 503/506 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 3 (ADD s3269 s3270 s3271 s3272 s3273 s3274 s3275 s3276 s3277 s3278 s3279 s3280 s3281 s3282 s3283 s3284 s3285 s3286 s3287 s3288 s3289 s3290 s329...], 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 2463 reset in 475 ms.
Product exploration explored 100000 steps with 2460 reset in 466 ms.
Computed a total of 3668 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3668 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 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 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3842 steps, run visited all 1 properties in 18 ms. (steps per millisecond=213 )
Probabilistic random walk after 3842 steps, saw 3771 distinct states, run finished after 18 ms. (steps per millisecond=213 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 34 out of 3668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3668/3668 places, 503/503 transitions.
Applied a total of 0 rules in 266 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
// Phase 1: matrix 503 rows 3668 cols
[2023-03-15 21:43:15] [INFO ] Computed 3168 place invariants in 62 ms
[2023-03-15 21:43:20] [INFO ] Implicit Places using invariants in 5803 ms returned []
[2023-03-15 21:43:20] [INFO ] Invariant cache hit.
[2023-03-15 21:43:32] [INFO ] Implicit Places using invariants and state equation in 11095 ms returned []
Implicit Place search using SMT with State Equation took 16906 ms to find 0 implicit places.
[2023-03-15 21:43:32] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-15 21:43:32] [INFO ] Invariant cache hit.
[2023-03-15 21:43:33] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18563 ms. Remains : 3668/3668 places, 503/503 transitions.
Computed a total of 3668 stabilizing places and 503 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3668 transition count 503
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 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 51 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 246 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3842 steps, run visited all 1 properties in 14 ms. (steps per millisecond=274 )
Probabilistic random walk after 3842 steps, saw 3771 distinct states, run finished after 14 ms. (steps per millisecond=274 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 163 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2464 reset in 435 ms.
Product exploration explored 100000 steps with 2468 reset in 459 ms.
Support contains 34 out of 3668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3668/3668 places, 503/503 transitions.
Applied a total of 0 rules in 256 ms. Remains 3668 /3668 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2023-03-15 21:43:35] [INFO ] Invariant cache hit.
[2023-03-15 21:43:41] [INFO ] Implicit Places using invariants in 5844 ms returned []
[2023-03-15 21:43:41] [INFO ] Invariant cache hit.
[2023-03-15 21:43:52] [INFO ] Implicit Places using invariants and state equation in 10936 ms returned []
Implicit Place search using SMT with State Equation took 16784 ms to find 0 implicit places.
[2023-03-15 21:43:52] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-15 21:43:52] [INFO ] Invariant cache hit.
[2023-03-15 21:43:53] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18461 ms. Remains : 3668/3668 places, 503/503 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-05 finished in 57214 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))'
Support contains 1 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 1 are kept as prefixes of interest. Removing 3771 places using SCC suffix rule.10 ms
Discarding 3771 places :
Also discarding 505 output transitions
Drop transitions removed 505 transitions
Applied a total of 1 rules in 15 ms. Remains 1 /3772 variables (removed 3771) and now considering 1/506 (removed 505) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-15 21:43:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-15 21:43:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-15 21:43:54] [INFO ] Invariant cache hit.
[2023-03-15 21:43:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-15 21:43:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 21:43:54] [INFO ] Invariant cache hit.
[2023-03-15 21:43:54] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3772 places, 1/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 1/3772 places, 1/506 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-06 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 33 ms.
Product exploration explored 100000 steps with 50000 reset in 83 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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-06 finished in 395 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)||X(p1))))'
Support contains 1123 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 3737 transition count 506
Applied a total of 35 rules in 119 ms. Remains 3737 /3772 variables (removed 35) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3737 cols
[2023-03-15 21:43:54] [INFO ] Computed 3233 place invariants in 67 ms
[2023-03-15 21:43:59] [INFO ] Implicit Places using invariants in 4941 ms returned []
[2023-03-15 21:43:59] [INFO ] Invariant cache hit.
[2023-03-15 21:44:09] [INFO ] Implicit Places using invariants and state equation in 9750 ms returned [3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531, 3532]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14703 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3704/3772 places, 506/506 transitions.
Applied a total of 0 rules in 121 ms. Remains 3704 /3704 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14944 ms. Remains : 3704/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (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 s...], 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 50000 reset in 3138 ms.
Product exploration explored 100000 steps with 50000 reset in 3117 ms.
Computed a total of 3704 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3704 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-09 finished in 22099 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 33 out of 3772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Graph (complete) has 42347 edges and 3772 vertex of which 1425 are kept as prefixes of interest. Removing 2347 places using SCC suffix rule.11 ms
Discarding 2347 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 1424 transition count 306
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 103 place count 1422 transition count 304
Applied a total of 103 rules in 102 ms. Remains 1422 /3772 variables (removed 2350) and now considering 304/506 (removed 202) transitions.
// Phase 1: matrix 304 rows 1422 cols
[2023-03-15 21:44:16] [INFO ] Computed 1120 place invariants in 4 ms
[2023-03-15 21:44:17] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2023-03-15 21:44:17] [INFO ] Invariant cache hit.
[2023-03-15 21:44:19] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned [1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 3173 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1389/3772 places, 304/506 transitions.
Applied a total of 0 rules in 40 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3315 ms. Remains : 1389/3772 places, 304/506 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-32-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:(LEQ 3 (ADD s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s...], 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 2444 reset in 496 ms.
Product exploration explored 100000 steps with 2443 reset in 532 ms.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 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)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 46 ms. (steps per millisecond=142 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 46 ms. (steps per millisecond=142 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 186 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 41 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
// Phase 1: matrix 304 rows 1389 cols
[2023-03-15 21:44:21] [INFO ] Computed 1088 place invariants in 13 ms
[2023-03-15 21:44:23] [INFO ] Implicit Places using invariants in 1276 ms returned []
[2023-03-15 21:44:23] [INFO ] Invariant cache hit.
[2023-03-15 21:44:24] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-15 21:44:24] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-15 21:44:24] [INFO ] Invariant cache hit.
[2023-03-15 21:44:25] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3418 ms. Remains : 1389/1389 places, 304/304 transitions.
Computed a total of 1389 stabilizing places and 304 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1389 transition count 304
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 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 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6566 steps, run visited all 1 properties in 48 ms. (steps per millisecond=136 )
Probabilistic random walk after 6566 steps, saw 6404 distinct states, run finished after 48 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 140 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2441 reset in 497 ms.
Product exploration explored 100000 steps with 2440 reset in 528 ms.
Support contains 33 out of 1389 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1389/1389 places, 304/304 transitions.
Applied a total of 0 rules in 51 ms. Remains 1389 /1389 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2023-03-15 21:44:26] [INFO ] Invariant cache hit.
[2023-03-15 21:44:28] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2023-03-15 21:44:28] [INFO ] Invariant cache hit.
[2023-03-15 21:44:29] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
[2023-03-15 21:44:29] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 21:44:29] [INFO ] Invariant cache hit.
[2023-03-15 21:44:30] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3384 ms. Remains : 1389/1389 places, 304/304 transitions.
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-11 finished in 13878 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((X(G(p0))&&F(p1))) U (p2&&G((X(G(p0))&&F(p1)))))))'
Support contains 133 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 243 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-15 21:44:30] [INFO ] Computed 3232 place invariants in 64 ms
[2023-03-15 21:44:36] [INFO ] Implicit Places using invariants in 5707 ms returned []
[2023-03-15 21:44:36] [INFO ] Invariant cache hit.
[2023-03-15 21:44:46] [INFO ] Implicit Places using invariants and state equation in 10336 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16047 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16528 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 3 (ADD s3433 s3434 s3435 s3436 s3437 s3438 s3439 s3440 s3441 s3442 s3443 s3444 s3445 s3446 s3447 s3448 s3449 s3450 s3451 s3452 s3453 s3454 s3455 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][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-32-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-12 finished in 16792 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))'
Support contains 33 out of 3772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3772/3772 places, 506/506 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 3736 transition count 506
Applied a total of 36 rules in 252 ms. Remains 3736 /3772 variables (removed 36) and now considering 506/506 (removed 0) transitions.
[2023-03-15 21:44:47] [INFO ] Invariant cache hit.
[2023-03-15 21:44:53] [INFO ] Implicit Places using invariants in 5986 ms returned []
[2023-03-15 21:44:53] [INFO ] Invariant cache hit.
[2023-03-15 21:45:04] [INFO ] Implicit Places using invariants and state equation in 10864 ms returned [3499, 3500, 3501, 3502, 3503, 3504, 3505, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3513, 3514, 3515, 3516, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3525, 3526, 3527, 3528, 3529, 3530, 3531]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 16857 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3772 places, 506/506 transitions.
Applied a total of 0 rules in 237 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17347 ms. Remains : 3703/3772 places, 506/506 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-COL-32-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s3532 s3533 s3534 s3535 s3536 s3537 s3538 s3539 s3540 s3541 s3542 s3543 s3544 s3545 s3546 s3547 s3548 s3549 s3550 s3551 s3552 s3553 s3554 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1684 ms.
Product exploration explored 100000 steps with 50000 reset in 1729 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-32-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-32-LTLCardinality-14 finished in 21443 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)))'
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 21:45:08] [INFO ] Flatten gal took : 98 ms
[2023-03-15 21:45:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 21:45:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3772 places, 506 transitions and 8135 arcs took 9 ms.
Total runtime 214734 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-COL-32
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678916920498

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-COL-32-LTLCardinality-05
lola: time limit : 1800 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-32-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-COL-32-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 2/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 128790 m, 25758 m/sec, 862665 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 3/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 262203 m, 26682 m/sec, 1845739 t fired, .

Time elapsed: 10 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 4/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 386363 m, 24832 m/sec, 2846404 t fired, .

Time elapsed: 15 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 5/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 499565 m, 22640 m/sec, 3889260 t fired, .

Time elapsed: 20 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 6/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 628410 m, 25769 m/sec, 4872328 t fired, .

Time elapsed: 25 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 7/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 755862 m, 25490 m/sec, 5848527 t fired, .

Time elapsed: 30 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 8/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 883217 m, 25471 m/sec, 6823133 t fired, .

Time elapsed: 35 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1800 9/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 999606 m, 23277 m/sec, 7828995 t fired, .

Time elapsed: 40 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1800 10/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1107956 m, 21670 m/sec, 8874770 t fired, .

Time elapsed: 45 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1800 11/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1219548 m, 22318 m/sec, 9914164 t fired, .

Time elapsed: 50 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/1800 12/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1332812 m, 22652 m/sec, 10935501 t fired, .

Time elapsed: 55 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/1800 13/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1435235 m, 20484 m/sec, 11990759 t fired, .

Time elapsed: 60 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/1800 13/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1534562 m, 19865 m/sec, 13062612 t fired, .

Time elapsed: 65 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/1800 14/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1641383 m, 21364 m/sec, 14116258 t fired, .

Time elapsed: 70 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/1800 15/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1767083 m, 25140 m/sec, 15072356 t fired, .

Time elapsed: 75 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/1800 16/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 1902362 m, 27055 m/sec, 16006538 t fired, .

Time elapsed: 80 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/1800 17/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2016525 m, 22832 m/sec, 17001152 t fired, .

Time elapsed: 85 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/1800 18/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2121932 m, 21081 m/sec, 18024917 t fired, .

Time elapsed: 90 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/1800 19/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2256447 m, 26903 m/sec, 18959101 t fired, .

Time elapsed: 95 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/1800 20/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2385724 m, 25855 m/sec, 19913075 t fired, .

Time elapsed: 100 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/1800 21/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2507273 m, 24309 m/sec, 20893546 t fired, .

Time elapsed: 105 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/1800 22/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2617690 m, 22083 m/sec, 21898154 t fired, .

Time elapsed: 110 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/1800 23/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2726045 m, 21671 m/sec, 22916209 t fired, .

Time elapsed: 115 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/1800 23/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2831346 m, 21060 m/sec, 23943702 t fired, .

Time elapsed: 120 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/1800 24/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 2946297 m, 22990 m/sec, 24940962 t fired, .

Time elapsed: 125 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/1800 25/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3047111 m, 20162 m/sec, 25989808 t fired, .

Time elapsed: 130 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/1800 26/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3142395 m, 19056 m/sec, 27043966 t fired, .

Time elapsed: 135 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/1800 27/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3242823 m, 20085 m/sec, 28103159 t fired, .

Time elapsed: 140 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/1800 28/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3351484 m, 21732 m/sec, 29124278 t fired, .

Time elapsed: 145 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/1800 29/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3462907 m, 22284 m/sec, 30114317 t fired, .

Time elapsed: 150 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/1800 30/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3563797 m, 20178 m/sec, 31162243 t fired, .

Time elapsed: 155 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/1800 30/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3662211 m, 19682 m/sec, 32226958 t fired, .

Time elapsed: 160 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/1800 31/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3760869 m, 19731 m/sec, 33289779 t fired, .

Time elapsed: 165 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/1800 32/32 QuasiCertifProtocol-COL-32-LTLCardinality-05 3870039 m, 21834 m/sec, 34295078 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for QuasiCertifProtocol-COL-32-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-COL-32-LTLCardinality-11
lola: time limit : 3425 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-32-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-COL-32-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3425 6/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 524583 m, 104916 m/sec, 1182672 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3425 11/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 1054106 m, 105904 m/sec, 2380622 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3425 16/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 1558605 m, 100899 m/sec, 3533397 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3425 21/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 2060657 m, 100410 m/sec, 4690518 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3425 25/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 2537631 m, 95394 m/sec, 5828937 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3425 30/32 QuasiCertifProtocol-COL-32-LTLCardinality-11 3010286 m, 94531 m/sec, 6942457 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for QuasiCertifProtocol-COL-32-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-COL-32-LTLCardinality-05: LTL unknown AGGR
QuasiCertifProtocol-COL-32-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 210 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-32"
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-32, 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-167873948500851"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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