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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 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 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K 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-COL-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716651086061

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:31:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:31:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:31:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 15:31:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 15:31:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-05-25 15:31:27] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 15:31:28] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 15:31:28] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40035 steps (1025 resets) in 485 ms. (82 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (279 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (274 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 15:31:28] [INFO ] Computed 5 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/55 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/55 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 65 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 7 ms.
[2024-05-25 15:31:29] [INFO ] Flatten gal took : 19 ms
[2024-05-25 15:31:29] [INFO ] Flatten gal took : 4 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-25 15:31:29] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 33 ms.
[2024-05-25 15:31:29] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 2820 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Applied a total of 62 rules in 31 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:31:29] [INFO ] Computed 2492 invariants in 160 ms
[2024-05-25 15:31:30] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2024-05-25 15:31:30] [INFO ] Invariant cache hit.
[2024-05-25 15:31:32] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60903ms
Starting structural reductions in LTL mode, iteration 1 : 2936/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63683 ms. Remains : 2936/2998 places, 446/446 transitions.
Support contains 2820 out of 2936 places after structural reductions.
[2024-05-25 15:32:33] [INFO ] Flatten gal took : 219 ms
[2024-05-25 15:32:33] [INFO ] Flatten gal took : 141 ms
[2024-05-25 15:32:34] [INFO ] Input system was already deterministic with 446 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (1208 resets) in 2238 ms. (17 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 480 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 201 ms. (19 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 170 ms. (23 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 237 ms. (16 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
[2024-05-25 15:32:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2790 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2790 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 87/2877 variables, 84/2492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/2877 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 5725ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2790 out of 2936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 57 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 2936/2936 places, 446/446 transitions.
RANDOM walk for 40000 steps (1209 resets) in 1343 ms. (29 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 184 ms. (21 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 110679 steps, run visited all 17 properties in 775 ms. (steps per millisecond=142 )
Probabilistic random walk after 110679 steps, saw 30163 distinct states, run finished after 779 ms. (steps per millisecond=142 ) properties seen :17
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2936 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2936 transition count 446
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(F(p0)))'
Support contains 30 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 256 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:32:43] [INFO ] Invariant cache hit.
[2024-05-25 15:32:47] [INFO ] Implicit Places using invariants in 4385 ms returned []
[2024-05-25 15:32:47] [INFO ] Invariant cache hit.
[2024-05-25 15:32:54] [INFO ] Implicit Places using invariants and state equation in 7258 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11654 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 224 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12134 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 735 ms.
Product exploration explored 100000 steps with 50000 reset in 702 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-00 finished in 14361 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((G(F(p0))||G(p1)))))'
Support contains 1740 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 37 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:32:57] [INFO ] Invariant cache hit.
[2024-05-25 15:32:59] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2024-05-25 15:32:59] [INFO ] Invariant cache hit.
[2024-05-25 15:33:06] [INFO ] Implicit Places using invariants and state equation in 7455 ms returned []
Implicit Place search using SMT with State Equation took 9265 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:33:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60770ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60776ms
Finished structural reductions in LTL mode , in 1 iterations and 70086 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-01
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-01 finished in 70290 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)||F(p1)))'
Support contains 2 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 138 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:34:07] [INFO ] Invariant cache hit.
[2024-05-25 15:34:11] [INFO ] Implicit Places using invariants in 4138 ms returned []
[2024-05-25 15:34:12] [INFO ] Invariant cache hit.
[2024-05-25 15:34:23] [INFO ] Implicit Places using invariants and state equation in 11801 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 15965 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 156 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16260 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-02
Product exploration explored 100000 steps with 7485 reset in 335 ms.
Product exploration explored 100000 steps with 7407 reset in 321 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 55 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 267 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 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 15:34:26] [INFO ] Computed 2464 invariants in 341 ms
[2024-05-25 15:34:33] [INFO ] [Real]Absence check using 0 positive and 2464 generalized place invariants in 6239 ms returned sat
[2024-05-25 15:34:41] [INFO ] [Real]Absence check using state equation in 7912 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2907 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 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 179 are kept as prefixes of interest. Removing 2728 places using SCC suffix rule.29 ms
Discarding 2728 places :
Also discarding 178 output transitions
Drop transitions (Output transitions of discarded places.) removed 178 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 179 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 179 transition count 124
Applied a total of 146 rules in 48 ms. Remains 179 /2907 variables (removed 2728) and now considering 124/446 (removed 322) transitions.
// Phase 1: matrix 124 rows 179 cols
[2024-05-25 15:34:41] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 15:34:41] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 15:34:41] [INFO ] Invariant cache hit.
[2024-05-25 15:34:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-25 15:34:41] [INFO ] Redundant transitions in 23 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-25 15:34:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 124/302 variables, 178/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/303 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 235 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2969 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 124/302 variables, 178/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 93/327 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 328 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3546 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 6562ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 6565ms
Starting structural reductions in SI_LTL mode, iteration 1 : 179/2907 places, 124/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6939 ms. Remains : 179/2907 places, 124/446 transitions.
Computed a total of 179 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 179 transition count 124
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 183 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 :[(NOT p1), (NOT p1)]
RANDOM walk for 68 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 176 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 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
[2024-05-25 15:34:48] [INFO ] Invariant cache hit.
[2024-05-25 15:34:48] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 8 ms returned sat
[2024-05-25 15:34:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-25 15:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:34:49] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 9 ms returned sat
[2024-05-25 15:34:49] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-25 15:34:49] [INFO ] Computed and/alt/rep : 90/119/90 causal constraints (skipped 3 transitions) in 10 ms.
[2024-05-25 15:34:49] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7352 reset in 229 ms.
Product exploration explored 100000 steps with 7343 reset in 295 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 124/124 transitions.
Graph (complete) has 264 edges and 179 vertex of which 90 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.1 ms
Discarding 89 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 90 transition count 62
Applied a total of 31 rules in 3 ms. Remains 90 /179 variables (removed 89) and now considering 62/124 (removed 62) transitions.
// Phase 1: matrix 62 rows 90 cols
[2024-05-25 15:34:49] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 15:34:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-25 15:34:49] [INFO ] Invariant cache hit.
[2024-05-25 15:34:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-25 15:34:50] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-25 15:34:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 61/149 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 3/152 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 118 constraints, problems are : Problem set: 0 solved, 31 unsolved in 504 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 61/149 variables, 88/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 31/147 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 3/152 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 149 constraints, problems are : Problem set: 0 solved, 31 unsolved in 588 ms.
Refiners :[Generalized P Invariants (flows): 28/28 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/179 places, 62/124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1275 ms. Remains : 90/179 places, 62/124 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-02 finished in 43709 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 p1)))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 73 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:34:51] [INFO ] Computed 2492 invariants in 70 ms
[2024-05-25 15:34:54] [INFO ] Implicit Places using invariants in 3382 ms returned []
[2024-05-25 15:34:54] [INFO ] Invariant cache hit.
[2024-05-25 15:35:04] [INFO ] Implicit Places using invariants and state equation in 9936 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 13337 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 78 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13489 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-03 finished in 13615 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(G(p0))&&(p1||G(F(p2))))))'
Support contains 1741 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 40 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:35:05] [INFO ] Invariant cache hit.
[2024-05-25 15:35:07] [INFO ] Implicit Places using invariants in 2541 ms returned []
[2024-05-25 15:35:07] [INFO ] Invariant cache hit.
[2024-05-25 15:35:16] [INFO ] Implicit Places using invariants and state equation in 9294 ms returned []
Implicit Place search using SMT with State Equation took 11840 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:35:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3382 variables, and 2492 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 0/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3381 variables, 2935/5427 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3381 variables, 416/5843 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3381/3382 variables, and 5843 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2935/2936 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60682ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Finished structural reductions in LTL mode , in 1 iterations and 72576 ms. Remains : 2936/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-04
Stuttering criterion allowed to conclude after 2090 steps with 62 reset in 23 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-04 finished in 72860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1 U G(!p1))))))'
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 139 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:36:18] [INFO ] Invariant cache hit.
[2024-05-25 15:36:21] [INFO ] Implicit Places using invariants in 3939 ms returned []
[2024-05-25 15:36:21] [INFO ] Invariant cache hit.
[2024-05-25 15:36:28] [INFO ] Implicit Places using invariants and state equation in 6998 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 10948 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 166 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11253 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05
Product exploration explored 100000 steps with 3022 reset in 524 ms.
Product exploration explored 100000 steps with 3025 reset in 472 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1212 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (56 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (44 resets) in 1884 ms. (21 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 84 ms. (steps per millisecond=86 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 86 ms. (steps per millisecond=84 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 118 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 15:36:32] [INFO ] Computed 2464 invariants in 251 ms
[2024-05-25 15:36:36] [INFO ] Implicit Places using invariants in 4306 ms returned []
[2024-05-25 15:36:36] [INFO ] Invariant cache hit.
[2024-05-25 15:36:43] [INFO ] Implicit Places using invariants and state equation in 6738 ms returned []
Implicit Place search using SMT with State Equation took 11050 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:36:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60710ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60716ms
Finished structural reductions in LTL mode , in 1 iterations and 71912 ms. Remains : 2907/2907 places, 446/446 transitions.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1208 resets) in 763 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (43 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7296 steps, run visited all 2 properties in 90 ms. (steps per millisecond=81 )
Probabilistic random walk after 7296 steps, saw 7147 distinct states, run finished after 91 ms. (steps per millisecond=80 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 3030 reset in 431 ms.
Product exploration explored 100000 steps with 3020 reset in 455 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Graph (complete) has 28309 edges and 2907 vertex of which 2877 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.25 ms
Discarding 30 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 9 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2877 transition count 446
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 477 ms. Remains 2877 /2907 variables (removed 30) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:37:47] [INFO ] Redundant transitions in 52 ms returned []
Running 416 sub problems to find dead transitions.
// Phase 1: matrix 446 rows 2877 cols
[2024-05-25 15:37:47] [INFO ] Computed 2436 invariants in 283 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2876/3323 variables, and 2436 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 0/2877 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2876 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2876 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 2 (OVERLAPS) 446/3322 variables, 2876/5312 constraints. Problems are: Problem set: 4 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3322 variables, 412/5724 constraints. Problems are: Problem set: 4 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3322/3323 variables, and 5724 constraints, problems are : Problem set: 4 solved, 412 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 2436/2436 constraints, State Equation: 2876/2877 constraints, PredecessorRefiner: 412/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 61018ms problems are : Problem set: 4 solved, 412 unsolved
Search for dead transitions found 4 dead transitions in 61023ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 2877/2907 places, 442/446 transitions.
Graph (complete) has 29901 edges and 2877 vertex of which 2875 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 255 ms. Remains 2875 /2877 variables (removed 2) and now considering 442/442 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 2875/2907 places, 442/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61817 ms. Remains : 2875/2907 places, 442/446 transitions.
Support contains 59 out of 2907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2907/2907 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2907 cols
[2024-05-25 15:38:49] [INFO ] Computed 2464 invariants in 236 ms
[2024-05-25 15:38:53] [INFO ] Implicit Places using invariants in 4254 ms returned []
[2024-05-25 15:38:53] [INFO ] Invariant cache hit.
[2024-05-25 15:39:00] [INFO ] Implicit Places using invariants and state equation in 6949 ms returned []
Implicit Place search using SMT with State Equation took 11226 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-25 15:39:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2906/3353 variables, and 2464 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2906 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2906 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 446/3352 variables, 2906/5370 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3352 variables, 416/5786 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3352/3353 variables, and 5786 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2906/2907 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in LTL mode , in 1 iterations and 72052 ms. Remains : 2907/2907 places, 446/446 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 223284 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 1 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 179 are kept as prefixes of interest. Removing 2757 places using SCC suffix rule.8 ms
Discarding 2757 places :
Also discarding 178 output transitions
Drop transitions (Output transitions of discarded places.) removed 178 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 178 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 178 transition count 123
Applied a total of 146 rules in 19 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-25 15:40:01] [INFO ] Computed 56 invariants in 0 ms
[2024-05-25 15:40:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-25 15:40:01] [INFO ] Invariant cache hit.
[2024-05-25 15:40:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 294 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-06
Product exploration explored 100000 steps with 2786 reset in 359 ms.
Product exploration explored 100000 steps with 2789 reset in 366 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-06 finished in 1233 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(F(p0))||G((!p0||X(G(p1))))))'
Support contains 31 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 153 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:40:02] [INFO ] Computed 2492 invariants in 57 ms
[2024-05-25 15:40:06] [INFO ] Implicit Places using invariants in 4136 ms returned []
[2024-05-25 15:40:06] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants and state equation in 12249 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 16389 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 146 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16688 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-07
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-07 finished in 16838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p0)&&F(G(p1))))))'
Support contains 871 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.7 ms
Discarding 30 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Applied a total of 3 rules in 195 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-25 15:40:19] [INFO ] Computed 2464 invariants in 44 ms
[2024-05-25 15:40:22] [INFO ] Implicit Places using invariants in 3446 ms returned []
[2024-05-25 15:40:22] [INFO ] Invariant cache hit.
[2024-05-25 15:40:41] [INFO ] Implicit Places using invariants and state equation in 18948 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 22421 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 91 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22708 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-08
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-08 finished in 22901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(X(!p1))&&F(p2)))))'
Support contains 930 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 74 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:40:42] [INFO ] Computed 2492 invariants in 54 ms
[2024-05-25 15:40:45] [INFO ] Implicit Places using invariants in 3279 ms returned []
[2024-05-25 15:40:45] [INFO ] Invariant cache hit.
[2024-05-25 15:40:50] [INFO ] Implicit Places using invariants and state equation in 4700 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 7983 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 84 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8142 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 533 ms :[(NOT p0), true, p1, (NOT p2), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0)), p1, p1, (AND (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-09
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-09 finished in 8706 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(F((G(F(p1))||p0))))'
Support contains 60 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 143 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 15:40:51] [INFO ] Invariant cache hit.
[2024-05-25 15:40:54] [INFO ] Implicit Places using invariants in 3974 ms returned []
[2024-05-25 15:40:54] [INFO ] Invariant cache hit.
[2024-05-25 15:41:02] [INFO ] Implicit Places using invariants and state equation in 7492 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11477 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 150 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11772 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 642 ms.
Product exploration explored 100000 steps with 50000 reset in 652 ms.
Computed a total of 2907 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2907 transition count 446
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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-10 finished in 13758 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 1 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 180 are kept as prefixes of interest. Removing 2756 places using SCC suffix rule.11 ms
Discarding 2756 places :
Also discarding 176 output transitions
Drop transitions (Output transitions of discarded places.) removed 176 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 179 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 178 transition count 123
Applied a total of 148 rules in 19 ms. Remains 178 /2936 variables (removed 2758) and now considering 123/446 (removed 323) transitions.
// Phase 1: matrix 123 rows 178 cols
[2024-05-25 15:41:04] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 15:41:04] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-25 15:41:04] [INFO ] Invariant cache hit.
[2024-05-25 15:41:04] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 289 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/2936 places, 123/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 149/2936 places, 123/446 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-13
Product exploration explored 100000 steps with 2789 reset in 315 ms.
Product exploration explored 100000 steps with 2785 reset in 329 ms.
Computed a total of 149 stabilizing places and 123 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 149 transition count 123
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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-13 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
Support contains 929 out of 2936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.14 ms
Discarding 30 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2904 transition count 442
Applied a total of 3 rules in 178 ms. Remains 2904 /2936 variables (removed 32) and now considering 442/446 (removed 4) transitions.
// Phase 1: matrix 442 rows 2904 cols
[2024-05-25 15:41:05] [INFO ] Computed 2464 invariants in 56 ms
[2024-05-25 15:41:09] [INFO ] Implicit Places using invariants in 3353 ms returned []
[2024-05-25 15:41:09] [INFO ] Invariant cache hit.
[2024-05-25 15:41:28] [INFO ] Implicit Places using invariants and state equation in 18923 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 22282 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2846/2936 places, 442/446 transitions.
Applied a total of 0 rules in 103 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22563 ms. Remains : 2846/2936 places, 442/446 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0 (NOT p1)), p0]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-14
Product exploration explored 100000 steps with 2816 reset in 668 ms.
Product exploration explored 100000 steps with 2814 reset in 711 ms.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR p1 (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 129 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) p2), true, (AND p0 p2), (AND (NOT p1) p2), (AND p0 p2 (NOT p1)), p0]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1123 resets) in 1200 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 1444 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 996 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 980 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 936 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 176 ms. (226 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 915 ms. (43 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 360735 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :6 out of 9
Probabilistic random walk after 360735 steps, saw 65972 distinct states, run finished after 3005 ms. (steps per millisecond=120 ) properties seen :6
// Phase 1: matrix 442 rows 2846 cols
[2024-05-25 15:41:36] [INFO ] Computed 2408 invariants in 598 ms
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/929 variables, 784/784 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/929 variables, 0/784 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 206/1135 variables, 929/1713 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1135 variables, 0/1713 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2063/3198 variables, 1829/3542 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3198 variables, 1624/5166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3198 variables, 0/5166 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Real declared 3288/3288 variables, and 5254 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1177 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2846/2846 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2061ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR p1 (NOT p2) p0)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (OR p1 (NOT p2) p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p2)))), (F p2), (F p1)]
Knowledge based reduction with 28 factoid took 388 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND p0 p2), p0]
Stuttering acceptance computed with spot in 89 ms :[true, (AND p0 p2), p0]
Support contains 59 out of 2846 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 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 88 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-25 15:41:38] [INFO ] Invariant cache hit.
[2024-05-25 15:41:41] [INFO ] Implicit Places using invariants in 3301 ms returned []
[2024-05-25 15:41:41] [INFO ] Invariant cache hit.
[2024-05-25 15:42:03] [INFO ] Implicit Places using invariants and state equation in 21673 ms returned []
Implicit Place search using SMT with State Equation took 24987 ms to find 0 implicit places.
[2024-05-25 15:42:03] [INFO ] Redundant transitions in 22 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-25 15:42:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2817/3288 variables, and 2408 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2817 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 442/3259 variables, 2817/5225 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3259 variables, 383/5608 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3259/3288 variables, and 5608 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2817/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
After SMT, in 60695ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85812 ms. Remains : 2846/2846 places, 442/442 transitions.
Computed a total of 2846 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2846 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 165 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, p0, (AND p0 p2)]
RANDOM walk for 40000 steps (1122 resets) in 977 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 513039 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :3 out of 4
Probabilistic random walk after 513039 steps, saw 84618 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :3
[2024-05-25 15:43:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/149 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 352/501 variables, 118/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 28/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 1606/3288 variables, and 1192 constraints, problems are : Problem set: 1 solved, 0 unsolved in 334 ms.
Refiners :[Generalized P Invariants (flows): 28/2408 constraints, State Equation: 1164/2846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 12 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 70 ms :[true, p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 76 ms :[true, p0, (AND p0 p2)]
Product exploration explored 100000 steps with 2816 reset in 660 ms.
Product exploration explored 100000 steps with 2817 reset in 692 ms.
Support contains 59 out of 2846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2846/2846 places, 442/442 transitions.
Applied a total of 0 rules in 193 ms. Remains 2846 /2846 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-25 15:43:11] [INFO ] Invariant cache hit.
[2024-05-25 15:43:15] [INFO ] Implicit Places using invariants in 4199 ms returned []
[2024-05-25 15:43:15] [INFO ] Invariant cache hit.
[2024-05-25 15:43:40] [INFO ] Implicit Places using invariants and state equation in 25059 ms returned []
Implicit Place search using SMT with State Equation took 29271 ms to find 0 implicit places.
[2024-05-25 15:43:40] [INFO ] Redundant transitions in 31 ms returned []
Running 383 sub problems to find dead transitions.
[2024-05-25 15:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2817/3288 variables, and 2408 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2817 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2817 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 442/3259 variables, 2817/5225 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3259 variables, 383/5608 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3259/3288 variables, and 5608 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2817/2846 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
After SMT, in 60759ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 90274 ms. Remains : 2846/2846 places, 442/442 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-14 finished in 215772 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(G(p0))))'
Support contains 870 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Applied a total of 0 rules in 79 ms. Remains 2936 /2936 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:44:41] [INFO ] Computed 2492 invariants in 54 ms
[2024-05-25 15:44:44] [INFO ] Implicit Places using invariants in 2640 ms returned []
[2024-05-25 15:44:44] [INFO ] Invariant cache hit.
[2024-05-25 15:44:53] [INFO ] Implicit Places using invariants and state equation in 8846 ms returned [2727, 2728, 2729, 2730, 2731, 2732, 2733, 2734, 2735, 2736, 2737, 2738, 2739, 2740, 2741, 2742, 2743, 2744, 2745, 2746, 2747, 2748, 2749, 2750, 2751, 2752, 2753, 2754, 2755]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 11492 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2907/2936 places, 446/446 transitions.
Applied a total of 0 rules in 79 ms. Remains 2907 /2907 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11652 ms. Remains : 2907/2936 places, 446/446 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-15 finished in 11887 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)||F(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' '!(G((p0||X((p1 U G(!p1))))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-28-LTLFireability-05
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2936 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2936/2936 places, 446/446 transitions.
Graph (complete) has 29179 edges and 2936 vertex of which 2906 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.13 ms
Discarding 30 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 2903 transition count 441
Applied a total of 5 rules in 365 ms. Remains 2903 /2936 variables (removed 33) and now considering 441/446 (removed 5) transitions.
// Phase 1: matrix 441 rows 2903 cols
[2024-05-25 15:44:54] [INFO ] Computed 2464 invariants in 51 ms
[2024-05-25 15:44:58] [INFO ] Implicit Places using invariants in 4208 ms returned []
[2024-05-25 15:44:58] [INFO ] Invariant cache hit.
[2024-05-25 15:45:05] [INFO ] Implicit Places using invariants and state equation in 7340 ms returned [2640, 2641, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2698, 2699, 2700, 2701, 2702, 2703, 2704, 2705, 2706, 2707, 2708, 2709, 2710, 2711, 2712, 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2722, 2723, 2724, 2725, 2726]
Discarding 58 places :
Implicit Place search using SMT with State Equation took 11561 ms to find 58 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2845/2936 places, 441/446 transitions.
Applied a total of 0 rules in 162 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12089 ms. Remains : 2845/2936 places, 441/446 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-28-LTLFireability-05
Product exploration explored 100000 steps with 2811 reset in 471 ms.
Product exploration explored 100000 steps with 2814 reset in 493 ms.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1125 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (29 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 89 ms. (steps per millisecond=79 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 90 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 209 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 140 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 2845 cols
[2024-05-25 15:45:08] [INFO ] Computed 2408 invariants in 534 ms
[2024-05-25 15:45:13] [INFO ] Implicit Places using invariants in 4633 ms returned []
[2024-05-25 15:45:13] [INFO ] Invariant cache hit.
[2024-05-25 15:45:20] [INFO ] Implicit Places using invariants and state equation in 7158 ms returned []
Implicit Place search using SMT with State Equation took 11803 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 15:45:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Finished structural reductions in LTL mode , in 1 iterations and 72646 ms. Remains : 2845/2845 places, 441/441 transitions.
Computed a total of 2845 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2845 transition count 441
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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), p1]
RANDOM walk for 40000 steps (1125 resets) in 883 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7113 steps, run visited all 2 properties in 87 ms. (steps per millisecond=81 )
Probabilistic random walk after 7113 steps, saw 6968 distinct states, run finished after 89 ms. (steps per millisecond=79 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), p1]
Stuttering acceptance computed with spot in 137 ms :[true, p1, (AND p1 (NOT p0)), p1]
Product exploration explored 100000 steps with 2811 reset in 488 ms.
Product exploration explored 100000 steps with 2813 reset in 494 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 (NOT p0)), p1]
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 160 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 15:46:24] [INFO ] Redundant transitions in 29 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-25 15:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60685ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60892 ms. Remains : 2845/2845 places, 441/441 transitions.
Support contains 59 out of 2845 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2845/2845 places, 441/441 transitions.
Applied a total of 0 rules in 136 ms. Remains 2845 /2845 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-25 15:47:25] [INFO ] Invariant cache hit.
[2024-05-25 15:47:29] [INFO ] Implicit Places using invariants in 4053 ms returned []
[2024-05-25 15:47:29] [INFO ] Invariant cache hit.
[2024-05-25 15:47:35] [INFO ] Implicit Places using invariants and state equation in 6886 ms returned []
Implicit Place search using SMT with State Equation took 10970 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-25 15:47:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2816/3286 variables, and 2408 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2816 variables, 2408/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2816 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 441/3257 variables, 2816/5224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3257 variables, 382/5606 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3257/3286 variables, and 5606 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2408/2408 constraints, State Equation: 2816/2845 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Finished structural reductions in LTL mode , in 1 iterations and 71802 ms. Remains : 2845/2845 places, 441/441 transitions.
Treatment of property QuasiCertifProtocol-COL-28-LTLFireability-05 finished in 223345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U ((!p2&&X(G((!p2||G(!p0)))))||p1))))'
[2024-05-25 15:48:37] [INFO ] Flatten gal took : 105 ms
[2024-05-25 15:48:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2024-05-25 15:48:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2936 places, 446 transitions and 6222 arcs took 10 ms.
Total runtime 1029868 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-28

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 1783
MODEL NAME: /home/mcc/execution/413/model
2936 places, 446 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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-COL-28"
export BK_EXAMINATION="LTLFireability"
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-COL-28, examination is LTLFireability"
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-171662335700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;