About the Execution of LTSMin+red for QuasiCertifProtocol-PT-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1557.867 | 393734.00 | 462681.00 | 1403.30 | TFFFFFTFFFFTFFFT | normal |
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.r520-tall-171662337800108.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 ltsminxred
Input is QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 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 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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 942K 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-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717221844226
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:04:05] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-01 06:04:05] [INFO ] Transformed 3806 places.
[2024-06-01 06:04:05] [INFO ] Transformed 506 transitions.
[2024-06-01 06:04:05] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2457 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 160 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:04:06] [INFO ] Computed 3232 invariants in 134 ms
[2024-06-01 06:04:09] [INFO ] Implicit Places using invariants in 3389 ms returned []
[2024-06-01 06:04:09] [INFO ] Invariant cache hit.
[2024-06-01 06:04:14] [INFO ] Implicit Places using invariants and state equation in 5497 ms returned []
Implicit Place search using SMT with State Equation took 8920 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-06-01 06:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3735/4242 variables, and 3232 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 0/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3735 variables, 3232/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3735 variables, 0/3232 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 506/4241 variables, 3735/6967 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4241/4242 variables, and 7439 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30342 ms.
Refiners :[Generalized P Invariants (flows): 3232/3232 constraints, State Equation: 3735/3736 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61490ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61510ms
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70617 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 2457 out of 3736 places after structural reductions.
[2024-06-01 06:05:17] [INFO ] Flatten gal took : 252 ms
[2024-06-01 06:05:17] [INFO ] Flatten gal took : 149 ms
[2024-06-01 06:05:17] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 2456 out of 3736 places (down from 2457) after GAL structural reductions.
RANDOM walk for 40000 steps (1067 resets) in 2453 ms. (16 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 230 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
[2024-06-01 06:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2454 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2454 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 97/2551 variables, 96/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2551 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 4 (OVERLAPS) 474/3025 variables, 2551/4759 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/4242 variables, and 4759 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 2551/3736 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2451 variables, 2112/2112 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2451 variables, 0/2112 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 98/2549 variables, 96/2208 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2549 variables, 0/2208 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 473/3022 variables, 2549/4757 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3022 variables, 6/4763 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3022/4242 variables, and 4763 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 2208/3232 constraints, State Equation: 2549/3736 constraints, PredecessorRefiner: 6/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10281ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2451 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.26 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 123 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 3702/3736 places, 504/506 transitions.
RANDOM walk for 40000 steps (1071 resets) in 1070 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 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 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 475040 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 15
Probabilistic random walk after 475040 steps, saw 59736 distinct states, run finished after 3009 ms. (steps per millisecond=157 ) properties seen :0
// Phase 1: matrix 504 rows 3702 cols
[2024-06-01 06:05:32] [INFO ] Computed 3200 invariants in 52 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2451 variables, 2112/2112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2451 variables, 0/2112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 65/2516 variables, 64/2176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2516 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 472/2988 variables, 2516/4692 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2988 variables, 0/4692 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 1218/4206 variables, 1186/5878 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4206 variables, 1024/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/4206 variables, 0/6902 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4206/4206 variables, and 6902 constraints, problems are : Problem set: 1 solved, 14 unsolved in 14112 ms.
Refiners :[Generalized P Invariants (flows): 3200/3200 constraints, State Equation: 3702/3702 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/2450 variables, 2112/2112 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2450 variables, 0/2112 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 65/2515 variables, 64/2176 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2515 variables, 0/2176 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 472/2987 variables, 2515/4691 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2987 variables, 8/4699 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2987 variables, 0/4699 constraints. Problems are: Problem set: 1 solved, 14 unsolved
SMT process timed out in 59385ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Finished Parikh walk after 24214 steps, including 246 resets, run visited all 2 properties in 325 ms. (steps per millisecond=74 )
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 14 properties in 1936 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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' '!(G((F(p0)&&F(G((p1||F(p2)))))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.30 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 623 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-06-01 06:06:35] [INFO ] Computed 3200 invariants in 40 ms
[2024-06-01 06:06:42] [INFO ] Implicit Places using invariants in 7127 ms returned []
[2024-06-01 06:06:42] [INFO ] Invariant cache hit.
[2024-06-01 06:06:54] [INFO ] Implicit Places using invariants and state equation in 12182 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 19319 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20189 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00
Product exploration explored 100000 steps with 2465 reset in 644 ms.
Product exploration explored 100000 steps with 2461 reset in 592 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 18 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 22402 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&&F(p1))) U X((F(p2) U (p3 U p1)))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 111 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:06:56] [INFO ] Computed 3232 invariants in 40 ms
[2024-06-01 06:07:02] [INFO ] Implicit Places using invariants in 5590 ms returned []
[2024-06-01 06:07:02] [INFO ] Invariant cache hit.
[2024-06-01 06:07:12] [INFO ] Implicit Places using invariants and state equation in 9589 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 15187 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 92 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15390 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 15712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&X(!p1)))))'
Support contains 35 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.15 ms
Discarding 34 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 3700 transition count 502
Applied a total of 3 rules in 658 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-06-01 06:07:13] [INFO ] Computed 3200 invariants in 37 ms
[2024-06-01 06:07:19] [INFO ] Implicit Places using invariants in 6674 ms returned []
[2024-06-01 06:07:19] [INFO ] Invariant cache hit.
[2024-06-01 06:07:31] [INFO ] Implicit Places using invariants and state equation in 11955 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 18637 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19540 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 109 ms :[p1, true, p1, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02
Product exploration explored 100000 steps with 2465 reset in 731 ms.
Product exploration explored 100000 steps with 2460 reset in 740 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 221 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, p1]
RANDOM walk for 40000 steps (981 resets) in 594 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (23 resets) in 371 ms. (107 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1653350 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :0 out of 1
Probabilistic random walk after 1653350 steps, saw 198813 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
// Phase 1: matrix 502 rows 3634 cols
[2024-06-01 06:07:38] [INFO ] Computed 3136 invariants in 659 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/331 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2574/2905 variables, 2376/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2905 variables, 2080/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2905 variables, 0/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1225/4130 variables, 1221/5711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4130 variables, 1056/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4130 variables, 0/6767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/4136 variables, 3/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4136 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4136 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4136/4136 variables, and 6770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1574 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/331 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2574/2905 variables, 2376/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2905 variables, 2080/4490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2905 variables, 1/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2905 variables, 0/4491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1225/4130 variables, 1221/5712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4130 variables, 1056/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4130 variables, 0/6768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/4136 variables, 3/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4136 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4136 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4136/4136 variables, and 6771 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2625 ms.
Refiners :[Generalized P Invariants (flows): 3136/3136 constraints, State Equation: 3634/3634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4910ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 71 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 15 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 30450 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((X(G(p0))||(G(p1) U !p2))))))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 389 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:07:43] [INFO ] Computed 3232 invariants in 33 ms
[2024-06-01 06:07:50] [INFO ] Implicit Places using invariants in 7084 ms returned []
[2024-06-01 06:07:50] [INFO ] Invariant cache hit.
[2024-06-01 06:08:04] [INFO ] Implicit Places using invariants and state equation in 14147 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 21250 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 277 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21918 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (OR (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 22275 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&&F(p1)))))'
Support contains 101 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 218 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:08:05] [INFO ] Invariant cache hit.
[2024-06-01 06:08:12] [INFO ] Implicit Places using invariants in 6684 ms returned []
[2024-06-01 06:08:12] [INFO ] Invariant cache hit.
[2024-06-01 06:08:25] [INFO ] Implicit Places using invariants and state equation in 13574 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20261 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 250 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20729 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 20848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&G(((!p1 U p2) U !p0)))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 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 3700 transition count 502
Applied a total of 3 rules in 552 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2024-06-01 06:08:26] [INFO ] Computed 3200 invariants in 32 ms
[2024-06-01 06:08:33] [INFO ] Implicit Places using invariants in 7062 ms returned []
[2024-06-01 06:08:33] [INFO ] Invariant cache hit.
[2024-06-01 06:08:44] [INFO ] Implicit Places using invariants and state equation in 10662 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 17727 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 277 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18557 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND p0 (NOT p2)), p0]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06
Product exploration explored 100000 steps with 2462 reset in 376 ms.
Product exploration explored 100000 steps with 2464 reset in 397 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (NOT p0)), (X p1), (X (OR (NOT p0) p2 (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT p0))), (X (X p1)), (X (X (OR (NOT p0) p2 (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 16 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 20081 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 1122 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 2582 are kept as prefixes of interest. Removing 1154 places using SCC suffix rule.12 ms
Discarding 1154 places :
Also discarding 33 output transitions
Drop transitions (Output transitions of discarded places.) removed 33 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 2581 transition count 442
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 65 place count 2547 transition count 374
Iterating global reduction 1 with 34 rules applied. Total rules applied 99 place count 2547 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 2545 transition count 372
Applied a total of 103 rules in 241 ms. Remains 2545 /3736 variables (removed 1191) and now considering 372/506 (removed 134) transitions.
// Phase 1: matrix 372 rows 2545 cols
[2024-06-01 06:08:46] [INFO ] Computed 2176 invariants in 9 ms
[2024-06-01 06:08:48] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2024-06-01 06:08:48] [INFO ] Invariant cache hit.
[2024-06-01 06:08:51] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned [2188, 2189, 2190, 2191, 2192, 2193, 2194, 2195, 2518, 2521, 2522, 2523, 2524, 2525, 2526, 2527, 2528, 2529, 2530, 2531, 2532, 2533, 2534, 2535, 2536, 2537, 2538, 2539, 2540, 2541, 2542, 2543, 2544]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 5088 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2512/3736 places, 372/506 transitions.
Applied a total of 0 rules in 76 ms. Remains 2512 /2512 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5405 ms. Remains : 2512/3736 places, 372/506 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 5491 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))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 278 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2024-06-01 06:08:51] [INFO ] Computed 3232 invariants in 27 ms
[2024-06-01 06:08:58] [INFO ] Implicit Places using invariants in 7100 ms returned []
[2024-06-01 06:08:58] [INFO ] Invariant cache hit.
[2024-06-01 06:09:10] [INFO ] Implicit Places using invariants and state equation in 11891 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18994 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 210 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19482 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-09
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-09 finished in 19560 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||X(p1)))))'
Support contains 36 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 226 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:09:11] [INFO ] Invariant cache hit.
[2024-06-01 06:09:18] [INFO ] Implicit Places using invariants in 6941 ms returned []
[2024-06-01 06:09:18] [INFO ] Invariant cache hit.
[2024-06-01 06:09:33] [INFO ] Implicit Places using invariants and state equation in 15262 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 22208 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 216 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22650 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-10 finished in 22731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(!p1)))'
Support contains 3 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 206 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:09:34] [INFO ] Invariant cache hit.
[2024-06-01 06:09:40] [INFO ] Implicit Places using invariants in 6622 ms returned []
[2024-06-01 06:09:40] [INFO ] Invariant cache hit.
[2024-06-01 06:09:52] [INFO ] Implicit Places using invariants and state equation in 11952 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18580 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 204 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18993 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (NOT p0), p1, (NOT p0), true]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 19142 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)))'
Support contains 1 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 225 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:09:53] [INFO ] Invariant cache hit.
[2024-06-01 06:10:00] [INFO ] Implicit Places using invariants in 6903 ms returned []
[2024-06-01 06:10:00] [INFO ] Invariant cache hit.
[2024-06-01 06:10:14] [INFO ] Implicit Places using invariants and state equation in 14018 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20928 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 218 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21371 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 21466 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((p0 U (p1||G(p0))))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 211 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 06:10:14] [INFO ] Invariant cache hit.
[2024-06-01 06:10:21] [INFO ] Implicit Places using invariants in 6873 ms returned []
[2024-06-01 06:10:21] [INFO ] Invariant cache hit.
[2024-06-01 06:10:35] [INFO ] Implicit Places using invariants and state equation in 13852 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 20736 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 208 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21155 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 624 ms.
Product exploration explored 100000 steps with 33333 reset in 628 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
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 (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) 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 7 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 23085 ms.
All properties solved by simple procedures.
Total runtime 392193 ms.
ITS solved all properties within timeout
BK_STOP 1717222237960
--------------------
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-PT-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-PT-32, 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 r520-tall-171662337800108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 '
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 ;