Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 58K May 18 16:43 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-02-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716654912167

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:35:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:35:13] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-25 16:35:13] [INFO ] Transformed 86 places.
[2024-05-25 16:35:13] [INFO ] Transformed 56 transitions.
[2024-05-25 16:35:13] [INFO ] Found NUPN structural information;
[2024-05-25 16:35:13] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 83 transition count 56
Applied a total of 3 rules in 14 ms. Remains 83 /86 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 83 cols
[2024-05-25 16:35:13] [INFO ] Computed 28 invariants in 7 ms
[2024-05-25 16:35:13] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-25 16:35:13] [INFO ] Invariant cache hit.
[2024-05-25 16:35:13] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [46, 47, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 289 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 322 ms. Remains : 80/86 places, 56/56 transitions.
Support contains 58 out of 80 places after structural reductions.
[2024-05-25 16:35:14] [INFO ] Flatten gal took : 23 ms
[2024-05-25 16:35:14] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:35:14] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6572 resets) in 1696 ms. (23 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4002 steps (217 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (264 resets) in 72 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (264 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (220 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (220 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (226 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (221 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (224 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (223 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (226 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (219 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (223 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (219 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (223 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (224 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
// Phase 1: matrix 56 rows 80 cols
[2024-05-25 16:35:14] [INFO ] Computed 25 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 14/60 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 20/80 variables, 12/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (OVERLAPS) 56/136 variables, 80/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/105 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 105 constraints, problems are : Problem set: 5 solved, 10 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 10/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 15/57 variables, 3/13 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 7 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/16 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/77 variables, 11/27 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 8/35 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2/79 variables, 1/36 constraints. Problems are: Problem set: 5 solved, 10 unsolved
[2024-05-25 16:35:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/37 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 56/135 variables, 79/116 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 8/124 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/136 variables, 1/125 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 2/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 0/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/136 variables, 0/127 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 127 constraints, problems are : Problem set: 5 solved, 10 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 10/15 constraints, Known Traps: 12/12 constraints]
After SMT, in 1434ms problems are : Problem set: 5 solved, 10 unsolved
Finished Parikh walk after 718 steps, including 26 resets, run visited all 2 properties in 3 ms. (steps per millisecond=239 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 50 ms.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 80 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 56
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 2 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:35:16] [INFO ] Computed 20 invariants in 3 ms
[2024-05-25 16:35:16] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-25 16:35:16] [INFO ] Invariant cache hit.
[2024-05-25 16:35:16] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 817 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1041 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1878ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1879ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1996 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-01
Product exploration explored 100000 steps with 16416 reset in 230 ms.
Product exploration explored 100000 steps with 16425 reset in 140 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 183 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (6558 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 474 steps, run visited all 1 properties in 9 ms. (steps per millisecond=52 )
Probabilistic random walk after 474 steps, saw 194 distinct states, run finished after 15 ms. (steps per millisecond=31 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-01 finished in 3363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 40 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 39 transition count 39
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 37 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 37 transition count 35
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 36 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 36 transition count 33
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 1 with 2 rules applied. Total rules applied 15 place count 35 transition count 32
Applied a total of 15 rules in 23 ms. Remains 35 /80 variables (removed 45) and now considering 32/56 (removed 24) transitions.
// Phase 1: matrix 32 rows 35 cols
[2024-05-25 16:35:19] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 16:35:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:35:19] [INFO ] Invariant cache hit.
[2024-05-25 16:35:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [16, 20, 21]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 81 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 32/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 32/80 places, 32/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-02 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 8 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:35:20] [INFO ] Computed 20 invariants in 5 ms
[2024-05-25 16:35:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 16:35:20] [INFO ] Invariant cache hit.
[2024-05-25 16:35:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 699 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1106 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1822ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1823ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1986 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-03 finished in 2298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 66 transition count 51
Applied a total of 5 rules in 10 ms. Remains 66 /80 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 16:35:22] [INFO ] Computed 18 invariants in 2 ms
[2024-05-25 16:35:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 16:35:22] [INFO ] Invariant cache hit.
[2024-05-25 16:35:22] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 108 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/80 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 63/80 places, 51/56 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-04 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 77 transition count 56
Applied a total of 3 rules in 3 ms. Remains 77 /80 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2024-05-25 16:35:22] [INFO ] Computed 23 invariants in 1 ms
[2024-05-25 16:35:22] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 16:35:22] [INFO ] Invariant cache hit.
[2024-05-25 16:35:22] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/132 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 52 unsolved in 886 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/76 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/132 variables, 76/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 152 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1157 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 2058ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2061ms
Starting structural reductions in LTL mode, iteration 1 : 77/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2191 ms. Remains : 77/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-05
Product exploration explored 100000 steps with 17489 reset in 226 ms.
Product exploration explored 100000 steps with 17497 reset in 169 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
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 p2), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 354 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
RANDOM walk for 40000 steps (6561 resets) in 143 ms. (277 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2248 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2270 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2024-05-25 16:35:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/122 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/133 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 84 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/122 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 16/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/133 variables, 6/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 102 constraints, problems are : Problem set: 1 solved, 2 unsolved in 93 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p0))), (F (NOT (OR p2 p0))), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 25 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-05 finished in 4135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) 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 66 transition count 51
Applied a total of 5 rules in 5 ms. Remains 66 /80 variables (removed 14) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 16:35:26] [INFO ] Computed 18 invariants in 2 ms
[2024-05-25 16:35:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:35:26] [INFO ] Invariant cache hit.
[2024-05-25 16:35:26] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [49, 55, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 105 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/80 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 63/80 places, 51/56 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-06 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 44 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 42 transition count 38
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 42 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 40 transition count 36
Applied a total of 13 rules in 7 ms. Remains 40 /80 variables (removed 40) and now considering 36/56 (removed 20) transitions.
// Phase 1: matrix 36 rows 40 cols
[2024-05-25 16:35:26] [INFO ] Computed 8 invariants in 0 ms
[2024-05-25 16:35:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 16:35:26] [INFO ] Invariant cache hit.
[2024-05-25 16:35:27] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [25, 29, 30]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 77 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/80 places, 36/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 37/80 places, 36/56 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-07 finished in 133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(!p1))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 74 transition count 56
Applied a total of 6 rules in 5 ms. Remains 74 /80 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 74 cols
[2024-05-25 16:35:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:35:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:35:27] [INFO ] Invariant cache hit.
[2024-05-25 16:35:27] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 94 constraints, problems are : Problem set: 0 solved, 52 unsolved in 706 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 16/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/130 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 36/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1016 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1736ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1737ms
Starting structural reductions in LTL mode, iteration 1 : 74/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1849 ms. Remains : 74/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 185 steps with 30 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-08 finished in 2078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(G(p1))))))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 73 transition count 56
Applied a total of 7 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:35:29] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:35:29] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-25 16:35:29] [INFO ] Invariant cache hit.
[2024-05-25 16:35:29] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 721 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1022 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1753ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1754ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1894 ms. Remains : 73/80 places, 56/56 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-09
Product exploration explored 100000 steps with 16416 reset in 64 ms.
Product exploration explored 100000 steps with 16427 reset in 71 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (6562 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (2234 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2274 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 5 ms. (steps per millisecond=95 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 5 ms. (steps per millisecond=95 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 16:35:32] [INFO ] Invariant cache hit.
[2024-05-25 16:35:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-25 16:35:32] [INFO ] Invariant cache hit.
[2024-05-25 16:35:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 728 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1042 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1784ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1785ms
Finished structural reductions in LTL mode , in 1 iterations and 1895 ms. Remains : 73/73 places, 56/56 transitions.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (6571 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2240 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2280 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 475 steps, run visited all 2 properties in 4 ms. (steps per millisecond=118 )
Probabilistic random walk after 475 steps, saw 195 distinct states, run finished after 4 ms. (steps per millisecond=118 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16436 reset in 63 ms.
Product exploration explored 100000 steps with 16413 reset in 68 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 56/56 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 2 place count 73 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 73 /73 variables (removed 0) and now considering 58/56 (removed -2) transitions.
[2024-05-25 16:35:35] [INFO ] Redundant transitions in 15 ms returned []
Running 54 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 73 cols
[2024-05-25 16:35:35] [INFO ] Computed 20 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 2 (OVERLAPS) 58/130 variables, 72/92 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/131 variables, 1/93 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 93 constraints, problems are : Problem set: 4 solved, 50 unsolved in 711 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 20/20 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 56/126 variables, 70/90 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 50/140 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/140 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 5/131 variables, 3/143 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 143 constraints, problems are : Problem set: 4 solved, 50 unsolved in 1003 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 50/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 1733ms problems are : Problem set: 4 solved, 50 unsolved
Search for dead transitions found 4 dead transitions in 1735ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 54/56 transitions.
Graph (complete) has 141 edges and 73 vertex of which 71 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 71 /73 variables (removed 2) and now considering 54/54 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 54/56 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1777 ms. Remains : 71/73 places, 54/56 transitions.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2024-05-25 16:35:37] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:35:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-25 16:35:37] [INFO ] Invariant cache hit.
[2024-05-25 16:35:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 748 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1022 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1783ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1784ms
Finished structural reductions in LTL mode , in 1 iterations and 1927 ms. Remains : 73/73 places, 56/56 transitions.
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-09 finished in 10451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 69 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 67 transition count 52
Applied a total of 3 rules in 6 ms. Remains 67 /80 variables (removed 13) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 67 cols
[2024-05-25 16:35:39] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 16:35:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 16:35:39] [INFO ] Invariant cache hit.
[2024-05-25 16:35:39] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [50, 56, 57]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 110 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/80 places, 52/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 64/80 places, 52/56 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-15
Product exploration explored 100000 steps with 18728 reset in 75 ms.
Product exploration explored 100000 steps with 18739 reset in 91 ms.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (7502 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 3 ms. (steps per millisecond=71 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 3 ms. (steps per millisecond=71 ) 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 290 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 64 cols
[2024-05-25 16:35:40] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 16:35:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-25 16:35:40] [INFO ] Invariant cache hit.
[2024-05-25 16:35:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-25 16:35:40] [INFO ] Redundant transitions in 11 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-25 16:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 3/116 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 80 constraints, problems are : Problem set: 0 solved, 45 unsolved in 579 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 125 constraints, problems are : Problem set: 0 solved, 45 unsolved in 826 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1553 ms. Remains : 64/64 places, 52/52 transitions.
Computed a total of 64 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 52
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 90 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)]
RANDOM walk for 40000 steps (7502 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1858 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 214 steps, run visited all 1 properties in 5 ms. (steps per millisecond=42 )
Probabilistic random walk after 214 steps, saw 114 distinct states, run finished after 5 ms. (steps per millisecond=42 ) 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 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18750 reset in 71 ms.
Product exploration explored 100000 steps with 18764 reset in 72 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 16:35:42] [INFO ] Invariant cache hit.
[2024-05-25 16:35:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:35:42] [INFO ] Invariant cache hit.
[2024-05-25 16:35:42] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-25 16:35:42] [INFO ] Redundant transitions in 13 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-25 16:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 3/116 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 80 constraints, problems are : Problem set: 0 solved, 45 unsolved in 551 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 52/113 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 45/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 125 constraints, problems are : Problem set: 0 solved, 45 unsolved in 850 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1416ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1417ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1543 ms. Remains : 64/64 places, 52/52 transitions.
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-15 finished in 4571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(G(p1))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-02-LTLCardinality-09
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 80/80 places, 56/56 transitions.
Graph (complete) has 160 edges and 80 vertex of which 73 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 70 transition count 53
Applied a total of 5 rules in 3 ms. Remains 70 /80 variables (removed 10) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 70 cols
[2024-05-25 16:35:44] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:35:44] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 16:35:44] [INFO ] Invariant cache hit.
[2024-05-25 16:35:44] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [50, 56, 57]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 113 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 67/80 places, 53/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 118 ms. Remains : 67/80 places, 53/56 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-02-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 427 steps with 79 reset in 1 ms.
Treatment of property QuasiCertifProtocol-PT-02-LTLCardinality-09 finished in 422 ms.
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-25 16:35:44] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:35:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 16:35:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 56 transitions and 217 arcs took 2 ms.
Total runtime 31413 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 80
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1331
MODEL NAME: /home/mcc/execution/403/model
80 places, 56 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716654945889

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-02, 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 r311-tall-171662335800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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