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.r312-tall-171662337700068.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 itstools
Input is QuasiCertifProtocol-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 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 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716664185092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 19:09:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:09:46] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-25 19:09:46] [INFO ] Transformed 270 places.
[2024-05-25 19:09:46] [INFO ] Transformed 116 transitions.
[2024-05-25 19:09:46] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 140 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 36 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 19:09:46] [INFO ] Computed 138 invariants in 31 ms
[2024-05-25 19:09:47] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-25 19:09:47] [INFO ] Invariant cache hit.
[2024-05-25 19:09:47] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 19:09:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/368 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4706 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/367 variables, 251/389 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 108/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/368 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 498 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6654 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11478ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11493ms
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12185 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 140 out of 252 places after structural reductions.
[2024-05-25 19:09:59] [INFO ] Flatten gal took : 38 ms
[2024-05-25 19:09:59] [INFO ] Flatten gal took : 17 ms
[2024-05-25 19:09:59] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3935 resets) in 1886 ms. (21 steps per ms) remains 22/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 116 ms. (34 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (69 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (42 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (69 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (67 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (70 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (67 resets) in 83 ms. (47 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (69 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (74 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (65 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (70 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (73 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (67 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (71 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
[2024-05-25 19:10:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 24/156 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 30/186 variables, 25/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 109/295 variables, 186/288 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/288 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 8 (OVERLAPS) 73/368 variables, 66/354 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 36/390 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/368 variables, 0/390 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 390 constraints, problems are : Problem set: 4 solved, 18 unsolved in 1137 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 29/143 variables, 75/76 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/76 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 20/163 variables, 20/96 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/96 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 99/262 variables, 163/259 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 8/267 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/267 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 88/350 variables, 73/340 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 36/376 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 10/386 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/386 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 17/367 variables, 15/401 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/367 variables, 6/407 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 0/407 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 1/368 variables, 1/408 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 0/408 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/368 variables, 0/408 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 408 constraints, problems are : Problem set: 4 solved, 18 unsolved in 2646 ms.
Refiners :[Generalized P Invariants (flows): 138/138 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 18/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 3815ms problems are : Problem set: 4 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 405 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
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' '!(F((G(p0)&&X(G(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 242 transition count 112
Applied a total of 3 rules in 39 ms. Remains 242 /252 variables (removed 10) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 242 cols
[2024-05-25 19:10:04] [INFO ] Computed 132 invariants in 6 ms
[2024-05-25 19:10:04] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-25 19:10:04] [INFO ] Invariant cache hit.
[2024-05-25 19:10:05] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [145, 146, 147, 148, 152, 157, 158, 195, 196, 220, 221, 222, 223, 224]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 394 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 112/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 228/252 places, 112/116 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 10243 reset in 380 ms.
Product exploration explored 100000 steps with 10267 reset in 272 ms.
Computed a total of 228 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 228 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 168 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-01 finished in 1806 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&&G(p1)&&(F(p2) U p3))))'
Support contains 25 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 19:10:06] [INFO ] Computed 138 invariants in 3 ms
[2024-05-25 19:10:06] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-25 19:10:06] [INFO ] Invariant cache hit.
[2024-05-25 19:10:06] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 343 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 353 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-03
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-03 finished in 640 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(p1)||p0)))'
Support contains 64 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 241 transition count 111
Applied a total of 5 rules in 14 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 19:10:07] [INFO ] Computed 132 invariants in 5 ms
[2024-05-25 19:10:07] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-25 19:10:07] [INFO ] Invariant cache hit.
[2024-05-25 19:10:07] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [194, 195, 219, 220, 221, 222, 223]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 326 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/252 places, 111/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 348 ms. Remains : 234/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 10256 reset in 244 ms.
Product exploration explored 100000 steps with 10249 reset in 253 ms.
Computed a total of 234 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 234 transition count 111
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-04 finished in 990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 173 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.2 ms
Discarding 79 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 172 transition count 84
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 17 place count 171 transition count 83
Applied a total of 17 rules in 18 ms. Remains 171 /252 variables (removed 81) and now considering 83/116 (removed 33) transitions.
// Phase 1: matrix 83 rows 171 cols
[2024-05-25 19:10:08] [INFO ] Computed 90 invariants in 2 ms
[2024-05-25 19:10:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-25 19:10:08] [INFO ] Invariant cache hit.
[2024-05-25 19:10:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [81, 82, 83, 84, 87, 92, 93, 126, 127, 149, 150, 151, 152, 153]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 260 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/252 places, 83/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 157/252 places, 83/116 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 10009 reset in 159 ms.
Product exploration explored 100000 steps with 9986 reset in 162 ms.
Computed a total of 157 stabilizing places and 83 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 157 transition count 83
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-05 finished in 775 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||G(F(p1)))))'
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 19:10:08] [INFO ] Computed 138 invariants in 7 ms
[2024-05-25 19:10:09] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-25 19:10:09] [INFO ] Invariant cache hit.
[2024-05-25 19:10:09] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 386 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (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 7 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-06 finished in 1033 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(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 5 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:10:09] [INFO ] Invariant cache hit.
[2024-05-25 19:10:10] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 19:10:10] [INFO ] Invariant cache hit.
[2024-05-25 19:10:10] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 345 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (NOT p1), (AND p2 (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 245 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 245 transition count 116
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 p3 (NOT p2) p1), (X (NOT (OR (NOT p0) (AND (NOT p3) p2)))), (X (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p3), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 p3) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) p2 (NOT p1))))), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (AND (NOT p3) p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 p3) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p3 (NOT p1)) (AND p0 (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) p2 (NOT p1)))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p3)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 166 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-08 finished in 1262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((!p0 U (G(!p0)||(!p0&&G(!p1))))))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:10:11] [INFO ] Invariant cache hit.
[2024-05-25 19:10:11] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-25 19:10:11] [INFO ] Invariant cache hit.
[2024-05-25 19:10:11] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [147, 148, 149, 150, 154, 160]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 383 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 246/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 391 ms. Remains : 246/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, p0, (AND p0 p1), p1, p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-09
Product exploration explored 100000 steps with 9832 reset in 130 ms.
Product exploration explored 100000 steps with 9832 reset in 134 ms.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
RANDOM walk for 40000 steps (3936 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (716 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (715 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (711 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (701 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (692 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (703 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 855482 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :0 out of 6
Probabilistic random walk after 855482 steps, saw 140038 distinct states, run finished after 3004 ms. (steps per millisecond=284 ) properties seen :0
// Phase 1: matrix 116 rows 246 cols
[2024-05-25 19:10:16] [INFO ] Computed 132 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 53/100 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/122 variables, 100/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/219 variables, 28/206 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 100/319 variables, 84/290 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 42/332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 36/355 variables, 30/362 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 12/374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 7/362 variables, 4/378 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 1 solved, 5 unsolved in 448 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 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/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 53/100 variables, 53/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/122 variables, 100/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 97/219 variables, 28/206 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 5/211 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 100/319 variables, 84/295 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 42/337 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/355 variables, 30/367 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 12/379 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/379 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 7/362 variables, 4/383 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/362 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 383 constraints, problems are : Problem set: 1 solved, 5 unsolved in 534 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 995ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
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 37 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 252 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 246/246 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:10:17] [INFO ] Invariant cache hit.
[2024-05-25 19:10:17] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-25 19:10:17] [INFO ] Invariant cache hit.
[2024-05-25 19:10:18] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-25 19:10:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/361 variables, 245/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/362 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4023 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 116/361 variables, 245/377 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 108/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/362 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 486 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6494 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10578ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10579ms
Finished structural reductions in LTL mode , in 1 iterations and 10981 ms. Remains : 246/246 places, 116/116 transitions.
Computed a total of 246 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 246 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
RANDOM walk for 40000 steps (3933 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (697 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (703 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (701 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (725 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1006538 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 4
Probabilistic random walk after 1006538 steps, saw 163042 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2024-05-25 19:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/100 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/122 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 97/219 variables, 28/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 100/319 variables, 84/290 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 42/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 36/355 variables, 30/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/362 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/362 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 378 constraints, problems are : Problem set: 0 solved, 4 unsolved in 342 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/100 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/122 variables, 100/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 97/219 variables, 28/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 100/319 variables, 84/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 42/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 36/355 variables, 30/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 12/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 7/362 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/362 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 382 constraints, problems are : Problem set: 0 solved, 4 unsolved in 441 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 4 properties in 17 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 246 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 278 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Stuttering acceptance computed with spot in 287 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Product exploration explored 100000 steps with 9837 reset in 120 ms.
Product exploration explored 100000 steps with 9826 reset in 124 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[true, p0, p1, (AND p0 p1), p0, p0, p0]
Support contains 16 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 116/116 transitions.
Graph (complete) has 685 edges and 246 vertex of which 238 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 238 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 20 ms. Remains 238 /246 variables (removed 8) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:10:35] [INFO ] Redundant transitions in 28 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 116 rows 238 cols
[2024-05-25 19:10:35] [INFO ] Computed 126 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 2 (OVERLAPS) 116/353 variables, 237/363 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/354 variables, 1/364 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/364 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/364 constraints. Problems are: Problem set: 4 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 364 constraints, problems are : Problem set: 4 solved, 104 unsolved in 3763 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 126/126 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/126 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 114/349 variables, 235/361 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 104/465 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/465 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 5/354 variables, 3/468 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/468 constraints. Problems are: Problem set: 4 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/468 constraints. Problems are: Problem set: 4 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 468 constraints, problems are : Problem set: 4 solved, 104 unsolved in 6019 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 104/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 9822ms problems are : Problem set: 4 solved, 104 unsolved
Search for dead transitions found 4 dead transitions in 9824ms
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 : 238/246 places, 112/116 transitions.
Graph (complete) has 759 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 236 /238 variables (removed 2) and now considering 112/112 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 236/246 places, 112/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9900 ms. Remains : 236/246 places, 112/116 transitions.
Built C files in :
/tmp/ltsmin14005678025353088462
[2024-05-25 19:10:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14005678025353088462
Running compilation step : cd /tmp/ltsmin14005678025353088462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 455 ms.
Running link step : cd /tmp/ltsmin14005678025353088462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14005678025353088462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8131560228084094276.hoa' '--buchi-type=spotba'
LTSmin run took 13674 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-09 finished in 47936 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(p1)&&F(G(p2))))))'
Support contains 11 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 241 transition count 111
Applied a total of 5 rules in 16 ms. Remains 241 /252 variables (removed 11) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 241 cols
[2024-05-25 19:10:59] [INFO ] Computed 132 invariants in 2 ms
[2024-05-25 19:10:59] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-25 19:10:59] [INFO ] Invariant cache hit.
[2024-05-25 19:10:59] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [144, 145, 146, 147, 151, 156, 194, 195, 219, 220, 221, 222, 223]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 434 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/252 places, 111/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 457 ms. Remains : 228/252 places, 111/116 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-11 finished in 605 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 (p1||F(p2)))&&X(G(p0))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2024-05-25 19:10:59] [INFO ] Computed 138 invariants in 3 ms
[2024-05-25 19:10:59] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-25 19:10:59] [INFO ] Invariant cache hit.
[2024-05-25 19:11:00] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 380 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-12 finished in 551 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((F(G(p0)) U p1))))'
Support contains 16 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:11:00] [INFO ] Invariant cache hit.
[2024-05-25 19:11:00] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-25 19:11:00] [INFO ] Invariant cache hit.
[2024-05-25 19:11:00] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 404 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 409 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-13 finished in 567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-25 19:11:00] [INFO ] Invariant cache hit.
[2024-05-25 19:11:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-25 19:11:01] [INFO ] Invariant cache hit.
[2024-05-25 19:11:01] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [147, 148, 149, 150, 154, 159, 160]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 555 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 245/252 places, 116/116 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-06-LTLFireability-15
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-06-LTLFireability-15 finished in 674 ms.
All properties solved by simple procedures.
Total runtime 75320 ms.

BK_STOP 1716664261964

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is QuasiCertifProtocol-PT-06, 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 r312-tall-171662337700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;