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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 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.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 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 93K 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-18-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716647219176

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:27:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:27:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:27:00] [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 14:27:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:27:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 571 ms
[2024-05-25 14:27:01] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 33 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 14:27:01] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-25 14:27:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 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 40020 steps (1461 resets) in 890 ms. (44 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (423 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (421 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (421 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (527 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (423 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (421 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:27:02] [INFO ] Computed 5 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/56 variables, 6/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 1 solved, 5 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 17/23 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 23/28 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/56 variables, 7/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 40 constraints, problems are : Problem set: 1 solved, 5 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=42 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-25 14:27:02] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:27:02] [INFO ] Flatten gal took : 6 ms
Domain [tsid(19), tsid(19)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:27:02] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 28 ms.
[2024-05-25 14:27:02] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 955 out of 1398 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1356 transition count 296
Applied a total of 42 rules in 56 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-25 14:27:02] [INFO ] Computed 1062 invariants in 52 ms
[2024-05-25 14:27:04] [INFO ] Implicit Places using invariants in 1165 ms returned []
[2024-05-25 14:27:04] [INFO ] Invariant cache hit.
[2024-05-25 14:27:05] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 14:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1652 variables, 1/2418 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1651 variables, 0/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SMT process timed out in 60551ms, After SMT, problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Starting structural reductions in LTL mode, iteration 1 : 1356/1398 places, 296/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63088 ms. Remains : 1356/1398 places, 296/296 transitions.
Support contains 955 out of 1356 places after structural reductions.
[2024-05-25 14:28:06] [INFO ] Flatten gal took : 101 ms
[2024-05-25 14:28:06] [INFO ] Flatten gal took : 77 ms
[2024-05-25 14:28:06] [INFO ] Input system was already deterministic with 296 transitions.
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (1767 resets) in 956 ms. (41 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
[2024-05-25 14:28:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/917 variables, 702/702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/917 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 361/1278 variables, 342/1044 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1278 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 295/1573 variables, 1278/2322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1573 variables, 0/2322 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 79/1652 variables, 78/2400 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1652 variables, 18/2418 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 684/684 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 0/684 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 380/1278 variables, 360/1044 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1278 variables, 0/1044 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 295/1573 variables, 1278/2322 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1573 variables, 8/2330 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1573/1652 variables, and 2330 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 1044/1062 constraints, State Equation: 1278/1356 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 10152ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 898 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1356 transition count 295
Applied a total of 1 rules in 49 ms. Remains 1356 /1356 variables (removed 0) and now considering 295/296 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1356/1356 places, 295/296 transitions.
RANDOM walk for 40000 steps (1764 resets) in 893 ms. (44 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (130 resets) in 418 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (120 resets) in 422 ms. (94 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (126 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (93 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (121 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (125 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (93 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (132 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (162 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (117 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (123 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (96 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 4745 steps, run visited all 14 properties in 142 ms. (steps per millisecond=33 )
Probabilistic random walk after 4745 steps, saw 4609 distinct states, run finished after 151 ms. (steps per millisecond=31 ) properties seen :14
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1356 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1356 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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)||X(G(p1))||(X(p3)&&p2))))'
Support contains 761 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 17 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-25 14:28:18] [INFO ] Invariant cache hit.
[2024-05-25 14:28:19] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-05-25 14:28:19] [INFO ] Invariant cache hit.
[2024-05-25 14:28:27] [INFO ] Implicit Places using invariants and state equation in 7440 ms returned []
Implicit Place search using SMT with State Equation took 8306 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-25 14:28:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 0/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/1652 variables, 1/2418 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1355 variables, 1062/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1355 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 296/1651 variables, 1355/2417 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1651 variables, 276/2693 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/1652 variables, and 2693 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1355/1356 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Finished structural reductions in LTL mode , in 1 iterations and 68667 ms. Remains : 1356/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-00
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-00 finished in 69093 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((G((p1||X(p2)))||p0)))'
Support contains 22 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 127 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-25 14:29:27] [INFO ] Invariant cache hit.
[2024-05-25 14:29:29] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2024-05-25 14:29:29] [INFO ] Invariant cache hit.
[2024-05-25 14:29:31] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3457 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 39 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3624 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-01 finished in 3870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.18 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1333 transition count 291
Applied a total of 5 rules in 143 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-25 14:29:31] [INFO ] Computed 1044 invariants in 33 ms
[2024-05-25 14:29:33] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2024-05-25 14:29:33] [INFO ] Invariant cache hit.
[2024-05-25 14:29:35] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3287 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 55 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3485 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-04
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-04 finished in 3596 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)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-25 14:29:35] [INFO ] Computed 1062 invariants in 24 ms
[2024-05-25 14:29:36] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2024-05-25 14:29:36] [INFO ] Invariant cache hit.
[2024-05-25 14:29:44] [INFO ] Implicit Places using invariants and state equation in 7998 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 9293 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 33 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9364 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 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-18-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-05 finished in 10476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(!p0))))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-25 14:29:45] [INFO ] Invariant cache hit.
[2024-05-25 14:29:47] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-25 14:29:47] [INFO ] Invariant cache hit.
[2024-05-25 14:29:49] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3353 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 35 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3425 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), p0, p0, true]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-06 finished in 3632 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 21 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.8 ms
Discarding 20 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1334 transition count 292
Applied a total of 5 rules in 117 ms. Remains 1334 /1356 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-25 14:29:49] [INFO ] Computed 1044 invariants in 23 ms
[2024-05-25 14:29:50] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2024-05-25 14:29:50] [INFO ] Invariant cache hit.
[2024-05-25 14:29:52] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3204 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1356 places, 292/296 transitions.
Applied a total of 0 rules in 50 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3372 ms. Remains : 1315/1356 places, 292/296 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-07
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-07 finished in 3436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1||G(p2))))))'
Support contains 439 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1355 transition count 295
Applied a total of 2 rules in 62 ms. Remains 1355 /1356 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 1355 cols
[2024-05-25 14:29:52] [INFO ] Computed 1062 invariants in 24 ms
[2024-05-25 14:29:53] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-05-25 14:29:53] [INFO ] Invariant cache hit.
[2024-05-25 14:29:55] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned [1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 2728 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1336/1356 places, 295/296 transitions.
Applied a total of 0 rules in 37 ms. Remains 1336 /1336 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2827 ms. Remains : 1336/1356 places, 295/296 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-08
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-08 finished in 2977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 39 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1334 transition count 292
Applied a total of 5 rules in 94 ms. Remains 1334 /1356 variables (removed 22) and now considering 292/296 (removed 4) transitions.
// Phase 1: matrix 292 rows 1334 cols
[2024-05-25 14:29:55] [INFO ] Computed 1044 invariants in 14 ms
[2024-05-25 14:29:57] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2024-05-25 14:29:57] [INFO ] Invariant cache hit.
[2024-05-25 14:30:03] [INFO ] Implicit Places using invariants and state equation in 6079 ms returned [1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 7324 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1315/1356 places, 292/296 transitions.
Applied a total of 0 rules in 48 ms. Remains 1315 /1315 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7467 ms. Remains : 1315/1356 places, 292/296 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-09
Product exploration explored 100000 steps with 4952 reset in 392 ms.
Product exploration explored 100000 steps with 4964 reset in 425 ms.
Computed a total of 1315 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1315 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-09 finished in 8694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 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 1333 transition count 291
Applied a total of 5 rules in 91 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-25 14:30:04] [INFO ] Computed 1044 invariants in 22 ms
[2024-05-25 14:30:05] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-05-25 14:30:05] [INFO ] Invariant cache hit.
[2024-05-25 14:30:07] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3337 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 54 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3483 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-10
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-10 finished in 3589 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(G((!p0||X(F(p1))))))'
Support contains 76 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-25 14:30:08] [INFO ] Computed 1062 invariants in 23 ms
[2024-05-25 14:30:09] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2024-05-25 14:30:09] [INFO ] Invariant cache hit.
[2024-05-25 14:30:17] [INFO ] Implicit Places using invariants and state equation in 7921 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 9156 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 36 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9229 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-11
Product exploration explored 100000 steps with 4414 reset in 347 ms.
Product exploration explored 100000 steps with 4422 reset in 289 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 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-18-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-11 finished in 10256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 1336 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Discarding 20 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 1333 transition count 291
Applied a total of 5 rules in 96 ms. Remains 1333 /1356 variables (removed 23) and now considering 291/296 (removed 5) transitions.
// Phase 1: matrix 291 rows 1333 cols
[2024-05-25 14:30:18] [INFO ] Computed 1044 invariants in 21 ms
[2024-05-25 14:30:19] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2024-05-25 14:30:19] [INFO ] Invariant cache hit.
[2024-05-25 14:30:21] [INFO ] Implicit Places using invariants and state equation in 1942 ms returned [1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 3272 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1356 places, 291/296 transitions.
Applied a total of 0 rules in 49 ms. Remains 1295 /1295 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3418 ms. Remains : 1295/1356 places, 291/296 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-12
Product exploration explored 100000 steps with 4211 reset in 290 ms.
Product exploration explored 100000 steps with 4208 reset in 297 ms.
Computed a total of 1295 stabilizing places and 291 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1295 transition count 291
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 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-18-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-12 finished in 4295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(X(F(p0))&&p1)))))'
Support contains 40 out of 1356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Applied a total of 0 rules in 47 ms. Remains 1356 /1356 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 1356 cols
[2024-05-25 14:30:22] [INFO ] Computed 1062 invariants in 24 ms
[2024-05-25 14:30:23] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-25 14:30:23] [INFO ] Invariant cache hit.
[2024-05-25 14:30:26] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned [1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 3359 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1337/1356 places, 296/296 transitions.
Applied a total of 0 rules in 41 ms. Remains 1337 /1337 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3448 ms. Remains : 1337/1356 places, 296/296 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-18-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 524 ms.
Product exploration explored 100000 steps with 50000 reset in 547 ms.
Computed a total of 1337 stabilizing places and 296 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1337 transition count 296
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-18-LTLFireability-13 finished in 4913 ms.
All properties solved by simple procedures.
Total runtime 207188 ms.
ITS solved all properties within timeout

BK_STOP 1716647427952

--------------------
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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="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-18, 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-171662335700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 execution
cd execution
if [ "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 ;