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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 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 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K 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-PT-22-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678918621010

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-PT-22
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 22:17:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 22:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:17:02] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-15 22:17:02] [INFO ] Transformed 1966 places.
[2023-03-15 22:17:02] [INFO ] Transformed 356 transitions.
[2023-03-15 22:17:02] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 723 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1941 transition count 356
Applied a total of 25 rules in 134 ms. Remains 1941 /1966 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1941 cols
[2023-03-15 22:17:03] [INFO ] Computed 1586 place invariants in 66 ms
[2023-03-15 22:17:04] [INFO ] Implicit Places using invariants in 1746 ms returned []
[2023-03-15 22:17:04] [INFO ] Invariant cache hit.
[2023-03-15 22:17:08] [INFO ] Implicit Places using invariants and state equation in 4154 ms returned []
Implicit Place search using SMT with State Equation took 6052 ms to find 0 implicit places.
[2023-03-15 22:17:08] [INFO ] Invariant cache hit.
[2023-03-15 22:17:09] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1941/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6896 ms. Remains : 1941/1966 places, 356/356 transitions.
Support contains 723 out of 1941 places after structural reductions.
[2023-03-15 22:17:09] [INFO ] Flatten gal took : 139 ms
[2023-03-15 22:17:10] [INFO ] Flatten gal took : 75 ms
[2023-03-15 22:17:10] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 371 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-15 22:17:10] [INFO ] Invariant cache hit.
[2023-03-15 22:17:11] [INFO ] [Real]Absence check using 0 positive and 1586 generalized place invariants in 306 ms returned sat
[2023-03-15 22:17:11] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-15 22:17:12] [INFO ] [Nat]Absence check using 0 positive and 1586 generalized place invariants in 307 ms returned sat
[2023-03-15 22:17:36] [INFO ] After 23615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-15 22:17:36] [INFO ] After 23622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 22:17:36] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 14 properties in 36 ms.
Support contains 1 out of 1941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 4 are kept as prefixes of interest. Removing 1937 places using SCC suffix rule.6 ms
Discarding 1937 places :
Also discarding 193 output transitions
Drop transitions removed 193 transitions
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 161 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 163 place count 3 transition count 2
Applied a total of 163 rules in 16 ms. Remains 3 /1941 variables (removed 1938) and now considering 2/356 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 3/1941 places, 2/356 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2500 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 3 states, properties seen :0
Probabilistic random walk after 5 steps, saw 3 distinct states, run finished after 5 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 3 states, properties seen :0
Exhaustive walk after 5 steps, saw 3 distinct states, run finished after 1 ms. (steps per millisecond=5 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1941 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1941 transition count 356
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(G(p0)))'
Support contains 46 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1916 transition count 356
Applied a total of 25 rules in 150 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 22:17:37] [INFO ] Computed 1562 place invariants in 36 ms
[2023-03-15 22:17:39] [INFO ] Implicit Places using invariants in 2080 ms returned []
[2023-03-15 22:17:39] [INFO ] Invariant cache hit.
[2023-03-15 22:17:43] [INFO ] Implicit Places using invariants and state equation in 4361 ms returned []
Implicit Place search using SMT with State Equation took 6445 ms to find 0 implicit places.
[2023-03-15 22:17:43] [INFO ] Invariant cache hit.
[2023-03-15 22:17:44] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7243 ms. Remains : 1916/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02 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 (ADD s1155 s1156 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 s1181 s1183 s1184 s1185 s1186) (AD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3712 reset in 512 ms.
Product exploration explored 100000 steps with 3719 reset in 449 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished Best-First random walk after 4751 steps, including 7 resets, run visited all 1 properties in 10 ms. (steps per millisecond=475 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-15 22:17:46] [INFO ] Invariant cache hit.
[2023-03-15 22:17:48] [INFO ] Implicit Places using invariants in 2075 ms returned []
[2023-03-15 22:17:48] [INFO ] Invariant cache hit.
[2023-03-15 22:17:52] [INFO ] Implicit Places using invariants and state equation in 3445 ms returned []
Implicit Place search using SMT with State Equation took 5532 ms to find 0 implicit places.
[2023-03-15 22:17:52] [INFO ] Invariant cache hit.
[2023-03-15 22:17:52] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6227 ms. Remains : 1916/1916 places, 356/356 transitions.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Finished Best-First random walk after 7684 steps, including 13 resets, run visited all 1 properties in 14 ms. (steps per millisecond=548 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3715 reset in 404 ms.
Product exploration explored 100000 steps with 3717 reset in 425 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.18 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1318 transition count 266
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 93 rules in 389 ms. Remains 1318 /1916 variables (removed 598) and now considering 266/356 (removed 90) transitions.
[2023-03-15 22:17:55] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 266 rows 1318 cols
[2023-03-15 22:17:55] [INFO ] Computed 1056 place invariants in 9 ms
[2023-03-15 22:17:55] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1318/1916 places, 266/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 1318/1916 places, 266/356 transitions.
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 238 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 22:17:56] [INFO ] Computed 1562 place invariants in 13 ms
[2023-03-15 22:17:58] [INFO ] Implicit Places using invariants in 2107 ms returned []
[2023-03-15 22:17:58] [INFO ] Invariant cache hit.
[2023-03-15 22:18:01] [INFO ] Implicit Places using invariants and state equation in 3534 ms returned []
Implicit Place search using SMT with State Equation took 5648 ms to find 0 implicit places.
[2023-03-15 22:18:01] [INFO ] Invariant cache hit.
[2023-03-15 22:18:02] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6506 ms. Remains : 1916/1916 places, 356/356 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 25396 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||G(p1)))))'
Support contains 47 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1939 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1938 transition count 355
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 1938 transition count 355
Applied a total of 4 rules in 335 ms. Remains 1938 /1941 variables (removed 3) and now considering 355/356 (removed 1) transitions.
// Phase 1: matrix 355 rows 1938 cols
[2023-03-15 22:18:02] [INFO ] Computed 1585 place invariants in 12 ms
[2023-03-15 22:18:04] [INFO ] Implicit Places using invariants in 2061 ms returned []
[2023-03-15 22:18:04] [INFO ] Invariant cache hit.
[2023-03-15 22:18:08] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned [1177, 1178, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1203, 1205, 1206, 1207, 1208]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5998 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1915/1941 places, 355/356 transitions.
Applied a total of 0 rules in 115 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6460 ms. Remains : 1915/1941 places, 355/356 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s649 s650 s729 s730 s731 s732 s733 s734 s735 s736 s737 s738 s739 s740 s741 s742 s743 s744 s753 s754 s755 s756 s757) s165), p0:(LEQ 2 (ADD s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3719 reset in 318 ms.
Product exploration explored 100000 steps with 3710 reset in 308 ms.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 370 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 355 rows 1915 cols
[2023-03-15 22:18:10] [INFO ] Computed 1562 place invariants in 18 ms
[2023-03-15 22:18:10] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:11] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 269 ms returned sat
[2023-03-15 22:18:12] [INFO ] After 1247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:17] [INFO ] After 6152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-15 22:18:17] [INFO ] After 6776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 86 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-15 22:18:17] [INFO ] Invariant cache hit.
[2023-03-15 22:18:19] [INFO ] Implicit Places using invariants in 1790 ms returned []
[2023-03-15 22:18:19] [INFO ] Invariant cache hit.
[2023-03-15 22:18:23] [INFO ] Implicit Places using invariants and state equation in 3567 ms returned []
Implicit Place search using SMT with State Equation took 5360 ms to find 0 implicit places.
[2023-03-15 22:18:23] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 22:18:23] [INFO ] Invariant cache hit.
[2023-03-15 22:18:24] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6097 ms. Remains : 1915/1915 places, 355/355 transitions.
Computed a total of 1915 stabilizing places and 355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1915 transition count 355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:24] [INFO ] Invariant cache hit.
[2023-03-15 22:18:24] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:25] [INFO ] [Nat]Absence check using 0 positive and 1562 generalized place invariants in 278 ms returned sat
[2023-03-15 22:18:26] [INFO ] After 1242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:31] [INFO ] After 6143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-15 22:18:31] [INFO ] After 6797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3713 reset in 267 ms.
Product exploration explored 100000 steps with 3711 reset in 289 ms.
Support contains 47 out of 1915 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1915/1915 places, 355/355 transitions.
Applied a total of 0 rules in 78 ms. Remains 1915 /1915 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2023-03-15 22:18:32] [INFO ] Invariant cache hit.
[2023-03-15 22:18:34] [INFO ] Implicit Places using invariants in 1857 ms returned []
[2023-03-15 22:18:34] [INFO ] Invariant cache hit.
[2023-03-15 22:18:38] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 5419 ms to find 0 implicit places.
[2023-03-15 22:18:38] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 22:18:38] [INFO ] Invariant cache hit.
[2023-03-15 22:18:38] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6134 ms. Remains : 1915/1915 places, 355/355 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-03 finished in 36422 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)&&(p1 U X((X(G(p2)) U G(p3))))))'
Support contains 71 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1917 transition count 356
Applied a total of 24 rules in 77 ms. Remains 1917 /1941 variables (removed 24) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-15 22:18:39] [INFO ] Computed 1563 place invariants in 43 ms
[2023-03-15 22:18:41] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-15 22:18:41] [INFO ] Invariant cache hit.
[2023-03-15 22:18:44] [INFO ] Implicit Places using invariants and state equation in 3644 ms returned []
Implicit Place search using SMT with State Equation took 5650 ms to find 0 implicit places.
[2023-03-15 22:18:44] [INFO ] Invariant cache hit.
[2023-03-15 22:18:45] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6394 ms. Remains : 1917/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p3) (NOT p2)), true, (AND (NOT p3) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=p3, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s23), p1:(GT s1892 (ADD s1805 s1806 s1807 s1812 s1813 s1814 s1815 s1816 s1817 s1818 s1819 s1820 s1821 s1822 s1823 s1824 s1825 s1826 s1827 s1828 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 81 steps with 4 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-04 finished in 6740 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 552 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1916 transition count 356
Applied a total of 25 rules in 34 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2023-03-15 22:18:45] [INFO ] Computed 1562 place invariants in 43 ms
[2023-03-15 22:18:47] [INFO ] Implicit Places using invariants in 1626 ms returned []
[2023-03-15 22:18:47] [INFO ] Invariant cache hit.
[2023-03-15 22:18:50] [INFO ] Implicit Places using invariants and state equation in 3420 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 5050 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1941 places, 356/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5131 ms. Remains : 1893/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-06 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 (ADD s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892) (AD...], 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-PT-22-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-06 finished in 5227 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((p0||X((X(G(p1)) U (p0&&X(G(p1)))))))))'
Support contains 70 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1916 transition count 356
Applied a total of 25 rules in 67 ms. Remains 1916 /1941 variables (removed 25) and now considering 356/356 (removed 0) transitions.
[2023-03-15 22:18:51] [INFO ] Invariant cache hit.
[2023-03-15 22:18:52] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2023-03-15 22:18:52] [INFO ] Invariant cache hit.
[2023-03-15 22:18:56] [INFO ] Implicit Places using invariants and state equation in 4051 ms returned []
Implicit Place search using SMT with State Equation took 5956 ms to find 0 implicit places.
[2023-03-15 22:18:56] [INFO ] Invariant cache hit.
[2023-03-15 22:18:57] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1916/1941 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6705 ms. Remains : 1916/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s71 s72 s73) (ADD s1155 s1156 s1163 s1164 s1165 s1166 s1167 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]]
Product exploration explored 100000 steps with 33333 reset in 926 ms.
Product exploration explored 100000 steps with 33333 reset in 899 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
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)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 9103 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.8 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 93 place count 1316 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 167 ms. Remains 1316 /1941 variables (removed 625) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2023-03-15 22:19:00] [INFO ] Computed 1056 place invariants in 18 ms
[2023-03-15 22:19:01] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-15 22:19:01] [INFO ] Invariant cache hit.
[2023-03-15 22:19:03] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3358 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1270/1941 places, 262/356 transitions.
Applied a total of 0 rules in 43 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3569 ms. Remains : 1270/1941 places, 262/356 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09 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 s1212 s10)], 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 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 3613 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(p1))))'
Support contains 4 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.5 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 93 place count 1316 transition count 262
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1316 transition count 262
Applied a total of 94 rules in 163 ms. Remains 1316 /1941 variables (removed 625) and now considering 262/356 (removed 94) transitions.
[2023-03-15 22:19:03] [INFO ] Invariant cache hit.
[2023-03-15 22:19:05] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-15 22:19:05] [INFO ] Invariant cache hit.
[2023-03-15 22:19:07] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 45 places :
Implicit Place search using SMT with State Equation took 3359 ms to find 45 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1941 places, 262/356 transitions.
Applied a total of 0 rules in 45 ms. Remains 1271 /1271 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3567 ms. Remains : 1271/1941 places, 262/356 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { 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={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s191 s585), p1:(LEQ s1224 s58)], 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]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 3673 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) U p1)))'
Support contains 4 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1917 transition count 356
Applied a total of 24 rules in 64 ms. Remains 1917 /1941 variables (removed 24) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2023-03-15 22:19:07] [INFO ] Computed 1563 place invariants in 35 ms
[2023-03-15 22:19:09] [INFO ] Implicit Places using invariants in 2135 ms returned []
[2023-03-15 22:19:09] [INFO ] Invariant cache hit.
[2023-03-15 22:19:13] [INFO ] Implicit Places using invariants and state equation in 4161 ms returned [1156, 1157, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1182, 1184, 1185, 1186, 1187]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6302 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1894/1941 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1894 /1894 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6430 ms. Remains : 1894/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s23 s459), p0:(LEQ s1820 s1802)], nbAcceptance=1, 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]]
Product exploration explored 100000 steps with 50000 reset in 1148 ms.
Product exploration explored 100000 steps with 50000 reset in 1152 ms.
Computed a total of 1894 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1894 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 8 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 9364 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.5 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1318 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1318 transition count 265
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 91 place count 1317 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1317 transition count 264
Applied a total of 92 rules in 167 ms. Remains 1317 /1941 variables (removed 624) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1317 cols
[2023-03-15 22:19:16] [INFO ] Computed 1056 place invariants in 12 ms
[2023-03-15 22:19:18] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2023-03-15 22:19:18] [INFO ] Invariant cache hit.
[2023-03-15 22:19:20] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3200 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1941 places, 264/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3413 ms. Remains : 1271/1941 places, 264/356 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-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:(OR (LEQ s2 s112) (LEQ 1 s112))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3471 reset in 273 ms.
Product exploration explored 100000 steps with 3468 reset in 275 ms.
Computed a total of 1271 stabilizing places and 264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1271 transition count 264
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-13 finished in 4353 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 1941 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1387 are kept as prefixes of interest. Removing 554 places using SCC suffix rule.8 ms
Discarding 554 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1341 transition count 265
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1341 transition count 265
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 95 place count 1339 transition count 263
Applied a total of 95 rules in 125 ms. Remains 1339 /1941 variables (removed 602) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1339 cols
[2023-03-15 22:19:21] [INFO ] Computed 1078 place invariants in 12 ms
[2023-03-15 22:19:22] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2023-03-15 22:19:22] [INFO ] Invariant cache hit.
[2023-03-15 22:19:24] [INFO ] Implicit Places using invariants and state equation in 2190 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3406 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1941 places, 263/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1293 /1293 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3579 ms. Remains : 1293/1941 places, 263/356 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-14 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 s1275)], 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 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-14 finished in 3630 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 2 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1918 transition count 356
Applied a total of 23 rules in 67 ms. Remains 1918 /1941 variables (removed 23) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1918 cols
[2023-03-15 22:19:24] [INFO ] Computed 1563 place invariants in 35 ms
[2023-03-15 22:19:26] [INFO ] Implicit Places using invariants in 2141 ms returned []
[2023-03-15 22:19:26] [INFO ] Invariant cache hit.
[2023-03-15 22:19:31] [INFO ] Implicit Places using invariants and state equation in 4212 ms returned [1157, 1158, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1183, 1185, 1186, 1187, 1188]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6357 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1895/1941 places, 356/356 transitions.
Applied a total of 0 rules in 62 ms. Remains 1895 /1895 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6486 ms. Remains : 1895/1941 places, 356/356 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s159 s23)], 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 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-15 finished in 6583 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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-22-LTLCardinality-02
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1941 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1941/1941 places, 356/356 transitions.
Graph (complete) has 15858 edges and 1941 vertex of which 1363 are kept as prefixes of interest. Removing 578 places using SCC suffix rule.5 ms
Discarding 578 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 95 place count 1315 transition count 261
Applied a total of 95 rules in 121 ms. Remains 1315 /1941 variables (removed 626) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1315 cols
[2023-03-15 22:19:31] [INFO ] Computed 1056 place invariants in 15 ms
[2023-03-15 22:19:32] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2023-03-15 22:19:32] [INFO ] Invariant cache hit.
[2023-03-15 22:19:34] [INFO ] Implicit Places using invariants and state equation in 2145 ms returned [1274, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 3230 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1292/1941 places, 261/356 transitions.
Applied a total of 0 rules in 43 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3396 ms. Remains : 1292/1941 places, 261/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02 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 (ADD s578 s579 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s604 s606 s607 s608 s609) (ADD s1254 s1255 s1256 s12...], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3472 reset in 434 ms.
Product exploration explored 100000 steps with 3470 reset in 464 ms.
Computed a total of 1292 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1292 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 851 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=425 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 34 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 1292 cols
[2023-03-15 22:19:36] [INFO ] Computed 1034 place invariants in 10 ms
[2023-03-15 22:19:37] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2023-03-15 22:19:37] [INFO ] Invariant cache hit.
[2023-03-15 22:19:39] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 3037 ms to find 0 implicit places.
[2023-03-15 22:19:39] [INFO ] Invariant cache hit.
[2023-03-15 22:19:40] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3465 ms. Remains : 1292/1292 places, 261/261 transitions.
Computed a total of 1292 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1292 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 347 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 851 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=425 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3471 reset in 444 ms.
Product exploration explored 100000 steps with 3465 reset in 466 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 50 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-15 22:19:42] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 22:19:42] [INFO ] Invariant cache hit.
[2023-03-15 22:19:42] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 1292/1292 places, 261/261 transitions.
Support contains 46 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 261/261 transitions.
Applied a total of 0 rules in 28 ms. Remains 1292 /1292 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-15 22:19:42] [INFO ] Invariant cache hit.
[2023-03-15 22:19:43] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-15 22:19:43] [INFO ] Invariant cache hit.
[2023-03-15 22:19:45] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
[2023-03-15 22:19:45] [INFO ] Invariant cache hit.
[2023-03-15 22:19:45] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3340 ms. Remains : 1292/1292 places, 261/261 transitions.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 14510 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||G(p1)))))'
[2023-03-15 22:19:45] [INFO ] Flatten gal took : 56 ms
[2023-03-15 22:19:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-15 22:19:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1941 places, 356 transitions and 4161 arcs took 8 ms.
Total runtime 163566 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-22
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1678918897483

--------------------
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: LAUNCH task # 6 (type SKEL/SRCH) for 0 QuasiCertifProtocol-PT-22-LTLCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 6 (type SKEL/SRCH) for QuasiCertifProtocol-PT-22-LTLCardinality-02
lola: result : false
lola: markings : 2770
lola: fired transitions : 8569
lola: time used : 0.000000
lola: memory pages used : 1
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-22-LTLCardinality-03
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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 4/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 316831 m, 63366 m/sec, 1933308 t fired, .

Time elapsed: 5 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 7/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 568972 m, 50428 m/sec, 3721845 t fired, .

Time elapsed: 10 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 11/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 861665 m, 58538 m/sec, 5664454 t fired, .

Time elapsed: 15 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 13/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 1113834 m, 50433 m/sec, 7462185 t fired, .

Time elapsed: 20 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 17/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 1390547 m, 55342 m/sec, 9378904 t fired, .

Time elapsed: 25 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 20/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 1647870 m, 51464 m/sec, 11220823 t fired, .

Time elapsed: 30 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 23/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 1909809 m, 52387 m/sec, 13117625 t fired, .

Time elapsed: 35 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 26/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 2163446 m, 50727 m/sec, 14944150 t fired, .

Time elapsed: 40 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 29/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 2422477 m, 51806 m/sec, 16825701 t fired, .

Time elapsed: 45 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-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 31/32 QuasiCertifProtocol-PT-22-LTLCardinality-03 2674930 m, 50490 m/sec, 18648465 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-22-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-22-LTLCardinality-02
lola: time limit : 3545 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3545 4/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 331941 m, 66388 m/sec, 2177915 t fired, .

Time elapsed: 60 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3545 7/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 590762 m, 51764 m/sec, 4214436 t fired, .

Time elapsed: 65 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3545 11/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 878492 m, 57546 m/sec, 6311971 t fired, .

Time elapsed: 70 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3545 14/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 1148302 m, 53962 m/sec, 8355660 t fired, .

Time elapsed: 75 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3545 17/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 1424842 m, 55308 m/sec, 10453238 t fired, .

Time elapsed: 80 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3545 20/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 1697742 m, 54580 m/sec, 12515104 t fired, .

Time elapsed: 85 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3545 23/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 1965004 m, 53452 m/sec, 14564823 t fired, .

Time elapsed: 90 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3545 26/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 2230970 m, 53193 m/sec, 16604737 t fired, .

Time elapsed: 95 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3545 30/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 2502211 m, 54248 m/sec, 18652613 t fired, .

Time elapsed: 100 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-PT-22-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3545 32/32 QuasiCertifProtocol-PT-22-LTLCardinality-02 2742618 m, 48081 m/sec, 20671192 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
QuasiCertifProtocol-PT-22-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 110 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-PT-22-LTLCardinality-02: LTL unknown AGGR
QuasiCertifProtocol-PT-22-LTLCardinality-03: LTL unknown AGGR


Time elapsed: 110 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-PT-22"
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-PT-22, 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-167873948500891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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