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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 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 3.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716654854183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 16:34:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:34:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 16:34:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:34:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 607 ms
[2024-05-25 16:34:16] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:34:16] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 16:34:16] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (5313 resets) in 1630 ms. (24 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40002 steps (2955 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (2839 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2795 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2815 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2821 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:34:17] [INFO ] Computed 5 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/56 variables, 8/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 2 solved, 3 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 38 constraints, problems are : Problem set: 2 solved, 3 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 3 properties in 10 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:34:17] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:34:17] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 9 ms.
[2024-05-25 16:34:17] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 74 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 56
Applied a total of 1 rules in 12 ms. Remains 85 /86 variables (removed 1) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 85 cols
[2024-05-25 16:34:17] [INFO ] Computed 30 invariants in 12 ms
[2024-05-25 16:34:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-25 16:34:17] [INFO ] Invariant cache hit.
[2024-05-25 16:34:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 56/139 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 9 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:34:19] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 56/139 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 2/141 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 15 (OVERLAPS) 0/141 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 177 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 10/10 constraints]
After SMT, in 3184ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3186ms
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3369 ms. Remains : 85/86 places, 56/56 transitions.
Support contains 74 out of 85 places after structural reductions.
[2024-05-25 16:34:21] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:34:21] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:34:21] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6572 resets) in 948 ms. (42 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4000 steps (264 resets) in 72 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (264 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (221 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (216 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (227 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (219 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (215 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (222 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (222 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (226 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (222 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (229 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (225 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (218 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (225 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
[2024-05-25 16:34:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 13/67 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/70 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 53/123 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/140 variables, 14/110 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 4/114 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/141 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/141 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 115 constraints, problems are : Problem set: 1 solved, 14 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 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/54 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 13/67 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 5/29 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 3/32 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 3/70 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 53/123 variables, 70/104 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 7/111 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 17/140 variables, 14/125 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 7/136 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 1/141 variables, 1/137 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/141 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/141 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 137 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 8/8 constraints]
After SMT, in 1414ms problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 14 properties in 210 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 85 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-25 16:34:23] [INFO ] Computed 22 invariants in 4 ms
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 16:34:23] [INFO ] Invariant cache hit.
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 119 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 73/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-01
Product exploration explored 100000 steps with 16437 reset in 216 ms.
Product exploration explored 100000 steps with 16420 reset in 140 ms.
Computed a total of 73 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 56
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 (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 211 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (6566 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 122 steps, run visited all 1 properties in 13 ms. (steps per millisecond=9 )
Probabilistic random walk after 122 steps, saw 106 distinct states, run finished after 16 ms. (steps per millisecond=7 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 261 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-COL-02-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-01 finished in 1482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 35 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 29
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 14 place count 33 transition count 28
Applied a total of 14 rules in 15 ms. Remains 33 /85 variables (removed 52) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 33 cols
[2024-05-25 16:34:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [16, 17, 18]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 89 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/85 places, 28/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 30/85 places, 28/56 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-02 finished in 156 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||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 5 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 76 cols
[2024-05-25 16:34:25] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 73/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-03 finished in 411 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 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 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 69 transition count 51
Applied a total of 5 rules in 11 ms. Remains 69 /85 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2024-05-25 16:34:25] [INFO ] Computed 20 invariants in 2 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 148 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 63/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-04 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X((F(p1)&&X((F(p2) U !p0)))))))'
Support contains 13 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 80 transition count 56
Applied a total of 5 rules in 2 ms. Remains 80 /85 variables (removed 5) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 80 cols
[2024-05-25 16:34:25] [INFO ] Computed 26 invariants in 2 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [50, 51, 52]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 130 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 77/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1), p0, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-05
Product exploration explored 100000 steps with 17469 reset in 194 ms.
Product exploration explored 100000 steps with 17495 reset in 131 ms.
Computed a total of 77 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 56
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 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 433 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), false, (AND (NOT p2) (NOT p0)), false, false, false]
RANDOM walk for 40000 steps (6562 resets) in 77 ms. (512 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (2255 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2253 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (2664 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
// Phase 1: matrix 56 rows 77 cols
[2024-05-25 16:34:27] [INFO ] Computed 23 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 48/122 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/133 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/122 variables, 39/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 16/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/133 variables, 6/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 102 constraints, problems are : Problem set: 1 solved, 2 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 23/23 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 11 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-05 finished in 2081 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 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 69 transition count 51
Applied a total of 5 rules in 8 ms. Remains 69 /85 variables (removed 16) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 69 cols
[2024-05-25 16:34:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:34:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 16:34:27] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 105 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/85 places, 51/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 63/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-06 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 45 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 44 transition count 36
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 13 place count 42 transition count 34
Applied a total of 13 rules in 10 ms. Remains 42 /85 variables (removed 43) and now considering 34/56 (removed 22) transitions.
// Phase 1: matrix 34 rows 42 cols
[2024-05-25 16:34:28] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [22, 23, 24, 25, 26, 27]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 82 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/85 places, 34/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 36/85 places, 34/56 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-07 finished in 134 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)||G(F(p1)))))'
Support contains 10 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 73 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 72 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 72 transition count 53
Applied a total of 4 rules in 14 ms. Remains 72 /85 variables (removed 13) and now considering 53/56 (removed 3) transitions.
// Phase 1: matrix 53 rows 72 cols
[2024-05-25 16:34:28] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 125 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/85 places, 53/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 69/85 places, 53/56 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-10
Product exploration explored 100000 steps with 17484 reset in 103 ms.
Product exploration explored 100000 steps with 17476 reset in 136 ms.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 675 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 88 steps (14 resets) in 5 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 703 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 69 cols
[2024-05-25 16:34:30] [INFO ] Computed 18 invariants in 3 ms
[2024-05-25 16:34:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 16:34:30] [INFO ] Invariant cache hit.
[2024-05-25 16:34:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-25 16:34:30] [INFO ] Redundant transitions in 12 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-25 16:34:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 2/122 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 87 constraints, problems are : Problem set: 0 solved, 49 unsolved in 725 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 53/120 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 2/122 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 36/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 136 constraints, problems are : Problem set: 0 solved, 49 unsolved in 901 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1647ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1766 ms. Remains : 69/69 places, 53/53 transitions.
Computed a total of 69 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 53
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 p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 605 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 73 steps (11 resets) in 4 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 711 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17476 reset in 77 ms.
Product exploration explored 100000 steps with 17478 reset in 91 ms.
Built C files in :
/tmp/ltsmin9853723854993842000
[2024-05-25 16:34:34] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2024-05-25 16:34:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:34] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2024-05-25 16:34:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:34] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2024-05-25 16:34:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9853723854993842000
Running compilation step : cd /tmp/ltsmin9853723854993842000;'/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 301 ms.
Running link step : cd /tmp/ltsmin9853723854993842000;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9853723854993842000;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16168512707884974270.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-10 finished in 6511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 56
Applied a total of 6 rules in 1 ms. Remains 79 /85 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-25 16:34:34] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:34:34] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 16:34:34] [INFO ] Invariant cache hit.
[2024-05-25 16:34:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 857 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 52/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 156 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1067 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1938ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1938ms
Starting structural reductions in LTL mode, iteration 1 : 79/85 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2052 ms. Remains : 79/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-11 finished in 2192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 57 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 56 transition count 42
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 10 place count 54 transition count 40
Applied a total of 10 rules in 5 ms. Remains 54 /85 variables (removed 31) and now considering 40/56 (removed 16) transitions.
// Phase 1: matrix 40 rows 54 cols
[2024-05-25 16:34:36] [INFO ] Computed 16 invariants in 1 ms
[2024-05-25 16:34:36] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 16:34:36] [INFO ] Invariant cache hit.
[2024-05-25 16:34:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [31, 32, 33, 34, 35, 36]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 83 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/85 places, 40/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 48/85 places, 40/56 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-12 finished in 137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p1&&X(X(F(p2))))))))'
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 82 transition count 56
Applied a total of 3 rules in 2 ms. Remains 82 /85 variables (removed 3) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 82 cols
[2024-05-25 16:34:37] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:34:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 16:34:37] [INFO ] Invariant cache hit.
[2024-05-25 16:34:37] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 112 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/85 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 79/85 places, 56/56 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-13 finished in 399 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)))'
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 179 edges and 85 vertex of which 75 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 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 72 transition count 51
Applied a total of 5 rules in 11 ms. Remains 72 /85 variables (removed 13) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 72 cols
[2024-05-25 16:34:37] [INFO ] Computed 23 invariants in 3 ms
[2024-05-25 16:34:37] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-25 16:34:37] [INFO ] Invariant cache hit.
[2024-05-25 16:34:37] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [40, 41, 42, 46, 47, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 114 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/85 places, 51/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 66/85 places, 51/56 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-02-LTLCardinality-14
Product exploration explored 100000 steps with 18761 reset in 141 ms.
Product exploration explored 100000 steps with 18749 reset in 122 ms.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
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 (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (7499 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1865 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1887 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
Probably explored full state space saw : 455 states, properties seen :3
Probabilistic random walk after 1567 steps, saw 455 distinct states, run finished after 19 ms. (steps per millisecond=82 ) properties seen :3
Explored full state space saw : 455 states, properties seen :0
Exhaustive walk after 1567 steps, saw 455 distinct states, run finished after 4 ms. (steps per millisecond=391 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 493 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1)]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 66 cols
[2024-05-25 16:34:39] [INFO ] Computed 18 invariants in 1 ms
[2024-05-25 16:34:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:34:39] [INFO ] Invariant cache hit.
[2024-05-25 16:34:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-25 16:34:39] [INFO ] Redundant transitions in 12 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-25 16:34:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 3/117 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 84 constraints, problems are : Problem set: 0 solved, 44 unsolved in 614 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 51/114 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 3/117 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 128 constraints, problems are : Problem set: 0 solved, 44 unsolved in 767 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1512 ms. Remains : 66/66 places, 51/51 transitions.
Computed a total of 66 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 51
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 : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (7512 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 174 steps, saw 151 distinct states, run finished after 4 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 18750 reset in 84 ms.
Product exploration explored 100000 steps with 18754 reset in 88 ms.
Built C files in :
/tmp/ltsmin15159743571700245307
[2024-05-25 16:34:41] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 16:34:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:41] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 16:34:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:41] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 16:34:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:34:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15159743571700245307
Running compilation step : cd /tmp/ltsmin15159743571700245307;'/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 160 ms.
Running link step : cd /tmp/ltsmin15159743571700245307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15159743571700245307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14926965844728542908.hoa' '--buchi-type=spotba'
LTSmin run took 327 ms.
FORMULA QuasiCertifProtocol-COL-02-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-02-LTLCardinality-14 finished in 4613 ms.
All properties solved by simple procedures.
Total runtime 26722 ms.

BK_STOP 1716654882458

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-02"
export BK_EXAMINATION="LTLCardinality"
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-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662337600003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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