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-171662337800091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is QuasiCertifProtocol-PT-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 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 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716667597298

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 20:06: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 20:06:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:06:38] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-25 20:06:38] [INFO ] Transformed 1966 places.
[2024-05-25 20:06:38] [INFO ] Transformed 356 transitions.
[2024-05-25 20:06:38] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1169 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 1920 transition count 356
Applied a total of 46 rules in 95 ms. Remains 1920 /1966 variables (removed 46) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1920 cols
[2024-05-25 20:06:39] [INFO ] Computed 1565 invariants in 90 ms
[2024-05-25 20:06:40] [INFO ] Implicit Places using invariants in 1497 ms returned []
[2024-05-25 20:06:40] [INFO ] Invariant cache hit.
[2024-05-25 20:06:43] [INFO ] Implicit Places using invariants and state equation in 3033 ms returned [1157, 1158, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1183, 1185, 1186, 1188]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 4560 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1898/1966 places, 356/356 transitions.
Applied a total of 0 rules in 23 ms. Remains 1898 /1898 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4696 ms. Remains : 1898/1966 places, 356/356 transitions.
Support contains 1169 out of 1898 places after structural reductions.
[2024-05-25 20:06:43] [INFO ] Flatten gal took : 144 ms
[2024-05-25 20:06:43] [INFO ] Flatten gal took : 76 ms
[2024-05-25 20:06:44] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1167 out of 1898 places (down from 1169) after GAL structural reductions.
RANDOM walk for 40000 steps (1484 resets) in 2694 ms. (14 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40004 steps (89 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (90 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 776 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (88 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (84 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (89 resets) in 563 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (81 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (87 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (50 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (85 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
// Phase 1: matrix 356 rows 1898 cols
[2024-05-25 20:06:45] [INFO ] Computed 1543 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1160 variables, 968/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1160 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/1162 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1162 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 641/1803 variables, 530/1499 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1499 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 353/2156 variables, 1803/3302 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/3302 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 98/2254 variables, 95/3397 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2254 variables, 44/3441 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2254 variables, 0/3441 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/2254 variables, 0/3441 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2254/2254 variables, and 3441 constraints, problems are : Problem set: 3 solved, 9 unsolved in 4959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1898/1898 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 968/968 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/968 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/1161 variables, 1/969 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1161 variables, 0/969 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 642/1803 variables, 530/1499 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-05-25 20:06:52] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 8 ms to minimize.
[2024-05-25 20:06:52] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 2/1501 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1803 variables, 0/1501 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 353/2156 variables, 1803/3304 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2156 variables, 4/3308 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2254 variables, and 3308 constraints, problems are : Problem set: 3 solved, 9 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1498/1542 constraints, State Equation: 1803/1898 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 10178ms problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1896 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 1850 transition count 286
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 117 place count 1850 transition count 263
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 68 rules applied. Total rules applied 185 place count 1805 transition count 263
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 186 place count 1804 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 1804 transition count 262
Applied a total of 187 rules in 189 ms. Remains 1804 /1898 variables (removed 94) and now considering 262/356 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1804/1898 places, 262/356 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1722 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (97 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 609 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 353 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 414941 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 9
Probabilistic random walk after 414941 steps, saw 61667 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 262 rows 1804 cols
[2024-05-25 20:07:00] [INFO ] Computed 1542 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 621/1780 variables, 1035/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1780 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 23/1803 variables, 23/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2065 variables, 1803/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 0/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/2066 variables, 1/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2066 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2066 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2066/2066 variables, and 3346 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3215 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1804/1804 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 621/1780 variables, 1035/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1780 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 23/1803 variables, 23/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1803 variables, 0/1542 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2065 variables, 1803/3345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 7/3352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2065 variables, 0/3352 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/2066 variables, 1/3353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2066/2066 variables, and 3355 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45035 ms.
Refiners :[Generalized P Invariants (flows): 1542/1542 constraints, State Equation: 1804/1804 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 48338ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 262/262 transitions.
Applied a total of 0 rules in 31 ms. Remains 1804 /1804 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1804/1804 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1804/1804 places, 262/262 transitions.
Applied a total of 0 rules in 26 ms. Remains 1804 /1804 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 20:07:48] [INFO ] Invariant cache hit.
[2024-05-25 20:07:49] [INFO ] Implicit Places using invariants in 1251 ms returned [116, 121]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1253 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1802/1804 places, 262/262 transitions.
Applied a total of 0 rules in 33 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1313 ms. Remains : 1802/1804 places, 262/262 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1263 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 608 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (97 resets) in 352 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (97 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 434730 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 9
Probabilistic random walk after 434730 steps, saw 64964 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
// Phase 1: matrix 262 rows 1802 cols
[2024-05-25 20:07:53] [INFO ] Computed 1540 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 620/1779 variables, 1034/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/1801 variables, 22/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1801 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2063 variables, 1801/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2063 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/2064 variables, 1/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2064 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/2064 variables, 0/3342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2064/2064 variables, and 3342 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8006 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1159 variables, 484/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1159 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 620/1779 variables, 1034/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/1801 variables, 22/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1801 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 262/2063 variables, 1801/3341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2063 variables, 7/3348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2063 variables, 0/3348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/2064 variables, 1/3349 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2064/2064 variables, and 3351 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 83079ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1159 out of 1802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1802/1802 places, 262/262 transitions.
Applied a total of 0 rules in 37 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1802/1802 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1802/1802 places, 262/262 transitions.
Applied a total of 0 rules in 23 ms. Remains 1802 /1802 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 20:09:16] [INFO ] Invariant cache hit.
[2024-05-25 20:09:18] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2024-05-25 20:09:18] [INFO ] Invariant cache hit.
[2024-05-25 20:09:23] [INFO ] Implicit Places using invariants and state equation in 5395 ms returned []
Implicit Place search using SMT with State Equation took 6632 ms to find 0 implicit places.
[2024-05-25 20:09:23] [INFO ] Redundant transitions in 19 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-25 20:09:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1799 variables, 1538/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1799 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 3/1802 variables, 2/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1802 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 262/2064 variables, 1802/3342 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2064/2064 variables, and 3342 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1799 variables, 1538/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1799 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 3/1802 variables, 2/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1802 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 262/2064 variables, 1802/3342 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2064 variables, 238/3580 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2064/2064 variables, and 3580 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1802/1802 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66985 ms. Remains : 1802/1802 places, 262/262 transitions.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1898 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1898 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 23 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 56 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2024-05-25 20:10:24] [INFO ] Computed 1540 invariants in 29 ms
[2024-05-25 20:10:26] [INFO ] Implicit Places using invariants in 2221 ms returned []
[2024-05-25 20:10:26] [INFO ] Invariant cache hit.
[2024-05-25 20:10:35] [INFO ] Implicit Places using invariants and state equation in 9599 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11824 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11942 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-01
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-01 finished in 12195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 1081 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 19 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
[2024-05-25 20:10:36] [INFO ] Invariant cache hit.
[2024-05-25 20:10:37] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-05-25 20:10:37] [INFO ] Invariant cache hit.
[2024-05-25 20:10:45] [INFO ] Implicit Places using invariants and state equation in 8147 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 19 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9511 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-02 finished in 9657 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 49 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1896 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output 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 1894 transition count 354
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 1894 transition count 354
Applied a total of 4 rules in 254 ms. Remains 1894 /1898 variables (removed 4) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1894 cols
[2024-05-25 20:10:46] [INFO ] Computed 1541 invariants in 50 ms
[2024-05-25 20:10:48] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2024-05-25 20:10:48] [INFO ] Invariant cache hit.
[2024-05-25 20:10:54] [INFO ] Implicit Places using invariants and state equation in 6633 ms returned [1164, 1829, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 8797 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1898 places, 354/356 transitions.
Applied a total of 0 rules in 95 ms. Remains 1870 /1870 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9146 ms. Remains : 1870/1898 places, 354/356 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-05
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-05 finished in 9226 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 529 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.7 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 263
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 95 place count 1293 transition count 261
Applied a total of 95 rules in 117 ms. Remains 1293 /1898 variables (removed 605) and now considering 261/356 (removed 95) transitions.
// Phase 1: matrix 261 rows 1293 cols
[2024-05-25 20:10:55] [INFO ] Computed 1034 invariants in 12 ms
[2024-05-25 20:10:56] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-25 20:10:56] [INFO ] Invariant cache hit.
[2024-05-25 20:11:02] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned [587, 1252, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 7013 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1269/1898 places, 261/356 transitions.
Applied a total of 0 rules in 31 ms. Remains 1269 /1269 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7161 ms. Remains : 1269/1898 places, 261/356 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-07
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-07 finished in 7209 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 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.4 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 1295 transition count 264
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 92 place count 1295 transition count 264
Applied a total of 92 rules in 171 ms. Remains 1295 /1898 variables (removed 603) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1295 cols
[2024-05-25 20:11:02] [INFO ] Computed 1034 invariants in 14 ms
[2024-05-25 20:11:03] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2024-05-25 20:11:03] [INFO ] Invariant cache hit.
[2024-05-25 20:11:06] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned [589, 1254, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 3874 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1898 places, 264/356 transitions.
Applied a total of 0 rules in 49 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4094 ms. Remains : 1271/1898 places, 264/356 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-09 finished in 4150 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 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1894 transition count 356
Applied a total of 4 rules in 59 ms. Remains 1894 /1898 variables (removed 4) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1894 cols
[2024-05-25 20:11:06] [INFO ] Computed 1540 invariants in 12 ms
[2024-05-25 20:11:08] [INFO ] Implicit Places using invariants in 2253 ms returned []
[2024-05-25 20:11:08] [INFO ] Invariant cache hit.
[2024-05-25 20:11:18] [INFO ] Implicit Places using invariants and state equation in 9418 ms returned [1164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11676 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1898 places, 356/356 transitions.
Applied a total of 0 rules in 70 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11805 ms. Remains : 1893/1898 places, 356/356 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-10
Product exploration explored 100000 steps with 36239 reset in 487 ms.
Product exploration explored 100000 steps with 35937 reset in 462 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 94 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-PT-22-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-10 finished in 13215 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 3 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1870 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.7 ms
Discarding 28 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1868 transition count 352
Applied a total of 5 rules in 146 ms. Remains 1868 /1898 variables (removed 30) and now considering 352/356 (removed 4) transitions.
// Phase 1: matrix 352 rows 1868 cols
[2024-05-25 20:11:19] [INFO ] Computed 1518 invariants in 22 ms
[2024-05-25 20:11:21] [INFO ] Implicit Places using invariants in 2035 ms returned []
[2024-05-25 20:11:21] [INFO ] Invariant cache hit.
[2024-05-25 20:11:25] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned [1161]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5404 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1867/1898 places, 352/356 transitions.
Applied a total of 0 rules in 76 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5627 ms. Remains : 1867/1898 places, 352/356 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-11
Product exploration explored 100000 steps with 3708 reset in 270 ms.
Product exploration explored 100000 steps with 3715 reset in 259 ms.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1483 resets) in 174 ms. (228 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (99 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
// Phase 1: matrix 352 rows 1867 cols
[2024-05-25 20:11:26] [INFO ] Computed 1518 invariants in 176 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/714 variables, 109/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 132/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 903/1617 variables, 903/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 903/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 602/2219 variables, 599/2879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 506/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 3385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 969 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 132/714 variables, 109/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 132/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 903/1617 variables, 903/1380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 903/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1617 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 602/2219 variables, 599/2882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 506/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 3388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2524 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3689ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 82 steps, including 0 resets, run visited all 3 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 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 445 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 79 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-25 20:11:31] [INFO ] Invariant cache hit.
[2024-05-25 20:11:33] [INFO ] Implicit Places using invariants in 2269 ms returned []
[2024-05-25 20:11:33] [INFO ] Invariant cache hit.
[2024-05-25 20:11:36] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 5817 ms to find 0 implicit places.
[2024-05-25 20:11:36] [INFO ] Redundant transitions in 24 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-25 20:11:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2218/2219 variables, and 3384 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2218 variables, 328/3712 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2218/2219 variables, and 3712 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66400 ms. Remains : 1867/1867 places, 352/352 transitions.
Computed a total of 1867 stabilizing places and 352 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1867 transition count 352
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1481 resets) in 297 ms. (134 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (101 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
[2024-05-25 20:12:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 132/714 variables, 109/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 132/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 903/1617 variables, 903/1377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1617 variables, 903/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 0/2280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 602/2219 variables, 599/2879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2219 variables, 506/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2219 variables, 0/3385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 3385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 923 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/582 variables, 230/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 132/714 variables, 109/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 132/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 903/1617 variables, 903/1380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1617 variables, 903/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1617 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 602/2219 variables, 599/2882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2219 variables, 506/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2219 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 3388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2189 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1867/1867 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3125ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 520 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3710 reset in 231 ms.
Product exploration explored 100000 steps with 3714 reset in 246 ms.
Built C files in :
/tmp/ltsmin3886381821762855662
[2024-05-25 20:12:42] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2024-05-25 20:12:42] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:12:42] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2024-05-25 20:12:42] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:12:42] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2024-05-25 20:12:42] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:12:42] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3886381821762855662
Running compilation step : cd /tmp/ltsmin3886381821762855662;'/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 1908 ms.
Running link step : cd /tmp/ltsmin3886381821762855662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3886381821762855662;'/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/stateBased14516069958085398680.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1867/1867 places, 352/352 transitions.
Applied a total of 0 rules in 81 ms. Remains 1867 /1867 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-25 20:12:57] [INFO ] Invariant cache hit.
[2024-05-25 20:13:00] [INFO ] Implicit Places using invariants in 2287 ms returned []
[2024-05-25 20:13:00] [INFO ] Invariant cache hit.
[2024-05-25 20:13:03] [INFO ] Implicit Places using invariants and state equation in 3730 ms returned []
Implicit Place search using SMT with State Equation took 6018 ms to find 0 implicit places.
[2024-05-25 20:13:03] [INFO ] Redundant transitions in 23 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-25 20:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2218/2219 variables, and 3384 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1866 variables, 1518/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1866 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 352/2218 variables, 1866/3384 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2218 variables, 328/3712 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2218/2219 variables, and 3712 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1518/1518 constraints, State Equation: 1866/1867 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66527 ms. Remains : 1867/1867 places, 352/352 transitions.
Built C files in :
/tmp/ltsmin16600129336109819102
[2024-05-25 20:14:04] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2024-05-25 20:14:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:14:04] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2024-05-25 20:14:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:14:04] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2024-05-25 20:14:04] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:14:04] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16600129336109819102
Running compilation step : cd /tmp/ltsmin16600129336109819102;'/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 1659 ms.
Running link step : cd /tmp/ltsmin16600129336109819102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16600129336109819102;'/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/stateBased8332459839988491611.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:14:19] [INFO ] Flatten gal took : 55 ms
[2024-05-25 20:14:19] [INFO ] Flatten gal took : 52 ms
[2024-05-25 20:14:19] [INFO ] Time to serialize gal into /tmp/LTL6168897832042736016.gal : 11 ms
[2024-05-25 20:14:19] [INFO ] Time to serialize properties into /tmp/LTL7906384816014735221.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/LTL6168897832042736016.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3628018522795114245.hoa' '-atoms' '/tmp/LTL7906384816014735221.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...317
Loading property file /tmp/LTL7906384816014735221.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3628018522795114245.hoa
Detected timeout of ITS tools.
[2024-05-25 20:14:34] [INFO ] Flatten gal took : 45 ms
[2024-05-25 20:14:34] [INFO ] Flatten gal took : 44 ms
[2024-05-25 20:14:34] [INFO ] Time to serialize gal into /tmp/LTL7762122596944305007.gal : 10 ms
[2024-05-25 20:14:34] [INFO ] Time to serialize properties into /tmp/LTL16960373202302053497.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/LTL7762122596944305007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16960373202302053497.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(("(s5_16<=Astart)")||(G("(malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(malicious_reservoir>=1)" & FG!"(s5_16<=Astart)")
Detected timeout of ITS tools.
[2024-05-25 20:14:49] [INFO ] Flatten gal took : 41 ms
[2024-05-25 20:14:49] [INFO ] Applying decomposition
[2024-05-25 20:14:49] [INFO ] Flatten gal took : 40 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/graph6402729522564907878.txt' '-o' '/tmp/graph6402729522564907878.bin' '-w' '/tmp/graph6402729522564907878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6402729522564907878.bin' '-l' '-1' '-v' '-w' '/tmp/graph6402729522564907878.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:14:50] [INFO ] Decomposing Gal with order
[2024-05-25 20:14:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:14:50] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-25 20:14:50] [INFO ] Flatten gal took : 273 ms
[2024-05-25 20:14:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 471 labels/synchronizations in 144 ms.
[2024-05-25 20:14:50] [INFO ] Time to serialize gal into /tmp/LTL12465971908007457311.gal : 18 ms
[2024-05-25 20:14:50] [INFO ] Time to serialize properties into /tmp/LTL3329438657580958921.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/LTL12465971908007457311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3329438657580958921.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(("(gu24.s5_16<=gu24.Astart)")||(G("(gu0.malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(gu0.malicious_reservoir>=1)" & FG!"(gu24.s5_16<=gu24.Astart)")
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-11 finished in 226421 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(p1)&&p0)))'
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1341 are kept as prefixes of interest. Removing 557 places using SCC suffix rule.9 ms
Discarding 557 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1296 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1296 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 1295 transition count 264
Applied a total of 91 rules in 120 ms. Remains 1295 /1898 variables (removed 603) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1295 cols
[2024-05-25 20:15:06] [INFO ] Computed 1034 invariants in 9 ms
[2024-05-25 20:15:07] [INFO ] Implicit Places using invariants in 1421 ms returned []
[2024-05-25 20:15:07] [INFO ] Invariant cache hit.
[2024-05-25 20:15:13] [INFO ] Implicit Places using invariants and state equation in 5450 ms returned [1254, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6872 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1272/1898 places, 264/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1272 /1272 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7038 ms. Remains : 1272/1898 places, 264/356 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-12
Stuttering criterion allowed to conclude after 84 steps with 2 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-12 finished in 7155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(F(p0)&&G(p1))))&&F(G(p2)))))'
Support contains 3 out of 1898 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 : 1898/1898 places, 356/356 transitions.
Graph (complete) has 14937 edges and 1898 vertex of which 1872 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.4 ms
Discarding 26 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 1869 transition count 351
Applied a total of 5 rules in 132 ms. Remains 1869 /1898 variables (removed 29) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1869 cols
[2024-05-25 20:15:13] [INFO ] Computed 1520 invariants in 30 ms
[2024-05-25 20:15:15] [INFO ] Implicit Places using invariants in 2277 ms returned []
[2024-05-25 20:15:15] [INFO ] Invariant cache hit.
[2024-05-25 20:15:22] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned [1163, 1828, 1832, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 9315 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/1898 places, 351/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9516 ms. Remains : 1845/1898 places, 351/356 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLCardinality-13
Product exploration explored 100000 steps with 8561 reset in 369 ms.
Product exploration explored 100000 steps with 8522 reset in 370 ms.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 355 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
RANDOM walk for 6041 steps (210 resets) in 38 ms. (154 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 496 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
// Phase 1: matrix 351 rows 1845 cols
[2024-05-25 20:15:25] [INFO ] Computed 1497 invariants in 28 ms
[2024-05-25 20:15:25] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-25 20:15:27] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2233 ms returned sat
[2024-05-25 20:15:40] [INFO ] [Real]Absence check using state equation in 12197 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1845 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 : 1845/1845 places, 351/351 transitions.
Applied a total of 0 rules in 70 ms. Remains 1845 /1845 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2024-05-25 20:15:40] [INFO ] Invariant cache hit.
[2024-05-25 20:15:42] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2024-05-25 20:15:42] [INFO ] Invariant cache hit.
[2024-05-25 20:15:55] [INFO ] Implicit Places using invariants and state equation in 13059 ms returned []
Implicit Place search using SMT with State Equation took 15283 ms to find 0 implicit places.
[2024-05-25 20:15:55] [INFO ] Redundant transitions in 24 ms returned []
Running 304 sub problems to find dead transitions.
[2024-05-25 20:15:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1820 variables, 1496/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1820 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 2/1822 variables, 1/1497 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 12.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)timeout

