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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 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.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 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 72K 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-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716654937216

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-25 16:35:38] [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:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:35:38] [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:35:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:35:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2024-05-25 16:35:38] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:35:39] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 16:35:39] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 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 40004 steps (2213 resets) in 1090 ms. (36 steps per ms) remains 5/26 properties
BEST_FIRST walk for 40003 steps (836 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (833 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (843 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (834 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (836 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:35:39] [INFO ] Computed 5 invariants in 6 ms
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/49 variables, 23/28 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 7/56 variables, 7/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 2 unsolved in 316 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: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/43 variables, 8/26 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/28 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/55 variables, 7/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/56 variables, 1/36 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 3 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-25 16:35:40] [INFO ] Flatten gal took : 16 ms
[2024-05-25 16:35:40] [INFO ] Flatten gal took : 4 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:35:40] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 15 ms.
[2024-05-25 16:35:40] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 514 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 538 transition count 176
Applied a total of 12 rules in 15 ms. Remains 538 /550 variables (removed 12) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 538 cols
[2024-05-25 16:35:40] [INFO ] Computed 363 invariants in 27 ms
[2024-05-25 16:35:40] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-25 16:35:40] [INFO ] Invariant cache hit.
[2024-05-25 16:35:41] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 16:35:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 13/536 variables, 13/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 176/712 variables, 536/899 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 2/714 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/714 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 901 constraints, problems are : Problem set: 0 solved, 164 unsolved in 14772 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 350/350 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 13/536 variables, 13/263 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 100/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 176/712 variables, 536/899 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 154/1053 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 2/714 variables, 2/1055 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 10/1065 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/714 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 714/714 variables, and 1065 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22647 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 350/350 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 37588ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 37593ms
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38190 ms. Remains : 538/550 places, 176/176 transitions.
Support contains 514 out of 538 places after structural reductions.
[2024-05-25 16:36:18] [INFO ] Flatten gal took : 37 ms
[2024-05-25 16:36:18] [INFO ] Flatten gal took : 32 ms
[2024-05-25 16:36:18] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 382 out of 538 places (down from 514) after GAL structural reductions.
RANDOM walk for 40000 steps (2767 resets) in 1304 ms. (30 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
[2024-05-25 16:36:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 45/369 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 143/512 variables, 130/353 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 173/685 variables, 512/865 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/685 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 28/713 variables, 25/890 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 10/900 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 0/900 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/714 variables, 1/901 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/714 variables, 0/901 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/714 variables, 0/901 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 714/714 variables, and 901 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 350/350 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 210/210 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 45/368 variables, 13/223 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 143/511 variables, 130/353 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-25 16:36:23] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 18 ms to minimize.
[2024-05-25 16:36:23] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-25 16:36:23] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-25 16:36:23] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 4/357 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 171/682 variables, 511/868 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 10/878 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/714 variables, and 878 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 340/350 constraints, State Equation: 511/538 constraints, PredecessorRefiner: 10/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 7016ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 323 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 537 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 537 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 536 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 535 transition count 171
Applied a total of 7 rules in 62 ms. Remains 535 /538 variables (removed 3) and now considering 171/176 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 535/538 places, 171/176 transitions.
RANDOM walk for 40000 steps (2914 resets) in 773 ms. (51 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (93 resets) in 103 ms. (384 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (231 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (227 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (229 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (232 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (226 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (225 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (228 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (225 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (225 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (227 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
// Phase 1: matrix 171 rows 535 cols
[2024-05-25 16:36:26] [INFO ] Computed 365 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 45/346 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 121/467 variables, 110/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 170/637 variables, 467/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 68/705 variables, 67/867 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 21/888 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/706 variables, 11/899 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/706 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/706 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 900 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 352/352 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 45/346 variables, 13/223 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 9/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 16:36:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 121/467 variables, 110/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 3 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 3 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-25 16:36:32] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 3 ms to minimize.
[2024-05-25 16:36:33] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-25 16:36:33] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-25 16:36:33] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 11/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 170/637 variables, 467/821 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/637 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 68/705 variables, 67/894 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 21/915 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/705 variables, 4/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/706 variables, 11/930 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/706 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/706 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/706 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 931 constraints, problems are : Problem set: 0 solved, 10 unsolved in 16776 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 352/352 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 21/21 constraints]
After SMT, in 18539ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 83 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=41 )
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 10 properties in 318 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 538 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 538 transition count 176
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(X(X(X(F(p0))))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 525 transition count 176
Applied a total of 13 rules in 19 ms. Remains 525 /538 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2024-05-25 16:36:46] [INFO ] Computed 351 invariants in 18 ms
[2024-05-25 16:36:46] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-25 16:36:46] [INFO ] Invariant cache hit.
[2024-05-25 16:36:47] [INFO ] Implicit Places using invariants and state equation in 592 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 966 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/538 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1004 ms. Remains : 514/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 1318 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 p1)||X(p2)))'
Support contains 265 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 536 transition count 176
Applied a total of 2 rules in 7 ms. Remains 536 /538 variables (removed 2) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2024-05-25 16:36:47] [INFO ] Computed 362 invariants in 5 ms
[2024-05-25 16:36:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-25 16:36:47] [INFO ] Invariant cache hit.
[2024-05-25 16:36:48] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 977 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/538 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 525/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-01 finished in 1190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.7 ms
Discarding 25 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 510 transition count 171
Applied a total of 5 rules in 36 ms. Remains 510 /538 variables (removed 28) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 510 cols
[2024-05-25 16:36:48] [INFO ] Computed 341 invariants in 15 ms
[2024-05-25 16:36:48] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-25 16:36:48] [INFO ] Invariant cache hit.
[2024-05-25 16:36:49] [INFO ] Implicit Places using invariants and state equation in 672 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1026 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/538 places, 171/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1079 ms. Remains : 488/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-02
Product exploration explored 100000 steps with 6773 reset in 253 ms.
Product exploration explored 100000 steps with 6782 reset in 208 ms.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 171 rows 488 cols
[2024-05-25 16:36:50] [INFO ] Computed 320 invariants in 10 ms
[2024-05-25 16:36:51] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 143 ms returned sat
[2024-05-25 16:36:51] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-25 16:36:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:36:51] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 143 ms returned sat
[2024-05-25 16:36:52] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2024-05-25 16:36:52] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 13 ms.
[2024-05-25 16:36:52] [INFO ] Added : 1 causal constraints over 1 iterations in 73 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 15 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-25 16:36:52] [INFO ] Invariant cache hit.
[2024-05-25 16:36:52] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-25 16:36:52] [INFO ] Invariant cache hit.
[2024-05-25 16:36:53] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2024-05-25 16:36:53] [INFO ] Redundant transitions in 24 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-25 16:36:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9239 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 17289 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 26631ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 26635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27691 ms. Remains : 488/488 places, 171/171 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-25 16:37:20] [INFO ] Invariant cache hit.
[2024-05-25 16:37:20] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 150 ms returned sat
[2024-05-25 16:37:21] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2024-05-25 16:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:37:21] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 153 ms returned sat
[2024-05-25 16:37:22] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2024-05-25 16:37:22] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 11 ms.
[2024-05-25 16:37:22] [INFO ] Added : 1 causal constraints over 1 iterations in 68 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6777 reset in 154 ms.
Product exploration explored 100000 steps with 6780 reset in 193 ms.
Built C files in :
/tmp/ltsmin13982246567981203466
[2024-05-25 16:37:22] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-25 16:37:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:22] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-25 16:37:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:22] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-25 16:37:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:37:22] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13982246567981203466
Running compilation step : cd /tmp/ltsmin13982246567981203466;'/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 745 ms.
Running link step : cd /tmp/ltsmin13982246567981203466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13982246567981203466;'/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/stateBased14383779576597624982.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 171/171 transitions.
Applied a total of 0 rules in 20 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-25 16:37:37] [INFO ] Invariant cache hit.
[2024-05-25 16:37:38] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-25 16:37:38] [INFO ] Invariant cache hit.
[2024-05-25 16:37:38] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
[2024-05-25 16:37:38] [INFO ] Redundant transitions in 25 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-25 16:37:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 12/659 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/659 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 659/659 variables, and 808 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9357 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 27/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 12/659 variables, 12/835 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 121/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/659 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 659/659 variables, and 956 constraints, problems are : Problem set: 0 solved, 148 unsolved in 17053 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 26502ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 26505ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27559 ms. Remains : 488/488 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin4362298574362640395
[2024-05-25 16:38:05] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2024-05-25 16:38:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:38:05] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2024-05-25 16:38:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:38:05] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2024-05-25 16:38:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:38:05] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4362298574362640395
Running compilation step : cd /tmp/ltsmin4362298574362640395;'/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 536 ms.
Running link step : cd /tmp/ltsmin4362298574362640395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4362298574362640395;'/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/stateBased5977203888334982011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:38:20] [INFO ] Flatten gal took : 25 ms
[2024-05-25 16:38:20] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:38:20] [INFO ] Time to serialize gal into /tmp/LTL10757309995003959041.gal : 6 ms
[2024-05-25 16:38:20] [INFO ] Time to serialize properties into /tmp/LTL17362054456829711352.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10757309995003959041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13766969164120052305.hoa' '-atoms' '/tmp/LTL17362054456829711352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17362054456829711352.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13766969164120052305.hoa
Detected timeout of ITS tools.
[2024-05-25 16:38:35] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:38:35] [INFO ] Flatten gal took : 17 ms
[2024-05-25 16:38:35] [INFO ] Time to serialize gal into /tmp/LTL15853080566240371038.gal : 3 ms
[2024-05-25 16:38:35] [INFO ] Time to serialize properties into /tmp/LTL16684986336514319108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15853080566240371038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16684986336514319108.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"
Detected timeout of ITS tools.
[2024-05-25 16:38:50] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:38:50] [INFO ] Applying decomposition
[2024-05-25 16:38:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11916979606551171080.txt' '-o' '/tmp/graph11916979606551171080.bin' '-w' '/tmp/graph11916979606551171080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11916979606551171080.bin' '-l' '-1' '-v' '-w' '/tmp/graph11916979606551171080.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:38:50] [INFO ] Decomposing Gal with order
[2024-05-25 16:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:38:50] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-25 16:38:50] [INFO ] Flatten gal took : 63 ms
[2024-05-25 16:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 19 ms.
[2024-05-25 16:38:50] [INFO ] Time to serialize gal into /tmp/LTL1372811139686403269.gal : 8 ms
[2024-05-25 16:38:51] [INFO ] Time to serialize properties into /tmp/LTL17644264620803778931.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1372811139686403269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17644264620803778931.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(u0.SstopAbort>=2)"))))
Formula 0 simplified : GF!"(u0.SstopAbort>=2)"
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-02 finished in 137466 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 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 107 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.3 ms
Discarding 431 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 107 transition count 78
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 107 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 106 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 106 transition count 77
Applied a total of 48 rules in 16 ms. Remains 106 /538 variables (removed 432) and now considering 77/176 (removed 99) transitions.
// Phase 1: matrix 77 rows 106 cols
[2024-05-25 16:39:06] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 16:39:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 16:39:06] [INFO ] Invariant cache hit.
[2024-05-25 16:39:06] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-25 16:39:06] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-25 16:39:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 77/181 variables, 104/134 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 2/183 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 136 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1170 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 77/181 variables, 104/134 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 55/189 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 2/183 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1666 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2854ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/538 places, 77/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3027 ms. Remains : 106/538 places, 77/176 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03
Stuttering criterion allowed to conclude after 177 steps with 25 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 3127 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||G(p1)))))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 249 are kept as prefixes of interest. Removing 289 places using SCC suffix rule.2 ms
Discarding 289 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 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 248 transition count 110
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 35 place count 247 transition count 109
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 247 transition count 109
Applied a total of 36 rules in 22 ms. Remains 247 /538 variables (removed 291) and now considering 109/176 (removed 67) transitions.
// Phase 1: matrix 109 rows 247 cols
[2024-05-25 16:39:09] [INFO ] Computed 140 invariants in 3 ms
[2024-05-25 16:39:09] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-25 16:39:09] [INFO ] Invariant cache hit.
[2024-05-25 16:39:09] [INFO ] Implicit Places using invariants and state equation in 184 ms returned [177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 327 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/538 places, 109/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 236/538 places, 109/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-04
Product exploration explored 100000 steps with 6637 reset in 211 ms.
Product exploration explored 100000 steps with 6637 reset in 223 ms.
Computed a total of 236 stabilizing places and 109 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 109
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 (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-04 finished in 944 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 132 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 523 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 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 520 transition count 171
Applied a total of 5 rules in 25 ms. Remains 520 /538 variables (removed 18) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 520 cols
[2024-05-25 16:39:10] [INFO ] Computed 351 invariants in 2 ms
[2024-05-25 16:39:10] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-25 16:39:10] [INFO ] Invariant cache hit.
[2024-05-25 16:39:11] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1600 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/538 places, 171/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1643 ms. Remains : 498/538 places, 171/176 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-05
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-05 finished in 1691 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 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 535 transition count 176
Applied a total of 3 rules in 9 ms. Remains 535 /538 variables (removed 3) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 535 cols
[2024-05-25 16:39:11] [INFO ] Computed 361 invariants in 6 ms
[2024-05-25 16:39:12] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-25 16:39:12] [INFO ] Invariant cache hit.
[2024-05-25 16:39:13] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1715 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1729 ms. Remains : 524/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-09
Product exploration explored 100000 steps with 6924 reset in 169 ms.
Product exploration explored 100000 steps with 6925 reset in 183 ms.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2769 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (329 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1711 steps, run visited all 1 properties in 13 ms. (steps per millisecond=131 )
Probabilistic random walk after 1711 steps, saw 1630 distinct states, run finished after 16 ms. (steps per millisecond=106 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 100 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-10-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-09 finished in 2648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 34 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 10 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 16:39:14] [INFO ] Computed 350 invariants in 6 ms
[2024-05-25 16:39:14] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-25 16:39:14] [INFO ] Invariant cache hit.
[2024-05-25 16:39:15] [INFO ] Implicit Places using invariants and state equation in 489 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 809 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 824 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-10 finished in 1427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(F(p1)) U p2)))'
Support contains 45 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 11 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
[2024-05-25 16:39:15] [INFO ] Invariant cache hit.
[2024-05-25 16:39:16] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-25 16:39:16] [INFO ] Invariant cache hit.
[2024-05-25 16:39:16] [INFO ] Implicit Places using invariants and state equation in 537 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 844 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
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 p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 13 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 1687 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 U p1)||(X(X(G(p0))) U (p2&&G(p3)))))))'
Support contains 35 out of 538 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Graph (complete) has 2377 edges and 538 vertex of which 513 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 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 511 transition count 172
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 511 transition count 172
Applied a total of 4 rules in 36 ms. Remains 511 /538 variables (removed 27) and now considering 172/176 (removed 4) transitions.
// Phase 1: matrix 172 rows 511 cols
[2024-05-25 16:39:17] [INFO ] Computed 341 invariants in 20 ms
[2024-05-25 16:39:17] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-25 16:39:17] [INFO ] Invariant cache hit.
[2024-05-25 16:39:18] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 829 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 489/538 places, 172/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 876 ms. Remains : 489/538 places, 172/176 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14
Product exploration explored 100000 steps with 6778 reset in 177 ms.
Product exploration explored 100000 steps with 6787 reset in 179 ms.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 739 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (2707 resets) in 215 ms. (185 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (204 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (206 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
// Phase 1: matrix 172 rows 489 cols
[2024-05-25 16:39:20] [INFO ] Computed 320 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 103/149 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/298 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 363/661 variables, 363/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 310/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 809 constraints, problems are : Problem set: 0 solved, 4 unsolved in 304 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 103/149 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/298 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 363/661 variables, 363/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 310/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 813 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2659 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 35 ms.
Knowledge obtained : [(AND p1 p2 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 p3))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (AND (OR p2 p1) (OR p3 p1)))), (F (NOT p1)), (F (NOT (OR p3 p1))), (F (NOT p2)), (F (NOT (OR (NOT p3) p1))), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1849 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Support contains 35 out of 489 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 10 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-25 16:39:25] [INFO ] Invariant cache hit.
[2024-05-25 16:39:25] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-25 16:39:25] [INFO ] Invariant cache hit.
[2024-05-25 16:39:26] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-25 16:39:26] [INFO ] Redundant transitions in 15 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-25 16:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 172/649 variables, 477/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 12/661 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 809 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9346 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 172/649 variables, 477/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 72/869 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 12/661 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 77/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/661 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 958 constraints, problems are : Problem set: 0 solved, 149 unsolved in 16488 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 25938ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 25940ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26684 ms. Remains : 489/489 places, 172/172 transitions.
Computed a total of 489 stabilizing places and 172 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 489 transition count 172
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 p2 p1 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p1)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 735 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (2708 resets) in 143 ms. (277 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (203 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (208 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (280 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
[2024-05-25 16:39:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 103/149 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/298 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 363/661 variables, 363/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 310/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 809 constraints, problems are : Problem set: 0 solved, 4 unsolved in 304 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/46 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 103/149 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/298 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 363/661 variables, 363/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 310/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 813 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2057 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2370ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 27 ms.
Knowledge obtained : [(AND p2 p1 p3), (X p2), (X p3), (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (NOT (AND p2 p3 (NOT p1)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (AND (OR p2 p1) (OR p3 p1)))), (F (NOT p1)), (F (NOT (OR p3 p1))), (F (NOT p2)), (F (NOT (OR (NOT p3) p1))), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1779 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 6767 reset in 194 ms.
Product exploration explored 100000 steps with 6790 reset in 204 ms.
Built C files in :
/tmp/ltsmin16749413176239196087
[2024-05-25 16:39:58] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-25 16:39:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:39:58] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-25 16:39:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:39:58] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-25 16:39:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:39:58] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16749413176239196087
Running compilation step : cd /tmp/ltsmin16749413176239196087;'/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 538 ms.
Running link step : cd /tmp/ltsmin16749413176239196087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16749413176239196087;'/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/stateBased12738940457281830584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 35 out of 489 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 489/489 places, 172/172 transitions.
Applied a total of 0 rules in 9 ms. Remains 489 /489 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
[2024-05-25 16:40:13] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
[2024-05-25 16:40:13] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-25 16:40:13] [INFO ] Redundant transitions in 23 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 172/649 variables, 477/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 12/661 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/661 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 809 constraints, problems are : Problem set: 0 solved, 149 unsolved in 9207 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 172/649 variables, 477/797 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/649 variables, 72/869 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 12/661 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 77/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/661 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 958 constraints, problems are : Problem set: 0 solved, 149 unsolved in 16132 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 25430ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 25433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26170 ms. Remains : 489/489 places, 172/172 transitions.
Built C files in :
/tmp/ltsmin8396539611429871461
[2024-05-25 16:40:39] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-25 16:40:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:40:39] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-25 16:40:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:40:39] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-25 16:40:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:40:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8396539611429871461
Running compilation step : cd /tmp/ltsmin8396539611429871461;'/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 528 ms.
Running link step : cd /tmp/ltsmin8396539611429871461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8396539611429871461;'/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/stateBased1000777111572460515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:40:54] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:40:54] [INFO ] Time to serialize gal into /tmp/LTL9263011600644547462.gal : 3 ms
[2024-05-25 16:40:54] [INFO ] Time to serialize properties into /tmp/LTL4810414915803348341.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9263011600644547462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14388166052610199031.hoa' '-atoms' '/tmp/LTL4810414915803348341.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4810414915803348341.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14388166052610199031.hoa
Detected timeout of ITS tools.
[2024-05-25 16:41:09] [INFO ] Flatten gal took : 13 ms
[2024-05-25 16:41:09] [INFO ] Flatten gal took : 12 ms
[2024-05-25 16:41:09] [INFO ] Time to serialize gal into /tmp/LTL5325887260892306452.gal : 2 ms
[2024-05-25 16:41:09] [INFO ] Time to serialize properties into /tmp/LTL7235155036590172358.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5325887260892306452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7235155036590172358.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((("(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+((s5_8+s5_9)+s5_10))>=3)")U("(malicious_reservoir>=1)"))||((X(X(G("(...503
Formula 0 simplified : FG((!"(((((s5_0+s5_1)+(s5_2+s5_3))+((s5_4+s5_5)+(s5_6+s5_7)))+((s5_8+s5_9)+s5_10))>=3)" R !"(malicious_reservoir>=1)") & (XXF!"(((((...491
Detected timeout of ITS tools.
[2024-05-25 16:41:24] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:41:24] [INFO ] Applying decomposition
[2024-05-25 16:41:24] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9426340535266881399.txt' '-o' '/tmp/graph9426340535266881399.bin' '-w' '/tmp/graph9426340535266881399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9426340535266881399.bin' '-l' '-1' '-v' '-w' '/tmp/graph9426340535266881399.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:41:24] [INFO ] Decomposing Gal with order
[2024-05-25 16:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:41:24] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-25 16:41:24] [INFO ] Flatten gal took : 35 ms
[2024-05-25 16:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 15 ms.
[2024-05-25 16:41:24] [INFO ] Time to serialize gal into /tmp/LTL9750025810530711374.gal : 6 ms
[2024-05-25 16:41:24] [INFO ] Time to serialize properties into /tmp/LTL14956272752038681408.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9750025810530711374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14956272752038681408.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(((((gu27.s5_0+gu27.s5_1)+(gu27.s5_2+gu27.s5_3))+((gu27.s5_4+gu27.s5_5)+(gu27.s5_6+gu27.s5_7)))+((gu27.s5_8+gu27.s5_9)+gu27....766
Formula 0 simplified : FG((!"(((((gu27.s5_0+gu27.s5_1)+(gu27.s5_2+gu27.s5_3))+((gu27.s5_4+gu27.s5_5)+(gu27.s5_6+gu27.s5_7)))+((gu27.s5_8+gu27.s5_9)+gu27.s5...754
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 142357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 12 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 524 transition count 176
Applied a total of 14 rules in 14 ms. Remains 524 /538 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 16:41:39] [INFO ] Computed 350 invariants in 13 ms
[2024-05-25 16:41:40] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-25 16:41:40] [INFO ] Invariant cache hit.
[2024-05-25 16:41:40] [INFO ] Implicit Places using invariants and state equation in 561 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 908 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/538 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 928 ms. Remains : 513/538 places, 176/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-15 finished in 1486 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)))'
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 U p1)||(X(X(G(p0))) U (p2&&G(p3)))))))'
[2024-05-25 16:41:41] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16586209393855461170
[2024-05-25 16:41:41] [INFO ] Applying decomposition
[2024-05-25 16:41:41] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-25 16:41:41] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:41:41] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-25 16:41:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:41:41] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-25 16:41:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:41:41] [INFO ] Flatten gal took : 21 ms
[2024-05-25 16:41:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16586209393855461170
Running compilation step : cd /tmp/ltsmin16586209393855461170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2788643820031185314.txt' '-o' '/tmp/graph2788643820031185314.bin' '-w' '/tmp/graph2788643820031185314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2788643820031185314.bin' '-l' '-1' '-v' '-w' '/tmp/graph2788643820031185314.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:41:41] [INFO ] Decomposing Gal with order
[2024-05-25 16:41:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:41:41] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-25 16:41:41] [INFO ] Flatten gal took : 62 ms
[2024-05-25 16:41:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2024-05-25 16:41:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality13685573434131366031.gal : 5 ms
[2024-05-25 16:41:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality15932125743384689169.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13685573434131366031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15932125743384689169.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((F(G("(gi0.gu0.SstopAbort>=2)"))))
Formula 0 simplified : GF!"(gi0.gu0.SstopAbort>=2)"
Compilation finished in 624 ms.
Running link step : cd /tmp/ltsmin16586209393855461170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16586209393855461170;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16586209393855461170;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16586209393855461170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((LTLAPp1==true) U (LTLAPp2==true))||(X(X([]((LTLAPp1==true)))) U ((LTLAPp3==true)&&[]((LTLAPp4==true)))))))' '--buchi-type=spotba'
LTSmin run took 35964 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin16586209393855461170;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 17:03:43] [INFO ] Applying decomposition
[2024-05-25 17:03:43] [INFO ] Flatten gal took : 49 ms
[2024-05-25 17:03:44] [INFO ] Decomposing Gal with order
[2024-05-25 17:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 17:03:44] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0, CstopOK_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1, CstopOK_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2, CstopOK_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3, CstopOK_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4, CstopOK_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5, CstopOK_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6, CstopOK_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7, CstopOK_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8, CstopOK_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9, CstopOK_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10, CstopOK_10],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-25 17:03:44] [INFO ] Flatten gal took : 31 ms
[2024-05-25 17:03:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality14288309849897551300.gal : 2 ms
[2024-05-25 17:03:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality15062529679853436195.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14288309849897551300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15062529679853436195.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"
ITS-tools command line returned an error code 137
[2024-05-25 17:24:18] [INFO ] Flatten gal took : 38 ms
[2024-05-25 17:24:18] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-25 17:24:18] [INFO ] Transformed 538 places.
[2024-05-25 17:24:18] [INFO ] Transformed 176 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 17:24:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality10263527783562086647.gal : 3 ms
[2024-05-25 17:24:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality8727918727795267246.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10263527783562086647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8727918727795267246.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(SstopAbort>=2)"))))
Formula 0 simplified : GF!"(SstopAbort>=2)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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-10"
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-10, 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-171662337600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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