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.r297-tall-167873951000827.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 ltsminxred
Input is QuasiCertifProtocol-COL-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679657657346

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-18
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 11:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 11:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 11:34:19] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 11:34:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 11:34:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2023-03-24 11:34:19] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 11:34:20] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 11:34:20] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10004 steps, including 373 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 11:34:21] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-24 11:34:21] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-24 11:34:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 11:34:21] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-24 11:34:21] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-24 11:34:21] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 6 different solutions.
Finished Parikh walk after 109 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 9 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-03-24 11:34:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-24 11:34:21] [INFO ] Flatten gal took : 23 ms
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 11:34:21] [INFO ] Flatten gal took : 7 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2023-03-24 11:34:21] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 22 ms.
[2023-03-24 11:34:21] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 844 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1377 transition count 296
Applied a total of 21 rules in 54 ms. Remains 1377 /1398 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1377 cols
[2023-03-24 11:34:21] [INFO ] Computed 1082 place invariants in 47 ms
[2023-03-24 11:34:22] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-24 11:34:22] [INFO ] Invariant cache hit.
[2023-03-24 11:34:24] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned [1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2619 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1358/1398 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1358 /1358 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2690 ms. Remains : 1358/1398 places, 296/296 transitions.
Support contains 844 out of 1358 places after structural reductions.
[2023-03-24 11:34:24] [INFO ] Flatten gal took : 96 ms
[2023-03-24 11:34:24] [INFO ] Flatten gal took : 91 ms
[2023-03-24 11:34:24] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 825 out of 1358 places (down from 844) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 441 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 296 rows 1358 cols
[2023-03-24 11:34:25] [INFO ] Computed 1063 place invariants in 54 ms
[2023-03-24 11:34:26] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-24 11:34:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-24 11:34:26] [INFO ] [Nat]Absence check using 1 positive and 1062 generalized place invariants in 281 ms returned sat
[2023-03-24 11:34:34] [INFO ] After 7757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-24 11:34:40] [INFO ] After 13616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6121 ms.
[2023-03-24 11:34:46] [INFO ] After 20595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 141 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Parikh walk visited 8 properties in 19 ms.
Computed a total of 1358 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1358 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Support contains 400 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1356 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1355 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1355 transition count 294
Applied a total of 5 rules in 232 ms. Remains 1355 /1358 variables (removed 3) and now considering 294/296 (removed 2) transitions.
// Phase 1: matrix 294 rows 1355 cols
[2023-03-24 11:34:47] [INFO ] Computed 1062 place invariants in 71 ms
[2023-03-24 11:34:48] [INFO ] Implicit Places using invariants in 1240 ms returned []
[2023-03-24 11:34:48] [INFO ] Invariant cache hit.
[2023-03-24 11:34:50] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned [1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3197 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1358 places, 294/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3477 ms. Remains : 1336/1358 places, 294/296 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 (ADD s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1252 s1253 s1254 s1255)) (LEQ 1 s1)), p2:(AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6239 reset in 1997 ms.
Product exploration explored 100000 steps with 6269 reset in 1928 ms.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 420 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 1336 cols
[2023-03-24 11:34:55] [INFO ] Computed 1044 place invariants in 106 ms
[2023-03-24 11:34:55] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:34:56] [INFO ] Invariant cache hit.
[2023-03-24 11:34:57] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 957 ms returned sat
[2023-03-24 11:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:35:00] [INFO ] [Real]Absence check using state equation in 2902 ms returned sat
[2023-03-24 11:35:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:35:02] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1065 ms returned sat
[2023-03-24 11:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:35:05] [INFO ] [Nat]Absence check using state equation in 3512 ms returned sat
[2023-03-24 11:35:05] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 31 ms.
[2023-03-24 11:35:06] [INFO ] Added : 15 causal constraints over 3 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 54 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-24 11:35:06] [INFO ] Invariant cache hit.
[2023-03-24 11:35:07] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2023-03-24 11:35:07] [INFO ] Invariant cache hit.
[2023-03-24 11:35:09] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
[2023-03-24 11:35:09] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-24 11:35:09] [INFO ] Invariant cache hit.
[2023-03-24 11:35:09] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3596 ms. Remains : 1336/1336 places, 294/294 transitions.
Computed a total of 1336 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1336 transition count 294
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:35:10] [INFO ] Invariant cache hit.
[2023-03-24 11:35:12] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 974 ms returned sat
[2023-03-24 11:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:35:15] [INFO ] [Real]Absence check using state equation in 3076 ms returned sat
[2023-03-24 11:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:35:16] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1014 ms returned sat
[2023-03-24 11:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:35:20] [INFO ] [Nat]Absence check using state equation in 3436 ms returned sat
[2023-03-24 11:35:20] [INFO ] Computed and/alt/rep : 193/232/193 causal constraints (skipped 62 transitions) in 18 ms.
[2023-03-24 11:35:20] [INFO ] Added : 15 causal constraints over 3 iterations in 241 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 6264 reset in 850 ms.
Product exploration explored 100000 steps with 6234 reset in 858 ms.
Support contains 400 out of 1336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1336/1336 places, 294/294 transitions.
Applied a total of 0 rules in 42 ms. Remains 1336 /1336 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-24 11:35:22] [INFO ] Invariant cache hit.
[2023-03-24 11:35:23] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2023-03-24 11:35:23] [INFO ] Invariant cache hit.
[2023-03-24 11:35:25] [INFO ] Implicit Places using invariants and state equation in 1933 ms returned []
Implicit Place search using SMT with State Equation took 3145 ms to find 0 implicit places.
[2023-03-24 11:35:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-24 11:35:25] [INFO ] Invariant cache hit.
[2023-03-24 11:35:25] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3700 ms. Remains : 1336/1336 places, 294/294 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-00 finished in 39034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Support contains 382 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 559 are kept as prefixes of interest. Removing 799 places using SCC suffix rule.3 ms
Discarding 799 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 559 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 559 transition count 183
Applied a total of 58 rules in 51 ms. Remains 559 /1358 variables (removed 799) and now considering 183/296 (removed 113) transitions.
// Phase 1: matrix 183 rows 559 cols
[2023-03-24 11:35:26] [INFO ] Computed 378 place invariants in 11 ms
[2023-03-24 11:35:26] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-24 11:35:26] [INFO ] Invariant cache hit.
[2023-03-24 11:35:26] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-24 11:35:26] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-24 11:35:26] [INFO ] Invariant cache hit.
[2023-03-24 11:35:26] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1358 places, 183/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 887 ms. Remains : 559/1358 places, 183/296 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10651 reset in 714 ms.
Product exploration explored 100000 steps with 10589 reset in 721 ms.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 11:35:29] [INFO ] Invariant cache hit.
[2023-03-24 11:35:29] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 63 ms returned sat
[2023-03-24 11:35:29] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 11:35:29] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 61 ms returned sat
[2023-03-24 11:35:32] [INFO ] After 2135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 11:35:33] [INFO ] After 3243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1372 ms.
[2023-03-24 11:35:34] [INFO ] After 4779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 9 factoid took 535 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-24 11:35:35] [INFO ] Invariant cache hit.
[2023-03-24 11:35:35] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-24 11:35:35] [INFO ] Invariant cache hit.
[2023-03-24 11:35:35] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-24 11:35:35] [INFO ] Invariant cache hit.
[2023-03-24 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 559/559 places, 183/183 transitions.
Computed a total of 559 stabilizing places and 183 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 559 transition count 183
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 495 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 390 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 11:35:37] [INFO ] Invariant cache hit.
[2023-03-24 11:35:37] [INFO ] [Real]Absence check using 0 positive and 378 generalized place invariants in 62 ms returned sat
[2023-03-24 11:35:37] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 11:35:37] [INFO ] [Nat]Absence check using 0 positive and 378 generalized place invariants in 61 ms returned sat
[2023-03-24 11:35:40] [INFO ] After 2780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 11:35:40] [INFO ] After 3330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 852 ms.
[2023-03-24 11:35:41] [INFO ] After 4347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10625 reset in 629 ms.
Product exploration explored 100000 steps with 10623 reset in 650 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 22 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-24 11:35:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-24 11:35:44] [INFO ] Invariant cache hit.
[2023-03-24 11:35:44] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 559/559 places, 183/183 transitions.
Support contains 382 out of 559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 559/559 places, 183/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 559 /559 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2023-03-24 11:35:44] [INFO ] Invariant cache hit.
[2023-03-24 11:35:44] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-24 11:35:44] [INFO ] Invariant cache hit.
[2023-03-24 11:35:44] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-24 11:35:44] [INFO ] Invariant cache hit.
[2023-03-24 11:35:45] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 559/559 places, 183/183 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-01 finished in 19071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(!p0)))'
Support contains 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 40 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-24 11:35:45] [INFO ] Computed 1044 place invariants in 81 ms
[2023-03-24 11:35:46] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-24 11:35:46] [INFO ] Invariant cache hit.
[2023-03-24 11:35:49] [INFO ] Implicit Places using invariants and state equation in 2585 ms returned []
Implicit Place search using SMT with State Equation took 4084 ms to find 0 implicit places.
[2023-03-24 11:35:49] [INFO ] Invariant cache hit.
[2023-03-24 11:35:49] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4615 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102) s1336)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-02 finished in 4766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&F(G(!p0))))'
Support contains 40 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1336 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.11 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1335 transition count 293
Applied a total of 3 rules in 118 ms. Remains 1335 /1358 variables (removed 23) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1335 cols
[2023-03-24 11:35:50] [INFO ] Computed 1044 place invariants in 27 ms
[2023-03-24 11:35:51] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2023-03-24 11:35:51] [INFO ] Invariant cache hit.
[2023-03-24 11:35:54] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3972 ms to find 0 implicit places.
[2023-03-24 11:35:54] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-24 11:35:54] [INFO ] Invariant cache hit.
[2023-03-24 11:35:54] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4600 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334) (ADD s1293 s1294 s1295 s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-04 finished in 4721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(!p0))))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1 are kept as prefixes of interest. Removing 1357 places using SCC suffix rule.4 ms
Discarding 1357 places :
Also discarding 295 output transitions
Drop transitions removed 295 transitions
Applied a total of 1 rules in 7 ms. Remains 1 /1358 variables (removed 1357) and now considering 1/296 (removed 295) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-24 11:35:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-24 11:35:54] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-24 11:35:54] [INFO ] Invariant cache hit.
[2023-03-24 11:35:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-24 11:35:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-24 11:35:54] [INFO ] Invariant cache hit.
[2023-03-24 11:35:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/1358 places, 1/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 1/1358 places, 1/296 transitions.
Stuttering acceptance computed with spot in 124 ms :[false, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-05 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(!p0))&&F(p1))))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 39 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-24 11:35:55] [INFO ] Computed 1044 place invariants in 81 ms
[2023-03-24 11:35:56] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2023-03-24 11:35:56] [INFO ] Invariant cache hit.
[2023-03-24 11:35:59] [INFO ] Implicit Places using invariants and state equation in 2548 ms returned []
Implicit Place search using SMT with State Equation took 4076 ms to find 0 implicit places.
[2023-03-24 11:35:59] [INFO ] Invariant cache hit.
[2023-03-24 11:35:59] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4588 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, true, true, true, true, p0, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 2 (ADD s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102)), p1:(LEQ s1335 (ADD s13...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-06 finished in 4860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 19 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 178 are kept as prefixes of interest. Removing 1180 places using SCC suffix rule.4 ms
Discarding 1180 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 175 transition count 123
Applied a total of 80 rules in 15 ms. Remains 175 /1358 variables (removed 1183) and now considering 123/296 (removed 173) transitions.
// Phase 1: matrix 123 rows 175 cols
[2023-03-24 11:36:00] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-24 11:36:00] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-24 11:36:00] [INFO ] Invariant cache hit.
[2023-03-24 11:36:00] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 261 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/1358 places, 123/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 156/1358 places, 123/296 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-07 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(X(!p2)&&p1)))))'
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1356 transition count 296
Applied a total of 2 rules in 45 ms. Remains 1356 /1358 variables (removed 2) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2023-03-24 11:36:00] [INFO ] Computed 1062 place invariants in 6 ms
[2023-03-24 11:36:01] [INFO ] Implicit Places using invariants in 1459 ms returned []
[2023-03-24 11:36:01] [INFO ] Invariant cache hit.
[2023-03-24 11:36:04] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned []
Implicit Place search using SMT with State Equation took 4003 ms to find 0 implicit places.
[2023-03-24 11:36:04] [INFO ] Invariant cache hit.
[2023-03-24 11:36:04] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4547 ms. Remains : 1356/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s1354 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4416 reset in 676 ms.
Product exploration explored 100000 steps with 4423 reset in 621 ms.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 983 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 442 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-24 11:36:08] [INFO ] Invariant cache hit.
[2023-03-24 11:36:08] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 213 ms returned sat
[2023-03-24 11:36:08] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-24 11:36:09] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 193 ms returned sat
[2023-03-24 11:36:10] [INFO ] After 1804ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 1040 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:36:11] [INFO ] Invariant cache hit.
[2023-03-24 11:36:12] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 747 ms returned sat
[2023-03-24 11:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:15] [INFO ] [Real]Absence check using state equation in 2805 ms returned sat
[2023-03-24 11:36:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:36:16] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 748 ms returned sat
[2023-03-24 11:36:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:19] [INFO ] [Nat]Absence check using state equation in 3218 ms returned sat
[2023-03-24 11:36:20] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 25 ms.
[2023-03-24 11:36:20] [INFO ] Added : 0 causal constraints over 0 iterations in 129 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1356 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1355 transition count 295
Applied a total of 3 rules in 143 ms. Remains 1355 /1356 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-24 11:36:20] [INFO ] Computed 1062 place invariants in 12 ms
[2023-03-24 11:36:21] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2023-03-24 11:36:21] [INFO ] Invariant cache hit.
[2023-03-24 11:36:23] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 3743 ms to find 0 implicit places.
[2023-03-24 11:36:24] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-24 11:36:24] [INFO ] Invariant cache hit.
[2023-03-24 11:36:24] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1355/1356 places, 295/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4397 ms. Remains : 1355/1356 places, 295/296 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:36:25] [INFO ] Invariant cache hit.
[2023-03-24 11:36:26] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 727 ms returned sat
[2023-03-24 11:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:28] [INFO ] [Real]Absence check using state equation in 2320 ms returned sat
[2023-03-24 11:36:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:36:29] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 758 ms returned sat
[2023-03-24 11:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:32] [INFO ] [Nat]Absence check using state equation in 2690 ms returned sat
[2023-03-24 11:36:32] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 24 ms.
[2023-03-24 11:36:32] [INFO ] Added : 0 causal constraints over 0 iterations in 113 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10876 reset in 440 ms.
Product exploration explored 100000 steps with 10790 reset in 453 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.2 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 7 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-24 11:36:33] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-24 11:36:33] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-24 11:36:33] [INFO ] Invariant cache hit.
[2023-03-24 11:36:33] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-24 11:36:33] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-24 11:36:33] [INFO ] Invariant cache hit.
[2023-03-24 11:36:33] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 177/1355 places, 125/295 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 33635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1337 transition count 296
Applied a total of 21 rules in 35 ms. Remains 1337 /1358 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1337 cols
[2023-03-24 11:36:34] [INFO ] Computed 1044 place invariants in 90 ms
[2023-03-24 11:36:35] [INFO ] Implicit Places using invariants in 1582 ms returned []
[2023-03-24 11:36:35] [INFO ] Invariant cache hit.
[2023-03-24 11:36:38] [INFO ] Implicit Places using invariants and state equation in 2535 ms returned []
Implicit Place search using SMT with State Equation took 4123 ms to find 0 implicit places.
[2023-03-24 11:36:38] [INFO ] Invariant cache hit.
[2023-03-24 11:36:38] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1337/1358 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4631 ms. Remains : 1337/1358 places, 296/296 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-10 finished in 4728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1317 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.5 ms
Discarding 41 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1314 transition count 291
Applied a total of 5 rules in 88 ms. Remains 1314 /1358 variables (removed 44) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1314 cols
[2023-03-24 11:36:38] [INFO ] Computed 1026 place invariants in 83 ms
[2023-03-24 11:36:40] [INFO ] Implicit Places using invariants in 1504 ms returned []
[2023-03-24 11:36:40] [INFO ] Invariant cache hit.
[2023-03-24 11:36:42] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3901 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1358 places, 291/296 transitions.
Applied a total of 0 rules in 45 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4034 ms. Remains : 1295/1358 places, 291/296 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4219 reset in 247 ms.
Product exploration explored 100000 steps with 4211 reset in 260 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 291 rows 1295 cols
[2023-03-24 11:36:44] [INFO ] Computed 1008 place invariants in 149 ms
[2023-03-24 11:36:45] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 895 ms returned sat
[2023-03-24 11:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:48] [INFO ] [Real]Absence check using state equation in 2948 ms returned sat
[2023-03-24 11:36:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:36:49] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 888 ms returned sat
[2023-03-24 11:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:36:53] [INFO ] [Nat]Absence check using state equation in 3548 ms returned sat
[2023-03-24 11:36:53] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 22 ms.
[2023-03-24 11:36:53] [INFO ] Added : 9 causal constraints over 2 iterations in 190 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 44 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-24 11:36:53] [INFO ] Invariant cache hit.
[2023-03-24 11:36:54] [INFO ] Implicit Places using invariants in 1400 ms returned []
[2023-03-24 11:36:54] [INFO ] Invariant cache hit.
[2023-03-24 11:36:57] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 3775 ms to find 0 implicit places.
[2023-03-24 11:36:57] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-24 11:36:57] [INFO ] Invariant cache hit.
[2023-03-24 11:36:57] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4366 ms. Remains : 1295/1295 places, 291/291 transitions.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-24 11:36:58] [INFO ] Invariant cache hit.
[2023-03-24 11:36:59] [INFO ] [Real]Absence check using 0 positive and 1008 generalized place invariants in 929 ms returned sat
[2023-03-24 11:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:02] [INFO ] [Real]Absence check using state equation in 3046 ms returned sat
[2023-03-24 11:37:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:37:04] [INFO ] [Nat]Absence check using 0 positive and 1008 generalized place invariants in 935 ms returned sat
[2023-03-24 11:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:10] [INFO ] [Nat]Absence check using state equation in 6341 ms returned sat
[2023-03-24 11:37:10] [INFO ] Computed and/alt/rep : 191/229/191 causal constraints (skipped 61 transitions) in 26 ms.
[2023-03-24 11:37:11] [INFO ] Added : 76 causal constraints over 16 iterations in 883 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4207 reset in 258 ms.
Product exploration explored 100000 steps with 4213 reset in 265 ms.
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1295/1295 places, 291/291 transitions.
Applied a total of 0 rules in 58 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2023-03-24 11:37:12] [INFO ] Invariant cache hit.
[2023-03-24 11:37:13] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2023-03-24 11:37:13] [INFO ] Invariant cache hit.
[2023-03-24 11:37:15] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
[2023-03-24 11:37:15] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-24 11:37:15] [INFO ] Invariant cache hit.
[2023-03-24 11:37:16] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4299 ms. Remains : 1295/1295 places, 291/291 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-11 finished in 37602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 1358 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1354 transition count 293
Applied a total of 5 rules in 89 ms. Remains 1354 /1358 variables (removed 4) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1354 cols
[2023-03-24 11:37:16] [INFO ] Computed 1062 place invariants in 43 ms
[2023-03-24 11:37:17] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2023-03-24 11:37:17] [INFO ] Invariant cache hit.
[2023-03-24 11:37:20] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3814 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1358 places, 293/296 transitions.
Applied a total of 0 rules in 42 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3946 ms. Remains : 1335/1358 places, 293/296 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1315 (ADD s1316 s1317 s1318 s1319 s1320 s1321 s1322 s1323 s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-13 finished in 4041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (p2||G(p1)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((p1||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(X(!p2)&&p1)))))'
Found a Shortening insensitive property : QuasiCertifProtocol-COL-18-LTLCardinality-09
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Support contains 39 out of 1358 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1358/1358 places, 296/296 transitions.
Graph (complete) has 9074 edges and 1358 vertex of which 1356 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 1355 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1355 transition count 295
Applied a total of 4 rules in 139 ms. Remains 1355 /1358 variables (removed 3) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2023-03-24 11:37:20] [INFO ] Computed 1062 place invariants in 15 ms
[2023-03-24 11:37:22] [INFO ] Implicit Places using invariants in 1475 ms returned []
[2023-03-24 11:37:22] [INFO ] Invariant cache hit.
[2023-03-24 11:37:24] [INFO ] Implicit Places using invariants and state equation in 2468 ms returned []
Implicit Place search using SMT with State Equation took 3947 ms to find 0 implicit places.
[2023-03-24 11:37:24] [INFO ] Invariant cache hit.
[2023-03-24 11:37:25] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1355/1358 places, 295/296 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4577 ms. Remains : 1355/1358 places, 295/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (LEQ 2 s1331) (LEQ 2 (ADD s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1347 s1348 s1349 s1350 s1351 s1352 s1353 s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4422 reset in 603 ms.
Product exploration explored 100000 steps with 4423 reset in 625 ms.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 14 factoid took 1011 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-24 11:37:28] [INFO ] Invariant cache hit.
[2023-03-24 11:37:28] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 197 ms returned sat
[2023-03-24 11:37:28] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-24 11:37:29] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 189 ms returned sat
[2023-03-24 11:37:29] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 p2 (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0 p2)), (X (NOT (AND p1 p0 p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND p1 p2 p0)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 19 factoid took 1103 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:37:30] [INFO ] Invariant cache hit.
[2023-03-24 11:37:31] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 706 ms returned sat
[2023-03-24 11:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:34] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2023-03-24 11:37:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:37:35] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 637 ms returned sat
[2023-03-24 11:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:37] [INFO ] [Nat]Absence check using state equation in 2759 ms returned sat
[2023-03-24 11:37:37] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 25 ms.
[2023-03-24 11:37:38] [INFO ] Added : 0 causal constraints over 0 iterations in 110 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 1355 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Applied a total of 0 rules in 44 ms. Remains 1355 /1355 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-24 11:37:38] [INFO ] Invariant cache hit.
[2023-03-24 11:37:39] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-24 11:37:39] [INFO ] Invariant cache hit.
[2023-03-24 11:37:41] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3758 ms to find 0 implicit places.
[2023-03-24 11:37:41] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-24 11:37:41] [INFO ] Invariant cache hit.
[2023-03-24 11:37:42] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4327 ms. Remains : 1355/1355 places, 295/295 transitions.
Computed a total of 1355 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1355 transition count 295
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
[2023-03-24 11:37:43] [INFO ] Invariant cache hit.
[2023-03-24 11:37:44] [INFO ] [Real]Absence check using 0 positive and 1062 generalized place invariants in 756 ms returned sat
[2023-03-24 11:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:46] [INFO ] [Real]Absence check using state equation in 2448 ms returned sat
[2023-03-24 11:37:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 11:37:47] [INFO ] [Nat]Absence check using 0 positive and 1062 generalized place invariants in 676 ms returned sat
[2023-03-24 11:37:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 11:37:50] [INFO ] [Nat]Absence check using state equation in 2640 ms returned sat
[2023-03-24 11:37:50] [INFO ] Computed and/alt/rep : 213/251/213 causal constraints (skipped 62 transitions) in 23 ms.
[2023-03-24 11:37:50] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10849 reset in 449 ms.
Product exploration explored 100000 steps with 10797 reset in 471 ms.
Support contains 20 out of 1355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1355/1355 places, 295/295 transitions.
Graph (complete) has 9409 edges and 1355 vertex of which 177 are kept as prefixes of interest. Removing 1178 places using SCC suffix rule.2 ms
Discarding 1178 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 177 transition count 125
Applied a total of 76 rules in 6 ms. Remains 177 /1355 variables (removed 1178) and now considering 125/295 (removed 170) transitions.
// Phase 1: matrix 125 rows 177 cols
[2023-03-24 11:37:51] [INFO ] Computed 54 place invariants in 0 ms
[2023-03-24 11:37:51] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-24 11:37:51] [INFO ] Invariant cache hit.
[2023-03-24 11:37:51] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-24 11:37:51] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-24 11:37:51] [INFO ] Invariant cache hit.
[2023-03-24 11:37:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/1355 places, 125/295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 177/1355 places, 125/295 transitions.
Treatment of property QuasiCertifProtocol-COL-18-LTLCardinality-09 finished in 31434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-24 11:37:52] [INFO ] Flatten gal took : 49 ms
[2023-03-24 11:37:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-24 11:37:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1358 places, 296 transitions and 2948 arcs took 4 ms.
Total runtime 212885 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393232 kB
MemFree: 16068076 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16124952 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393232 kB
MemFree: 16061888 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16117432 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1981/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-00
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-01
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-09
Could not compute solution for formula : QuasiCertifProtocol-COL-18-LTLCardinality-11

BK_STOP 1679659660135

--------------------
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
mcc2023
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-00
ltl formula formula --ltl=/tmp/1981/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1358 places, 296 transitions and 2948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_0_
Killing (15) : 1987 1988 1989 1990 1991
Killing (9) : 1987 1988 1989 1990 1991
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-01
ltl formula formula --ltl=/tmp/1981/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1358 places, 296 transitions and 2948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_1_
Killing (15) : 2008 2009 2010 2011 2012
Killing (9) : 2008 2009 2010 2011 2012
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-09
ltl formula formula --ltl=/tmp/1981/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1358 places, 296 transitions and 2948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name QuasiCertifProtocol-COL-18-LTLCardinality-11
ltl formula formula --ltl=/tmp/1981/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1358 places, 296 transitions and 2948 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1981/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1981/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1981/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1981/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-COL-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873951000827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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