About the Execution of LoLa+red for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 681.012 | 54339.00 | 75536.00 | 636.30 | FFFTTFTTTFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948500875.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948500875
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 30K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:20 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 6.3K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678917553896
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 21:59:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 21:59:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:59:15] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-15 21:59:15] [INFO ] Transformed 550 places.
[2023-03-15 21:59:15] [INFO ] Transformed 176 transitions.
[2023-03-15 21:59:15] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 113 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 51 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2023-03-15 21:59:15] [INFO ] Computed 363 place invariants in 32 ms
[2023-03-15 21:59:16] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-15 21:59:16] [INFO ] Invariant cache hit.
[2023-03-15 21:59:17] [INFO ] Implicit Places using invariants and state equation in 694 ms returned [316, 317, 324, 325, 326, 327, 328, 329, 330, 331, 368]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1443 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 527/550 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 527 /527 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1515 ms. Remains : 527/550 places, 176/176 transitions.
Support contains 113 out of 527 places after structural reductions.
[2023-03-15 21:59:17] [INFO ] Flatten gal took : 60 ms
[2023-03-15 21:59:17] [INFO ] Flatten gal took : 32 ms
[2023-03-15 21:59:17] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 691 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 176 rows 527 cols
[2023-03-15 21:59:18] [INFO ] Computed 352 place invariants in 12 ms
[2023-03-15 21:59:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 21:59:18] [INFO ] [Real]Absence check using 1 positive and 351 generalized place invariants in 52 ms returned sat
[2023-03-15 21:59:18] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-15 21:59:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 21:59:19] [INFO ] [Nat]Absence check using 1 positive and 351 generalized place invariants in 67 ms returned sat
[2023-03-15 21:59:20] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-15 21:59:21] [INFO ] After 1952ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 796 ms.
[2023-03-15 21:59:21] [INFO ] After 3231ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 12 different solutions.
Finished Parikh walk after 87 steps, including 0 resets, run visited all 7 properties in 6 ms. (steps per millisecond=14 )
Parikh walk visited 13 properties in 16 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 527 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 527 transition count 176
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' '!((G(p0) U X((p1||X(X(p2))))))'
Support contains 23 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 513 transition count 176
Applied a total of 14 rules in 18 ms. Remains 513 /527 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 21:59:22] [INFO ] Computed 340 place invariants in 33 ms
[2023-03-15 21:59:22] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-15 21:59:22] [INFO ] Invariant cache hit.
[2023-03-15 21:59:23] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
[2023-03-15 21:59:23] [INFO ] Invariant cache hit.
[2023-03-15 21:59:23] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/527 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1233 ms. Remains : 513/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ 1 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s33 s34)), p2:(LEQ 1 (ADD s456 s457 s458 s460 s461 s462 s463 s464 s465 s466 s467))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-00 finished in 1749 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)&&(p1 U p2)) U p3))'
Support contains 56 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Graph (complete) has 2190 edges and 527 vertex of which 525 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 523 transition count 174
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 523 transition count 174
Applied a total of 4 rules in 94 ms. Remains 523 /527 variables (removed 4) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 523 cols
[2023-03-15 21:59:24] [INFO ] Computed 350 place invariants in 6 ms
[2023-03-15 21:59:24] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-15 21:59:24] [INFO ] Invariant cache hit.
[2023-03-15 21:59:24] [INFO ] Implicit Places using invariants and state equation in 594 ms returned [430, 431, 432, 433, 434, 435, 487, 490, 491, 492, 493]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 963 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/527 places, 174/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 512 /512 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 512/527 places, 174/176 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p3), true, (NOT p0), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(GT (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22) s483), p0:(GT 3 (ADD s201 s205 s206 s207 s208 s209 s210 s211 s212 s215 s216)), p2:(LEQ 2 (ADD s46...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-01 finished in 1214 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((F(p1)||p0))))'
Support contains 36 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 513 transition count 176
Applied a total of 14 rules in 11 ms. Remains 513 /527 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2023-03-15 21:59:25] [INFO ] Computed 340 place invariants in 25 ms
[2023-03-15 21:59:25] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-15 21:59:25] [INFO ] Invariant cache hit.
[2023-03-15 21:59:26] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-15 21:59:26] [INFO ] Invariant cache hit.
[2023-03-15 21:59:26] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/527 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1106 ms. Remains : 513/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT (ADD s456 s457 s458 s460 s461 s462 s463 s464 s465 s466 s467) s87) (AND (LEQ (ADD s456 s457 s458 s460 s461 s462 s463 s464 s465 s466 s467) s87) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6925 reset in 308 ms.
Product exploration explored 100000 steps with 6927 reset in 237 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1616168 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{1=1}
Probabilistic random walk after 1616168 steps, saw 216613 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-15 21:59:30] [INFO ] Invariant cache hit.
[2023-03-15 21:59:30] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:59:30] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 46 ms returned sat
[2023-03-15 21:59:30] [INFO ] After 292ms SMT Verify possible using all constraints in natural 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 5954 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' '!((p0 U X(X(p1))))'
Support contains 33 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 513 transition count 176
Applied a total of 14 rules in 6 ms. Remains 513 /527 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2023-03-15 21:59:31] [INFO ] Invariant cache hit.
[2023-03-15 21:59:31] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-15 21:59:31] [INFO ] Invariant cache hit.
[2023-03-15 21:59:31] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2023-03-15 21:59:31] [INFO ] Invariant cache hit.
[2023-03-15 21:59:32] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/527 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 513/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ (ADD s43 s44 s47 s48 s49 s50 s51 s52 s53 s54 s58) (ADD s32 s35 s36 s37 s38 s39 s40 s41 s42 s45 s46)), p0:(LEQ 1 (ADD s23 s24 s25 s26 s27 s28 s29 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 362 ms.
Product exploration explored 100000 steps with 33333 reset in 257 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-07 finished in 2225 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&&X(X(F(p1))))))'
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 514 transition count 176
Applied a total of 13 rules in 13 ms. Remains 514 /527 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 21:59:33] [INFO ] Computed 340 place invariants in 6 ms
[2023-03-15 21:59:33] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-15 21:59:33] [INFO ] Invariant cache hit.
[2023-03-15 21:59:34] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2023-03-15 21:59:34] [INFO ] Invariant cache hit.
[2023-03-15 21:59:34] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 514/527 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1046 ms. Remains : 514/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s205 s49), p0:(LEQ s485 s159)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12122 reset in 180 ms.
Product exploration explored 100000 steps with 12156 reset in 237 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 693 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:59:35] [INFO ] Invariant cache hit.
[2023-03-15 21:59:35] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:59:35] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 47 ms returned sat
[2023-03-15 21:59:35] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:59:35] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-15 21:59:35] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 342 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 21:59:36] [INFO ] Invariant cache hit.
[2023-03-15 21:59:36] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 127 ms returned sat
[2023-03-15 21:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:37] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2023-03-15 21:59:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:59:37] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 126 ms returned sat
[2023-03-15 21:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:38] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2023-03-15 21:59:38] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2023-03-15 21:59:38] [INFO ] Added : 0 causal constraints over 0 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-15 21:59:38] [INFO ] Invariant cache hit.
[2023-03-15 21:59:39] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-15 21:59:39] [INFO ] Invariant cache hit.
[2023-03-15 21:59:39] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2023-03-15 21:59:39] [INFO ] Invariant cache hit.
[2023-03-15 21:59:39] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1009 ms. Remains : 514/514 places, 176/176 transitions.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:59:40] [INFO ] Invariant cache hit.
[2023-03-15 21:59:40] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:59:40] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 45 ms returned sat
[2023-03-15 21:59:40] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:59:40] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-15 21:59:40] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 21:59:41] [INFO ] Invariant cache hit.
[2023-03-15 21:59:41] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 126 ms returned sat
[2023-03-15 21:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:42] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2023-03-15 21:59:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:59:42] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 123 ms returned sat
[2023-03-15 21:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:43] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2023-03-15 21:59:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2023-03-15 21:59:43] [INFO ] Added : 0 causal constraints over 0 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12096 reset in 198 ms.
Product exploration explored 100000 steps with 12171 reset in 212 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2041 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 502 transition count 176
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 71 ms. Remains 502 /514 variables (removed 12) and now considering 176/176 (removed 0) transitions.
[2023-03-15 21:59:44] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 176 rows 502 cols
[2023-03-15 21:59:44] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-15 21:59:44] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 502/514 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 502/514 places, 176/176 transitions.
Support contains 4 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 21:59:44] [INFO ] Computed 340 place invariants in 3 ms
[2023-03-15 21:59:45] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-15 21:59:45] [INFO ] Invariant cache hit.
[2023-03-15 21:59:45] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-15 21:59:45] [INFO ] Invariant cache hit.
[2023-03-15 21:59:45] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1018 ms. Remains : 514/514 places, 176/176 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 12761 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(F(p0))||G(p1))))'
Support contains 3 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Graph (complete) has 2190 edges and 527 vertex of which 502 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 500 transition count 172
Applied a total of 5 rules in 24 ms. Remains 500 /527 variables (removed 27) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-15 21:59:46] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-15 21:59:46] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-15 21:59:46] [INFO ] Invariant cache hit.
[2023-03-15 21:59:46] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-15 21:59:47] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 21:59:47] [INFO ] Invariant cache hit.
[2023-03-15 21:59:47] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/527 places, 172/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1098 ms. Remains : 500/527 places, 172/176 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s482 s54), p0:(LEQ 1 s199)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6928 reset in 151 ms.
Product exploration explored 100000 steps with 6929 reset in 167 ms.
Computed a total of 500 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 172
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)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-10 finished in 1796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 5 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Graph (complete) has 2190 edges and 527 vertex of which 514 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 514 transition count 176
Applied a total of 2 rules in 46 ms. Remains 514 /527 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2023-03-15 21:59:47] [INFO ] Computed 340 place invariants in 6 ms
[2023-03-15 21:59:48] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-15 21:59:48] [INFO ] Invariant cache hit.
[2023-03-15 21:59:48] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-15 21:59:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 21:59:48] [INFO ] Invariant cache hit.
[2023-03-15 21:59:48] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 514/527 places, 176/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1098 ms. Remains : 514/527 places, 176/176 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s54 s76), p1:(AND (GT s426 s315) (GT 2 s81))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-12 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Graph (complete) has 2190 edges and 527 vertex of which 501 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 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 498 transition count 171
Applied a total of 5 rules in 22 ms. Remains 498 /527 variables (removed 29) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 498 cols
[2023-03-15 21:59:49] [INFO ] Computed 330 place invariants in 12 ms
[2023-03-15 21:59:49] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-15 21:59:49] [INFO ] Invariant cache hit.
[2023-03-15 21:59:49] [INFO ] Implicit Places using invariants and state equation in 540 ms returned [417, 418, 419, 420, 421, 422, 474, 477, 478, 479, 480]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 867 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/527 places, 171/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 907 ms. Remains : 487/527 places, 171/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 2 s59) (GT 1 s28))], 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 6778 reset in 244 ms.
Product exploration explored 100000 steps with 6780 reset in 183 ms.
Computed a total of 487 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 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)]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 817 steps, run visited all 1 properties in 4 ms. (steps per millisecond=204 )
Probabilistic random walk after 817 steps, saw 776 distinct states, run finished after 5 ms. (steps per millisecond=163 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 171/171 transitions.
Applied a total of 0 rules in 15 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
// Phase 1: matrix 171 rows 487 cols
[2023-03-15 21:59:51] [INFO ] Computed 320 place invariants in 18 ms
[2023-03-15 21:59:51] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-15 21:59:51] [INFO ] Invariant cache hit.
[2023-03-15 21:59:51] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-03-15 21:59:51] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 21:59:51] [INFO ] Invariant cache hit.
[2023-03-15 21:59:52] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 988 ms. Remains : 487/487 places, 171/171 transitions.
Computed a total of 487 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 678 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 817 steps, run visited all 1 properties in 4 ms. (steps per millisecond=204 )
Probabilistic random walk after 817 steps, saw 776 distinct states, run finished after 5 ms. (steps per millisecond=163 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6788 reset in 179 ms.
Product exploration explored 100000 steps with 6770 reset in 174 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 171/171 transitions.
Applied a total of 0 rules in 9 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2023-03-15 21:59:52] [INFO ] Invariant cache hit.
[2023-03-15 21:59:53] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-15 21:59:53] [INFO ] Invariant cache hit.
[2023-03-15 21:59:53] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2023-03-15 21:59:53] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 21:59:53] [INFO ] Invariant cache hit.
[2023-03-15 21:59:53] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1017 ms. Remains : 487/487 places, 171/171 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-13 finished in 4868 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&&X(X(F(p1))))))'
Found a Shortening insensitive property : QuasiCertifProtocol-PT-10-LTLCardinality-08
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 527 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 527/527 places, 176/176 transitions.
Graph (complete) has 2190 edges and 527 vertex of which 502 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 500 transition count 172
Applied a total of 5 rules in 26 ms. Remains 500 /527 variables (removed 27) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 500 cols
[2023-03-15 21:59:54] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-15 21:59:54] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-15 21:59:54] [INFO ] Invariant cache hit.
[2023-03-15 21:59:55] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-15 21:59:55] [INFO ] Invariant cache hit.
[2023-03-15 21:59:55] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/527 places, 172/176 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1018 ms. Remains : 500/527 places, 172/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s202 s49), p0:(LEQ s482 s156)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12153 reset in 203 ms.
Product exploration explored 100000 steps with 12094 reset in 237 ms.
Computed a total of 500 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 692 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:59:56] [INFO ] Invariant cache hit.
[2023-03-15 21:59:56] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 21:59:56] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 46 ms returned sat
[2023-03-15 21:59:56] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 21:59:56] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-15 21:59:56] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 21:59:56] [INFO ] Invariant cache hit.
[2023-03-15 21:59:57] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 115 ms returned sat
[2023-03-15 21:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:58] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2023-03-15 21:59:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:59:58] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 122 ms returned sat
[2023-03-15 21:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:59:59] [INFO ] [Nat]Absence check using state equation in 995 ms returned sat
[2023-03-15 21:59:59] [INFO ] Computed and/alt/rep : 123/145/123 causal constraints (skipped 37 transitions) in 11 ms.
[2023-03-15 21:59:59] [INFO ] Added : 0 causal constraints over 0 iterations in 58 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 172/172 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 21:59:59] [INFO ] Invariant cache hit.
[2023-03-15 21:59:59] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-15 21:59:59] [INFO ] Invariant cache hit.
[2023-03-15 22:00:00] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-15 22:00:00] [INFO ] Invariant cache hit.
[2023-03-15 22:00:00] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 988 ms. Remains : 500/500 places, 172/172 transitions.
Computed a total of 500 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 172
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 691 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:00:01] [INFO ] Invariant cache hit.
[2023-03-15 22:00:01] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:00:01] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 44 ms returned sat
[2023-03-15 22:00:01] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:00:01] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-15 22:00:01] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-15 22:00:01] [INFO ] Invariant cache hit.
[2023-03-15 22:00:02] [INFO ] [Real]Absence check using 0 positive and 330 generalized place invariants in 115 ms returned sat
[2023-03-15 22:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:00:03] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2023-03-15 22:00:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:00:03] [INFO ] [Nat]Absence check using 0 positive and 330 generalized place invariants in 119 ms returned sat
[2023-03-15 22:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:00:04] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2023-03-15 22:00:04] [INFO ] Computed and/alt/rep : 123/145/123 causal constraints (skipped 37 transitions) in 14 ms.
[2023-03-15 22:00:04] [INFO ] Added : 0 causal constraints over 0 iterations in 53 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12091 reset in 216 ms.
Product exploration explored 100000 steps with 12104 reset in 221 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 172/172 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 22:00:05] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 22:00:05] [INFO ] Invariant cache hit.
[2023-03-15 22:00:05] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 500/500 places, 172/172 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-15 22:00:05] [INFO ] Invariant cache hit.
[2023-03-15 22:00:05] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-15 22:00:05] [INFO ] Invariant cache hit.
[2023-03-15 22:00:06] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-15 22:00:06] [INFO ] Invariant cache hit.
[2023-03-15 22:00:06] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 500/500 places, 172/172 transitions.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 12405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-15 22:00:06] [INFO ] Flatten gal took : 22 ms
[2023-03-15 22:00:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-15 22:00:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 527 places, 176 transitions and 1199 arcs took 3 ms.
Total runtime 51090 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT QuasiCertifProtocol-PT-10
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
LTLCardinality
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678917608235
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 QuasiCertifProtocol-PT-10-LTLCardinality-08
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for QuasiCertifProtocol-PT-10-LTLCardinality-08
lola: result : true
lola: markings : 72506
lola: fired transitions : 187136
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 QuasiCertifProtocol-PT-10-LTLCardinality-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for QuasiCertifProtocol-PT-10-LTLCardinality-13
lola: result : false
lola: markings : 45
lola: fired transitions : 46
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
QuasiCertifProtocol-PT-10-LTLCardinality-08: LTL true LTL model checker
QuasiCertifProtocol-PT-10-LTLCardinality-13: LTL false LTL model checker
Time elapsed: 1 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873948500875"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 '
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 ;