(s423 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1822 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 304 unsolved
SMT process timed out in 30404ms, After SMT, problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 30408ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45791 ms. Remains : 1845/1845 places, 351/351 transitions.
Computed a total of 1845 stabilizing places and 351 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1845 transition count 351
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 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
RANDOM walk for 1238 steps (43 resets) in 10 ms. (112 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
[2024-05-25 20:16:27] [INFO ] Invariant cache hit.
[2024-05-25 20:16:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-25 20:16:29] [INFO ] [Real]Absence check using 1 positive and 1496 generalized place invariants in 2002 ms returned sat
[2024-05-25 20:16:42] [INFO ] [Real]Absence check using state equation in 12461 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 8589 reset in 306 ms.
Product exploration explored 100000 steps with 8651 reset in 321 ms.
Built C files in :
/tmp/ltsmin2980714506068251176
[2024-05-25 20:16:43] [INFO ] Computing symmetric may disable matrix : 351 transitions.
[2024-05-25 20:16:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:16:43] [INFO ] Computing symmetric may enable matrix : 351 transitions.
[2024-05-25 20:16:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:16:43] [INFO ] Computing Do-Not-Accords matrix : 351 transitions.
[2024-05-25 20:16:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:16:43] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2980714506068251176
Running compilation step : cd /tmp/ltsmin2980714506068251176;'/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 1630 ms.
Running link step : cd /tmp/ltsmin2980714506068251176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2980714506068251176;'/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/stateBased240753571490456414.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 351/351 transitions.
Graph (complete) has 15804 edges and 1845 vertex of which 1315 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.8 ms
Discarding 530 places :
Also discarding 0 output transitions
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1271 transition count 263
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1271 transition count 263
Applied a total of 89 rules in 89 ms. Remains 1271 /1845 variables (removed 574) and now considering 263/351 (removed 88) transitions.
// Phase 1: matrix 263 rows 1271 cols
[2024-05-25 20:16:58] [INFO ] Computed 1012 invariants in 20 ms
[2024-05-25 20:16:59] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2024-05-25 20:16:59] [INFO ] Invariant cache hit.
[2024-05-25 20:17:07] [INFO ] Implicit Places using invariants and state equation in 7518 ms returned []
Implicit Place search using SMT with State Equation took 8918 ms to find 0 implicit places.
[2024-05-25 20:17:07] [INFO ] Redundant transitions in 21 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-25 20:17:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1510 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1510 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 24/1534 variables, 24/2283 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1534 variables, 0/2283 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1534/1534 variables, and 2283 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1271/1271 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 263/1510 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1510 variables, 29/2288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1510 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 24/1534 variables, 24/2312 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1534/1534 variables, and 2499 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1271/1271 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1845 places, 263/351 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69296 ms. Remains : 1271/1845 places, 263/351 transitions.
Built C files in :
/tmp/ltsmin5653046964703017370
[2024-05-25 20:18:07] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-25 20:18:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:18:07] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-25 20:18:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:18:07] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-25 20:18:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:18:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5653046964703017370
Running compilation step : cd /tmp/ltsmin5653046964703017370;'/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 1112 ms.
Running link step : cd /tmp/ltsmin5653046964703017370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5653046964703017370;'/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/stateBased5263238707338818696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:18:22] [INFO ] Flatten gal took : 41 ms
[2024-05-25 20:18:22] [INFO ] Flatten gal took : 36 ms
[2024-05-25 20:18:22] [INFO ] Time to serialize gal into /tmp/LTL411373301223167802.gal : 4 ms
[2024-05-25 20:18:22] [INFO ] Time to serialize properties into /tmp/LTL1837702882999720934.prop : 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/LTL411373301223167802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16130158742194182223.hoa' '-atoms' '/tmp/LTL1837702882999720934.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...317
Loading property file /tmp/LTL1837702882999720934.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16130158742194182223.hoa
Detected timeout of ITS tools.
[2024-05-25 20:18:37] [INFO ] Flatten gal took : 39 ms
[2024-05-25 20:18:37] [INFO ] Flatten gal took : 39 ms
[2024-05-25 20:18:37] [INFO ] Time to serialize gal into /tmp/LTL11574024880045470924.gal : 6 ms
[2024-05-25 20:18:37] [INFO ] Time to serialize properties into /tmp/LTL12236245929513861297.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/LTL11574024880045470924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12236245929513861297.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 : !((G((F((G(F("(SstopAbort>s4_14)")))||((F("(SstopAbort>s4_14)"))&&(G("(c1_8>CstopAbort)")))))&&(F(G("(s2_5<=SstopAbort)"))))))
Formula 0 simplified : F(G(FG!"(SstopAbort>s4_14)" & (G!"(SstopAbort>s4_14)" | F!"(c1_8>CstopAbort)")) | GF!"(s2_5<=SstopAbort)")
Detected timeout of ITS tools.
[2024-05-25 20:18:52] [INFO ] Flatten gal took : 36 ms
[2024-05-25 20:18:52] [INFO ] Applying decomposition
[2024-05-25 20:18:52] [INFO ] Flatten gal took : 37 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/graph8111822297396441972.txt' '-o' '/tmp/graph8111822297396441972.bin' '-w' '/tmp/graph8111822297396441972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8111822297396441972.bin' '-l' '-1' '-v' '-w' '/tmp/graph8111822297396441972.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:18:53] [INFO ] Decomposing Gal with order
[2024-05-25 20:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:18:53] [INFO ] Removed a total of 204 redundant transitions.
[2024-05-25 20:18:53] [INFO ] Flatten gal took : 104 ms
[2024-05-25 20:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 57 ms.
[2024-05-25 20:18:53] [INFO ] Time to serialize gal into /tmp/LTL6119729278835520255.gal : 16 ms
[2024-05-25 20:18:53] [INFO ] Time to serialize properties into /tmp/LTL9269751866824398692.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/LTL6119729278835520255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9269751866824398692.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((G(F("(gu22.SstopAbort>gu22.s4_14)")))||((F("(gu22.SstopAbort>gu22.s4_14)"))&&(G("(gu0.c1_8>gu0.CstopAbort)")))))&&(F(G("(gu22...185
Formula 0 simplified : F(G(FG!"(gu22.SstopAbort>gu22.s4_14)" & (G!"(gu22.SstopAbort>gu22.s4_14)" | F!"(gu0.c1_8>gu0.CstopAbort)")) | GF!"(gu22.s2_5<=gu22.S...167
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLCardinality-13 finished in 235424 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)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(F(p0)&&G(p1))))&&F(G(p2)))))'
[2024-05-25 20:19:08] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin181243048357507892
[2024-05-25 20:19:08] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-25 20:19:08] [INFO ] Applying decomposition
[2024-05-25 20:19:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:19:08] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-25 20:19:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:19:08] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-25 20:19:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:19:08] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin181243048357507892
Running compilation step : cd /tmp/ltsmin181243048357507892;'/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'
[2024-05-25 20:19:08] [INFO ] Flatten gal took : 37 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/graph14303132247046572941.txt' '-o' '/tmp/graph14303132247046572941.bin' '-w' '/tmp/graph14303132247046572941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14303132247046572941.bin' '-l' '-1' '-v' '-w' '/tmp/graph14303132247046572941.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:19:09] [INFO ] Decomposing Gal with order
[2024-05-25 20:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:19:09] [INFO ] Removed a total of 176 redundant transitions.
[2024-05-25 20:19:09] [INFO ] Flatten gal took : 104 ms
[2024-05-25 20:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 69 ms.
[2024-05-25 20:19:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality18368996650084318188.gal : 20 ms
[2024-05-25 20:19:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality3366914261387975332.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/LTLCardinality18368996650084318188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3366914261387975332.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F(("(gu113.s5_16<=gu113.Astart)")||(G("(gu21.malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(gu21.malicious_reservoir>=1)" & FG!"(gu113.s5_16<=gu113.Astart)")
Compilation finished in 1789 ms.
Running link step : cd /tmp/ltsmin181243048357507892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin181243048357507892;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin181243048357507892;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin181243048357507892;'/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' '[]((<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&[]((LTLAPp3==true)))))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-25 20:41:37] [INFO ] Flatten gal took : 100 ms
[2024-05-25 20:41:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality8121190748247745981.gal : 6 ms
[2024-05-25 20:41:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality1423574473723037348.ltl : 9 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/LTLCardinality8121190748247745981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1423574473723037348.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...297
Read 2 LTL properties
Checking formula 0 : !((G(F(("(s5_16<=Astart)")||(G("(malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(malicious_reservoir>=1)" & FG!"(s5_16<=Astart)")
LTSmin run took 704125 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin181243048357507892;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-25 21:01:53] [INFO ] Flatten gal took : 115 ms
[2024-05-25 21:01:53] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 21:01:53] [INFO ] Transformed 1898 places.
[2024-05-25 21:01:53] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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 21:01:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality5736167047345780731.gal : 13 ms
[2024-05-25 21:01:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality13205046074058396990.ltl : 8 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/LTLCardinality5736167047345780731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13205046074058396990.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 : !((G(F(("(s5_16<=Astart)")||(G("(malicious_reservoir>=1)"))))))
Formula 0 simplified : G(F!"(malicious_reservoir>=1)" & FG!"(s5_16<=Astart)")

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-PT-22"
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-PT-22, 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-171662337800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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