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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 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 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 360K 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-18-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716656521225

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 17:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:02:02] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-25 17:02:02] [INFO ] Transformed 1398 places.
[2024-05-25 17:02:02] [INFO ] Transformed 296 transitions.
[2024-05-25 17:02:02] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 566 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1397 transition count 296
Applied a total of 1 rules in 120 ms. Remains 1397 /1398 variables (removed 1) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1397 cols
[2024-05-25 17:02:02] [INFO ] Computed 1102 invariants in 50 ms
[2024-05-25 17:02:04] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2024-05-25 17:02:04] [INFO ] Invariant cache hit.
[2024-05-25 17:02:07] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned [834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 947, 948, 950, 951, 952, 953, 954]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 4903 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1380/1398 places, 296/296 transitions.
Applied a total of 0 rules in 22 ms. Remains 1380 /1380 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5060 ms. Remains : 1380/1398 places, 296/296 transitions.
Support contains 566 out of 1380 places after structural reductions.
[2024-05-25 17:02:08] [INFO ] Flatten gal took : 107 ms
[2024-05-25 17:02:08] [INFO ] Flatten gal took : 62 ms
[2024-05-25 17:02:08] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (1770 resets) in 1966 ms. (20 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
// Phase 1: matrix 296 rows 1380 cols
[2024-05-25 17:02:08] [INFO ] Computed 1085 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 4/510 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 506/1016 variables, 744/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 364/1380 variables, 340/1085 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 7 (OVERLAPS) 296/1676 variables, 1380/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1676 variables, 0/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/1676 variables, 0/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 2465 constraints, problems are : Problem set: 3 solved, 12 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1084/1084 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 4/505 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 508/1013 variables, 742/743 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1013 variables, 0/743 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 367/1380 variables, 342/1085 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1380 variables, 0/1085 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 296/1676 variables, 1380/2465 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1676 variables, 12/2477 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2477 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1084/1084 constraints, State Equation: 1380/1380 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 9593ms problems are : Problem set: 3 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 501 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1361 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.7 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 1361 transition count 239
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1361 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1360 transition count 238
Applied a total of 60 rules in 165 ms. Remains 1360 /1380 variables (removed 20) and now considering 238/296 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 1360/1380 places, 238/296 transitions.
RANDOM walk for 40000 steps (1242 resets) in 1371 ms. (29 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 419 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (84 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (72 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
// Phase 1: matrix 238 rows 1360 cols
[2024-05-25 17:02:19] [INFO ] Computed 1123 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/447 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 533/980 variables, 762/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 342/1322 variables, 342/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 238/1560 variables, 1322/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 38/1598 variables, 38/2465 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1598 variables, 18/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1598 variables, 0/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1598 variables, 0/2483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1598/1598 variables, and 2483 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1122/1122 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/447 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 533/980 variables, 762/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 342/1322 variables, 342/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 238/1560 variables, 1322/2427 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 8/2435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/2435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 38/1598 variables, 38/2473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1598 variables, 18/2491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1598 variables, 1/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1598 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1598 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1598/1598 variables, and 2492 constraints, problems are : Problem set: 0 solved, 9 unsolved in 39928 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1122/1122 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 43132ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 11998 steps, including 132 resets, run visited all 4 properties in 94 ms. (steps per millisecond=127 )
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 9 properties in 222 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 1380 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1380 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 361 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 1339 transition count 296
Applied a total of 41 rules in 18 ms. Remains 1339 /1380 variables (removed 41) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1339 cols
[2024-05-25 17:03:03] [INFO ] Computed 1045 invariants in 26 ms
[2024-05-25 17:03:04] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-05-25 17:03:04] [INFO ] Invariant cache hit.
[2024-05-25 17:03:09] [INFO ] Implicit Places using invariants and state equation in 5432 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6451 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1380 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6491 ms. Remains : 1337/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-00 finished in 6770 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||G(p1))))'
Support contains 76 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1338 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.15 ms
Discarding 42 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1337 transition count 293
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1337 transition count 293
Applied a total of 4 rules in 172 ms. Remains 1337 /1380 variables (removed 43) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 1337 cols
[2024-05-25 17:03:10] [INFO ] Computed 1046 invariants in 23 ms
[2024-05-25 17:03:14] [INFO ] Implicit Places using invariants in 3827 ms returned []
[2024-05-25 17:03:14] [INFO ] Invariant cache hit.
[2024-05-25 17:03:18] [INFO ] Implicit Places using invariants and state equation in 4174 ms returned [933, 934]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8006 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1335/1380 places, 293/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8229 ms. Remains : 1335/1380 places, 293/296 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-02
Product exploration explored 100000 steps with 10822 reset in 449 ms.
Product exploration explored 100000 steps with 10823 reset in 377 ms.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 469 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1772 resets) in 398 ms. (100 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
// Phase 1: matrix 293 rows 1335 cols
[2024-05-25 17:03:20] [INFO ] Computed 1044 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 607 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 975 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1616ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 802 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 17:03:22] [INFO ] Invariant cache hit.
[2024-05-25 17:03:24] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1219 ms returned sat
[2024-05-25 17:03:32] [INFO ] [Real]Absence check using state equation in 8144 ms returned sat
[2024-05-25 17:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:03:34] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1323 ms returned sat
[2024-05-25 17:03:43] [INFO ] [Nat]Absence check using state equation in 9112 ms returned sat
[2024-05-25 17:03:43] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-25 17:03:43] [INFO ] Added : 0 causal constraints over 0 iterations in 150 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 51 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 17:03:43] [INFO ] Invariant cache hit.
[2024-05-25 17:03:45] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2024-05-25 17:03:45] [INFO ] Invariant cache hit.
[2024-05-25 17:03:51] [INFO ] Implicit Places using invariants and state equation in 5839 ms returned []
Implicit Place search using SMT with State Equation took 7173 ms to find 0 implicit places.
[2024-05-25 17:03:51] [INFO ] Redundant transitions in 45 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 17:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 2378 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67641 ms. Remains : 1335/1335 places, 293/293 transitions.
Computed a total of 1335 stabilizing places and 293 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1335 transition count 293
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 479 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1763 resets) in 300 ms. (132 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
[2024-05-25 17:04:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1628 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 580 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 399/475 variables, 378/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 139/614 variables, 475/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1014/1628 variables, 860/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1628 variables, 666/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1628 variables, 2/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1628 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1628/1628 variables, and 2381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 982 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1335/1335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 750 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-25 17:04:54] [INFO ] Invariant cache hit.
[2024-05-25 17:04:56] [INFO ] [Real]Absence check using 0 positive and 1044 generalized place invariants in 1202 ms returned sat
[2024-05-25 17:05:04] [INFO ] [Real]Absence check using state equation in 7382 ms returned sat
[2024-05-25 17:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:05:05] [INFO ] [Nat]Absence check using 0 positive and 1044 generalized place invariants in 1234 ms returned sat
[2024-05-25 17:05:15] [INFO ] [Nat]Absence check using state equation in 9375 ms returned sat
[2024-05-25 17:05:15] [INFO ] Computed and/alt/rep : 212/250/212 causal constraints (skipped 61 transitions) in 25 ms.
[2024-05-25 17:05:15] [INFO ] Added : 0 causal constraints over 0 iterations in 176 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10778 reset in 387 ms.
Product exploration explored 100000 steps with 10744 reset in 388 ms.
Support contains 76 out of 1335 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1335/1335 places, 293/293 transitions.
Applied a total of 0 rules in 40 ms. Remains 1335 /1335 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-25 17:05:16] [INFO ] Invariant cache hit.
[2024-05-25 17:05:17] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2024-05-25 17:05:17] [INFO ] Invariant cache hit.
[2024-05-25 17:05:23] [INFO ] Implicit Places using invariants and state equation in 5963 ms returned []
Implicit Place search using SMT with State Equation took 7264 ms to find 0 implicit places.
[2024-05-25 17:05:23] [INFO ] Redundant transitions in 19 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-25 17:05:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1627/1628 variables, and 2378 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1315 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1315 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 19/1334 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1334 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 293/1627 variables, 1334/2378 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1627 variables, 273/2651 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1627/1628 variables, and 2651 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1334/1335 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67717 ms. Remains : 1335/1335 places, 293/293 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-02 finished in 194003 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 20 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1319 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.4 ms
Discarding 61 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 1317 transition count 292
Applied a total of 3 rules in 118 ms. Remains 1317 /1380 variables (removed 63) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1317 cols
[2024-05-25 17:06:24] [INFO ] Computed 1027 invariants in 9 ms
[2024-05-25 17:06:25] [INFO ] Implicit Places using invariants in 1420 ms returned []
[2024-05-25 17:06:25] [INFO ] Invariant cache hit.
[2024-05-25 17:06:31] [INFO ] Implicit Places using invariants and state equation in 5691 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 7113 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1380 places, 292/296 transitions.
Applied a total of 0 rules in 46 ms. Remains 1296 /1296 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7277 ms. Remains : 1296/1380 places, 292/296 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-03 finished in 7400 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' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Support contains 59 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1359 transition count 296
Applied a total of 21 rules in 31 ms. Remains 1359 /1380 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1359 cols
[2024-05-25 17:06:31] [INFO ] Computed 1064 invariants in 13 ms
[2024-05-25 17:06:32] [INFO ] Implicit Places using invariants in 1370 ms returned []
[2024-05-25 17:06:32] [INFO ] Invariant cache hit.
[2024-05-25 17:06:39] [INFO ] Implicit Places using invariants and state equation in 6659 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8035 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1380 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8098 ms. Remains : 1357/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 495 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 4423 reset in 298 ms.
Product exploration explored 100000 steps with 4416 reset in 294 ms.
Computed a total of 1357 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1357 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1767 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2051519 steps, run timeout after 3001 ms. (steps per millisecond=683 ) properties seen :0 out of 1
Probabilistic random walk after 2051519 steps, saw 288254 distinct states, run finished after 3004 ms. (steps per millisecond=682 ) properties seen :0
// Phase 1: matrix 296 rows 1357 cols
[2024-05-25 17:06:44] [INFO ] Computed 1062 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/392 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 520/912 variables, 441/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/941 variables, 342/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/941 variables, 29/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/941 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1273 variables, 324/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1273 variables, 332/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 380/1653 variables, 380/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1653 variables, 342/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1653 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 2419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/392 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 520/912 variables, 441/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/941 variables, 342/1013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/941 variables, 29/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/941 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1273 variables, 324/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1273 variables, 332/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1273 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 380/1653 variables, 380/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1653 variables, 342/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1653 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1653 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 732 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 1357 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1357/1357 places, 296/296 transitions.
Graph (complete) has 8708 edges and 1357 vertex of which 996 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.4 ms
Discarding 361 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 978 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 978 transition count 260
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 41 place count 976 transition count 258
Applied a total of 41 rules in 154 ms. Remains 976 /1357 variables (removed 381) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 976 cols
[2024-05-25 17:06:46] [INFO ] Computed 720 invariants in 4 ms
[2024-05-25 17:06:47] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-25 17:06:47] [INFO ] Invariant cache hit.
[2024-05-25 17:06:50] [INFO ] Implicit Places using invariants and state equation in 3621 ms returned []
Implicit Place search using SMT with State Equation took 4587 ms to find 0 implicit places.
[2024-05-25 17:06:50] [INFO ] Redundant transitions in 27 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 17:06:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 21/1234 variables, 21/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 198/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 21/1234 variables, 21/1894 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 40/1934 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1934 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1357 places, 258/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65014 ms. Remains : 976/1357 places, 258/296 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1767 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2112811 steps, run timeout after 3001 ms. (steps per millisecond=704 ) properties seen :0 out of 1
Probabilistic random walk after 2112811 steps, saw 296545 distinct states, run finished after 3001 ms. (steps per millisecond=704 ) properties seen :0
[2024-05-25 17:07:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4411 reset in 259 ms.
Product exploration explored 100000 steps with 4419 reset in 283 ms.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 48 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-25 17:07:56] [INFO ] Computed 702 invariants in 12 ms
[2024-05-25 17:07:57] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-25 17:07:57] [INFO ] Invariant cache hit.
[2024-05-25 17:07:59] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 3195 ms to find 0 implicit places.
[2024-05-25 17:07:59] [INFO ] Redundant transitions in 21 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-25 17:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/1135 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 1619 constraints, problems are : Problem set: 0 solved, 198 unsolved in 27827 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 198/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/1135 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 1817 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 57975ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 57978ms
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61264 ms. Remains : 917/976 places, 218/258 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 146206 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(F(!p0))||(F(!p0)&&(p1||F(((p2&&X(F(p3)))||G(F(p3)))))))))'
Support contains 77 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1359 transition count 296
Applied a total of 21 rules in 29 ms. Remains 1359 /1380 variables (removed 21) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1359 cols
[2024-05-25 17:08:57] [INFO ] Computed 1065 invariants in 11 ms
[2024-05-25 17:08:59] [INFO ] Implicit Places using invariants in 1461 ms returned []
[2024-05-25 17:08:59] [INFO ] Invariant cache hit.
[2024-05-25 17:09:03] [INFO ] Implicit Places using invariants and state equation in 4198 ms returned [917, 918]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5662 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1357/1380 places, 296/296 transitions.
Applied a total of 0 rules in 30 ms. Remains 1357 /1357 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5721 ms. Remains : 1357/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 249 ms :[p0, (AND p0 (NOT p3)), (AND p0 (NOT p3)), p0, (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-05
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-05 finished in 5994 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(F(p0))))'
Support contains 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1340 transition count 296
Applied a total of 40 rules in 31 ms. Remains 1340 /1380 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1340 cols
[2024-05-25 17:09:03] [INFO ] Computed 1045 invariants in 22 ms
[2024-05-25 17:09:05] [INFO ] Implicit Places using invariants in 1403 ms returned []
[2024-05-25 17:09:05] [INFO ] Invariant cache hit.
[2024-05-25 17:09:10] [INFO ] Implicit Places using invariants and state equation in 5372 ms returned [917, 918]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6779 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1380 places, 296/296 transitions.
Applied a total of 0 rules in 28 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6840 ms. Remains : 1338/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-08 finished in 7758 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 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1319 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.7 ms
Discarding 61 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1316 transition count 291
Applied a total of 5 rules in 91 ms. Remains 1316 /1380 variables (removed 64) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1316 cols
[2024-05-25 17:09:11] [INFO ] Computed 1027 invariants in 10 ms
[2024-05-25 17:09:12] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2024-05-25 17:09:12] [INFO ] Invariant cache hit.
[2024-05-25 17:09:14] [INFO ] Implicit Places using invariants and state equation in 2226 ms returned [913, 914, 1155, 1156, 1157, 1158, 1159, 1160, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1276, 1277, 1278, 1279, 1282]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3509 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1380 places, 291/296 transitions.
Applied a total of 0 rules in 111 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3711 ms. Remains : 1295/1380 places, 291/296 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-10
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-10 finished in 3766 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 2 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 958 are kept as prefixes of interest. Removing 422 places using SCC suffix rule.2 ms
Discarding 422 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 921 transition count 221
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 921 transition count 221
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 77 place count 919 transition count 219
Applied a total of 77 rules in 161 ms. Remains 919 /1380 variables (removed 461) and now considering 219/296 (removed 77) transitions.
// Phase 1: matrix 219 rows 919 cols
[2024-05-25 17:09:15] [INFO ] Computed 703 invariants in 4 ms
[2024-05-25 17:09:16] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-25 17:09:16] [INFO ] Invariant cache hit.
[2024-05-25 17:09:18] [INFO ] Implicit Places using invariants and state equation in 2628 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 879, 880, 881, 882, 885]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 3410 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 898/1380 places, 219/296 transitions.
Applied a total of 0 rules in 27 ms. Remains 898 /898 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3598 ms. Remains : 898/1380 places, 219/296 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-11
Product exploration explored 100000 steps with 4210 reset in 241 ms.
Product exploration explored 100000 steps with 4210 reset in 264 ms.
Computed a total of 898 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 898 transition count 219
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-11 finished in 4337 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 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 1320 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.3 ms
Discarding 60 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 1317 transition count 291
Applied a total of 5 rules in 78 ms. Remains 1317 /1380 variables (removed 63) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1317 cols
[2024-05-25 17:09:19] [INFO ] Computed 1028 invariants in 18 ms
[2024-05-25 17:09:20] [INFO ] Implicit Places using invariants in 1337 ms returned []
[2024-05-25 17:09:20] [INFO ] Invariant cache hit.
[2024-05-25 17:09:25] [INFO ] Implicit Places using invariants and state equation in 4372 ms returned [914, 915, 1156, 1157, 1158, 1159, 1160, 1161, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1277, 1278, 1279, 1280, 1283]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 5719 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1296/1380 places, 291/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1296 /1296 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5838 ms. Remains : 1296/1380 places, 291/296 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-12
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-12 finished in 5893 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 1380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 972 are kept as prefixes of interest. Removing 408 places using SCC suffix rule.2 ms
Discarding 408 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 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 971 transition count 282
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 941 transition count 222
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 941 transition count 222
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 71 place count 939 transition count 220
Applied a total of 71 rules in 69 ms. Remains 939 /1380 variables (removed 441) and now considering 220/296 (removed 76) transitions.
// Phase 1: matrix 220 rows 939 cols
[2024-05-25 17:09:25] [INFO ] Computed 721 invariants in 9 ms
[2024-05-25 17:09:26] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-25 17:09:26] [INFO ] Invariant cache hit.
[2024-05-25 17:09:27] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned [516, 517, 758, 759, 760, 761, 762, 763, 766, 767, 768, 769, 770, 771, 772, 773, 899, 900, 901, 902, 905]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 2519 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 918/1380 places, 220/296 transitions.
Applied a total of 0 rules in 24 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2613 ms. Remains : 918/1380 places, 220/296 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-14
Product exploration explored 100000 steps with 4149 reset in 330 ms.
Product exploration explored 100000 steps with 4154 reset in 262 ms.
Computed a total of 918 stabilizing places and 220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 918 transition count 220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
RANDOM walk for 40000 steps (1544 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (72 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2720967 steps, run timeout after 3001 ms. (steps per millisecond=906 ) properties seen :0 out of 1
Probabilistic random walk after 2720967 steps, saw 375799 distinct states, run finished after 3001 ms. (steps per millisecond=906 ) properties seen :0
// Phase 1: matrix 220 rows 918 cols
[2024-05-25 17:09:32] [INFO ] Computed 702 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/62 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/199 variables, 58/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/218 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 19/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 538/756 variables, 420/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/756 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/785 variables, 342/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/785 variables, 29/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 332/1117 variables, 324/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1117 variables, 332/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1117 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 21/1138 variables, 20/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1138 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 1620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/43 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/62 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/199 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/218 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 19/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 538/756 variables, 420/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/756 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 29/785 variables, 342/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/785 variables, 29/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/785 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 332/1117 variables, 324/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1117 variables, 332/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1117 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 21/1138 variables, 20/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1138 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 1621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 414 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 908ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Support contains 1 out of 918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 918/918 places, 220/220 transitions.
Applied a total of 0 rules in 26 ms. Remains 918 /918 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-25 17:09:33] [INFO ] Invariant cache hit.
[2024-05-25 17:09:34] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-25 17:09:34] [INFO ] Invariant cache hit.
[2024-05-25 17:09:35] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2679 ms to find 0 implicit places.
[2024-05-25 17:09:35] [INFO ] Redundant transitions in 28 ms returned [183]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 179 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 918 cols
[2024-05-25 17:09:35] [INFO ] Computed 702 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 219/1117 variables, 898/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1117 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 20/1137 variables, 20/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1137 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 0/1137 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1137/1137 variables, and 1620 constraints, problems are : Problem set: 0 solved, 179 unsolved in 24849 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 219/1117 variables, 898/1600 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1117 variables, 177/1777 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1117 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 20/1137 variables, 20/1797 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1137 variables, 2/1799 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1137/1137 variables, and 1799 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 918/918 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 54991ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 54994ms
Starting structural reductions in SI_LTL mode, iteration 1 : 918/918 places, 219/220 transitions.
Graph (complete) has 8857 edges and 918 vertex of which 195 are kept as prefixes of interest. Removing 723 places using SCC suffix rule.3 ms
Discarding 723 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 177 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 177 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 55 place count 159 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 73 place count 159 transition count 127
Applied a total of 73 rules in 18 ms. Remains 159 /918 variables (removed 759) and now considering 127/219 (removed 92) transitions.
// Phase 1: matrix 127 rows 159 cols
[2024-05-25 17:10:30] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 17:10:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-25 17:10:31] [INFO ] Invariant cache hit.
[2024-05-25 17:10:31] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/918 places, 127/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57987 ms. Remains : 159/918 places, 127/220 transitions.
Computed a total of 159 stabilizing places and 127 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 127
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
RANDOM walk for 40000 steps (1543 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (71 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3065463 steps, run timeout after 3001 ms. (steps per millisecond=1021 ) properties seen :0 out of 1
Probabilistic random walk after 3065463 steps, saw 416601 distinct states, run finished after 3001 ms. (steps per millisecond=1021 ) properties seen :0
[2024-05-25 17:10:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/43 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/62 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 83/145 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/164 variables, 18/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 19/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 103/267 variables, 41/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/286 variables, 19/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/43 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 19/62 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/145 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/164 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 19/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 103/267 variables, 41/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/286 variables, 19/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Product exploration explored 100000 steps with 4158 reset in 232 ms.
Product exploration explored 100000 steps with 4153 reset in 252 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-25 17:10:35] [INFO ] Invariant cache hit.
[2024-05-25 17:10:35] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 17:10:35] [INFO ] Invariant cache hit.
[2024-05-25 17:10:35] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-25 17:10:35] [INFO ] Redundant transitions in 18 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 126 rows 159 cols
[2024-05-25 17:10:35] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 126/265 variables, 139/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 20/285 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 195 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2278 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 126/265 variables, 139/175 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 84/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 20/285 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 281 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3970 ms.
Refiners :[Generalized P Invariants (flows): 36/36 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 6286ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 6287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/159 places, 126/127 transitions.
Graph (complete) has 1011 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 7 ms. Remains 158 /159 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 158 cols
[2024-05-25 17:10:42] [INFO ] Computed 36 invariants in 1 ms
[2024-05-25 17:10:42] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-25 17:10:42] [INFO ] Invariant cache hit.
[2024-05-25 17:10:42] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/159 places, 125/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6812 ms. Remains : 158/159 places, 125/127 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-14 finished in 77094 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((p0 U X(p1))))'
Support contains 4 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 1340 transition count 296
Applied a total of 40 rules in 31 ms. Remains 1340 /1380 variables (removed 40) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1340 cols
[2024-05-25 17:10:42] [INFO ] Computed 1046 invariants in 11 ms
[2024-05-25 17:10:43] [INFO ] Implicit Places using invariants in 1366 ms returned []
[2024-05-25 17:10:43] [INFO ] Invariant cache hit.
[2024-05-25 17:10:47] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned [916, 917]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4835 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1338/1380 places, 296/296 transitions.
Applied a total of 0 rules in 31 ms. Remains 1338 /1338 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4898 ms. Remains : 1338/1380 places, 296/296 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-15
Product exploration explored 100000 steps with 10709 reset in 237 ms.
Product exploration explored 100000 steps with 10771 reset in 251 ms.
Computed a total of 1338 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1338 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (1764 resets) in 148 ms. (268 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
// Phase 1: matrix 296 rows 1338 cols
[2024-05-25 17:10:48] [INFO ] Computed 1044 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/41 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/264 variables, 79/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 219/483 variables, 200/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 19/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 142/625 variables, 142/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 649/1274 variables, 839/1338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1274 variables, 24/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 70/1344 variables, 388/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1344 variables, 70/1820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1344 variables, 0/1820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 272/1616 variables, 272/2092 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1616 variables, 272/2364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 0/2364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 18/1634 variables, 18/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1634 variables, 0/2382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 2382 constraints, problems are : Problem set: 0 solved, 2 unsolved in 707 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/41 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/65 variables, 41/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/264 variables, 79/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 219/483 variables, 200/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 19/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 142/625 variables, 142/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 15 (OVERLAPS) 649/1274 variables, 839/1340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1274 variables, 24/1364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1274 variables, 0/1364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 70/1344 variables, 388/1752 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1344 variables, 70/1822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1344 variables, 0/1822 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 272/1616 variables, 272/2094 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 272/2366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 0/2366 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1634 variables, 18/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1634 variables, 0/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1634 variables, 0/2384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1634/1634 variables, and 2384 constraints, problems are : Problem set: 1 solved, 1 unsolved in 659 ms.
Refiners :[Generalized P Invariants (flows): 1044/1044 constraints, State Equation: 1338/1338 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1389ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-18-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-15 finished in 7897 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||G(p1))))'
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' '!((p0 U X(X(G((p0||X(G((F(G(p1)) U p2)))))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 59 out of 1380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1380/1380 places, 296/296 transitions.
Graph (complete) has 9153 edges and 1380 vertex of which 998 are kept as prefixes of interest. Removing 382 places using SCC suffix rule.8 ms
Discarding 382 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 980 transition count 260
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 980 transition count 260
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 41 place count 978 transition count 258
Applied a total of 41 rules in 75 ms. Remains 978 /1380 variables (removed 402) and now considering 258/296 (removed 38) transitions.
// Phase 1: matrix 258 rows 978 cols
[2024-05-25 17:10:51] [INFO ] Computed 721 invariants in 10 ms
[2024-05-25 17:10:52] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-25 17:10:52] [INFO ] Invariant cache hit.
[2024-05-25 17:10:55] [INFO ] Implicit Places using invariants and state equation in 3272 ms returned [535, 536]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4205 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 976/1380 places, 258/296 transitions.
Applied a total of 0 rules in 34 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4315 ms. Remains : 976/1380 places, 258/296 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 4419 reset in 269 ms.
Product exploration explored 100000 steps with 4417 reset in 287 ms.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 11 states, 22 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1768 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2136091 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :0 out of 1
Probabilistic random walk after 2136091 steps, saw 299245 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
// Phase 1: matrix 258 rows 976 cols
[2024-05-25 17:10:59] [INFO ] Computed 720 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 966ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
Support contains 20 out of 976 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Applied a total of 0 rules in 24 ms. Remains 976 /976 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-25 17:11:00] [INFO ] Invariant cache hit.
[2024-05-25 17:11:01] [INFO ] Implicit Places using invariants in 861 ms returned []
[2024-05-25 17:11:01] [INFO ] Invariant cache hit.
[2024-05-25 17:11:05] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned []
Implicit Place search using SMT with State Equation took 4448 ms to find 0 implicit places.
[2024-05-25 17:11:05] [INFO ] Redundant transitions in 26 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 17:11:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 0/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 21/1234 variables, 21/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/955 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/955 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 258/1213 variables, 955/1675 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1213 variables, 198/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 21/1234 variables, 21/1894 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 40/1934 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1934 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64733 ms. Remains : 976/976 places, 258/258 transitions.
Computed a total of 976 stabilizing places and 258 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 976 transition count 258
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1762 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2155492 steps, run timeout after 3001 ms. (steps per millisecond=718 ) properties seen :0 out of 1
Probabilistic random walk after 2155492 steps, saw 301952 distinct states, run finished after 3001 ms. (steps per millisecond=718 ) properties seen :0
[2024-05-25 17:12:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 480/854 variables, 421/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/854 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/883 variables, 342/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 29/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 332/1215 variables, 324/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1215 variables, 332/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1234 variables, 19/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1234 variables, 0/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1234/1234 variables, and 1696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/81 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 293/374 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 480/854 variables, 421/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/854 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/883 variables, 342/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 29/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 332/1215 variables, 324/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1215 variables, 332/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1215 variables, 0/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 19/1234 variables, 19/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1234 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1234/1234 variables, and 1697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 543 ms.
Refiners :[Generalized P Invariants (flows): 720/720 constraints, State Equation: 976/976 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4417 reset in 242 ms.
Product exploration explored 100000 steps with 4423 reset in 254 ms.
Support contains 20 out of 976 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 976/976 places, 258/258 transitions.
Graph (complete) has 9067 edges and 976 vertex of which 936 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 917 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 917 transition count 218
Applied a total of 39 rules in 40 ms. Remains 917 /976 variables (removed 59) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 917 cols
[2024-05-25 17:12:10] [INFO ] Computed 702 invariants in 14 ms
[2024-05-25 17:12:11] [INFO ] Implicit Places using invariants in 896 ms returned []
[2024-05-25 17:12:11] [INFO ] Invariant cache hit.
[2024-05-25 17:12:13] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
[2024-05-25 17:12:13] [INFO ] Redundant transitions in 24 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-25 17:12:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/1135 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/1135 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1135/1135 variables, and 1619 constraints, problems are : Problem set: 0 solved, 198 unsolved in 27354 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/916 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 218/1134 variables, 916/1618 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1134 variables, 198/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 0/1816 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 1/1135 variables, 1/1817 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/1135 variables, and 1817 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 702/702 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 57491ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 57493ms
Starting structural reductions in SI_LTL mode, iteration 1 : 917/976 places, 218/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60602 ms. Remains : 917/976 places, 218/258 transitions.
Treatment of property QuasiCertifProtocol-PT-18-LTLCardinality-04 finished in 140858 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)))'
[2024-05-25 17:13:11] [INFO ] Flatten gal took : 53 ms
[2024-05-25 17:13:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-25 17:13:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1380 places, 296 transitions and 2988 arcs took 7 ms.
Total runtime 669250 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-18

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1639
MODEL NAME: /home/mcc/execution/412/model
1380 places, 296 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716658900960

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-18"
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-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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