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.r334-tall-171679079500067.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 RingSingleMessageInMbox-PT-d1m010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 00:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 00:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m010-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716795122203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-27 07:32:03] [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-27 07:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:32:03] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2024-05-27 07:32:03] [INFO ] Transformed 6690 places.
[2024-05-27 07:32:03] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:32:03] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4305 places in 40 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1100 places :
Symmetric choice reduction at 1 with 1100 rule applications. Total rules 1219 place count 1268 transition count 2428
Iterating global reduction 1 with 1100 rules applied. Total rules applied 2319 place count 1268 transition count 2428
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2391 place count 1268 transition count 2356
Discarding 930 places :
Symmetric choice reduction at 2 with 930 rule applications. Total rules 3321 place count 338 transition count 1426
Iterating global reduction 2 with 930 rules applied. Total rules applied 4251 place count 338 transition count 1426
Ensure Unique test removed 884 transitions
Reduce isomorphic transitions removed 884 transitions.
Iterating post reduction 2 with 884 rules applied. Total rules applied 5135 place count 338 transition count 542
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 5264 place count 209 transition count 413
Iterating global reduction 3 with 129 rules applied. Total rules applied 5393 place count 209 transition count 413
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5491 place count 209 transition count 315
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 5498 place count 202 transition count 308
Iterating global reduction 4 with 7 rules applied. Total rules applied 5505 place count 202 transition count 308
Applied a total of 5505 rules in 338 ms. Remains 202 /2385 variables (removed 2183) and now considering 308/11934 (removed 11626) transitions.
// Phase 1: matrix 308 rows 202 cols
[2024-05-27 07:32:04] [INFO ] Computed 3 invariants in 22 ms
[2024-05-27 07:32:04] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-27 07:32:04] [INFO ] Invariant cache hit.
[2024-05-27 07:32:04] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-27 07:32:05] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-05-27 07:32:05] [INFO ] Invariant cache hit.
[2024-05-27 07:32:05] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 1/202 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 4 (OVERLAPS) 308/510 variables, 202/205 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 118/323 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/323 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/510 variables, 0/323 constraints. Problems are: Problem set: 24 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 323 constraints, problems are : Problem set: 24 solved, 283 unsolved in 12075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 17/194 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 8/202 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 308/510 variables, 202/205 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 118/323 constraints. Problems are: Problem set: 24 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 283/606 constraints. Problems are: Problem set: 24 solved, 283 unsolved
[2024-05-27 07:32:26] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 15 ms to minimize.
[2024-05-27 07:32:26] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 1 ms to minimize.
[2024-05-27 07:32:26] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 2 ms to minimize.
[2024-05-27 07:32:28] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-27 07:32:28] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-27 07:32:28] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
[2024-05-27 07:32:31] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 7/613 constraints. Problems are: Problem set: 46 solved, 261 unsolved
[2024-05-27 07:32:42] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 1/614 constraints. Problems are: Problem set: 46 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 614 constraints, problems are : Problem set: 46 solved, 261 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 202/202 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 283/307 constraints, Known Traps: 8/8 constraints]
After SMT, in 43042ms problems are : Problem set: 46 solved, 261 unsolved
Search for dead transitions found 46 dead transitions in 43058ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/2385 places, 262/11934 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 160 transition count 244
Applied a total of 60 rules in 4 ms. Remains 160 /202 variables (removed 42) and now considering 244/262 (removed 18) transitions.
// Phase 1: matrix 244 rows 160 cols
[2024-05-27 07:32:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:32:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 07:32:48] [INFO ] Invariant cache hit.
[2024-05-27 07:32:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-27 07:32:48] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/2385 places, 244/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44691 ms. Remains : 160/2385 places, 244/11934 transitions.
Support contains 13 out of 160 places after structural reductions.
[2024-05-27 07:32:49] [INFO ] Flatten gal took : 41 ms
[2024-05-27 07:32:49] [INFO ] Flatten gal took : 18 ms
[2024-05-27 07:32:49] [INFO ] Input system was already deterministic with 244 transitions.
RANDOM walk for 40000 steps (7150 resets) in 1908 ms. (20 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40001 steps (1809 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1743 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2005 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
[2024-05-27 07:32:49] [INFO ] Invariant cache hit.
[2024-05-27 07:32:49] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 61/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 156/226 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 22/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 8 (OVERLAPS) 174/400 variables, 86/180 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 88/268 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/268 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/404 variables, 4/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/404 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 272 constraints, problems are : Problem set: 3 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/63 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 154/221 variables, 67/69 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/89 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 179/400 variables, 89/178 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 90/268 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/404 variables, 4/273 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/404 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 273 constraints, problems are : Problem set: 3 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 244/244 transitions.
Graph (complete) has 520 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 157 transition count 235
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 23 place count 146 transition count 224
Iterating global reduction 1 with 11 rules applied. Total rules applied 34 place count 146 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 146 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 45 place count 140 transition count 213
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 140 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 57 place count 140 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 138 transition count 181
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 138 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 137 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 137 transition count 180
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 133 transition count 176
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 133 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 79 place count 133 transition count 168
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 4 with 4 rules applied. Total rules applied 83 place count 131 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 131 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 129 transition count 164
Applied a total of 87 rules in 54 ms. Remains 129 /160 variables (removed 31) and now considering 164/244 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 129/160 places, 164/244 transitions.
RANDOM walk for 40000 steps (7496 resets) in 867 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2257 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1169 steps, run visited all 1 properties in 13 ms. (steps per millisecond=89 )
Probabilistic random walk after 1169 steps, saw 579 distinct states, run finished after 16 ms. (steps per millisecond=73 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 70 stable transitions
Graph (complete) has 572 edges and 160 vertex of which 159 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 244/244 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 148 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 148 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 148 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 141 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 141 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 141 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 138 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 137 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 137 transition count 185
Applied a total of 58 rules in 33 ms. Remains 137 /160 variables (removed 23) and now considering 185/244 (removed 59) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 07:32:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:32:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:32:50] [INFO ] Invariant cache hit.
[2024-05-27 07:32:50] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:32:50] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-27 07:32:50] [INFO ] Redundant transitions in 6 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:32:50] [INFO ] Invariant cache hit.
[2024-05-27 07:32:50] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:33:00] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 395 constraints, problems are : Problem set: 0 solved, 184 unsolved in 12833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
After SMT, in 18368ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 18371ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/160 places, 185/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18709 ms. Remains : 137/160 places, 185/244 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLCardinality-02
Product exploration explored 100000 steps with 20708 reset in 252 ms.
Product exploration explored 100000 steps with 20514 reset in 201 ms.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 471 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24222 steps (4908 resets) in 124 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 185/185 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-27 07:33:10] [INFO ] Invariant cache hit.
[2024-05-27 07:33:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 07:33:10] [INFO ] Invariant cache hit.
[2024-05-27 07:33:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:33:10] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-27 07:33:10] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:33:10] [INFO ] Invariant cache hit.
[2024-05-27 07:33:10] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-27 07:33:20] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 395 constraints, problems are : Problem set: 0 solved, 184 unsolved in 12757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
After SMT, in 18293ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 18295ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18598 ms. Remains : 137/137 places, 185/185 transitions.
Computed a total of 4 stabilizing places and 23 stable transitions
Graph (complete) has 471 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 4 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11015 steps (2301 resets) in 39 ms. (275 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20503 reset in 161 ms.
Product exploration explored 100000 steps with 20514 reset in 148 ms.
Built C files in :
/tmp/ltsmin1819104091966665593
[2024-05-27 07:33:29] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-27 07:33:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:33:29] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-27 07:33:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:33:29] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-27 07:33:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:33:29] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1819104091966665593
Running compilation step : cd /tmp/ltsmin1819104091966665593;'/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 683 ms.
Running link step : cd /tmp/ltsmin1819104091966665593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1819104091966665593;'/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/stateBased14412198538219660531.hoa' '--buchi-type=spotba'
LTSmin run took 984 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLCardinality-02 finished in 41113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 244/244 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 148 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 148 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 148 transition count 227
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 141 transition count 220
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 141 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 141 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 138 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 137 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 137 transition count 186
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 133 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 133 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 73 place count 133 transition count 174
Applied a total of 73 rules in 31 ms. Remains 133 /160 variables (removed 27) and now considering 174/244 (removed 70) transitions.
// Phase 1: matrix 174 rows 133 cols
[2024-05-27 07:33:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:33:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:33:31] [INFO ] Invariant cache hit.
[2024-05-27 07:33:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:33:32] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-27 07:33:32] [INFO ] Redundant transitions in 4 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-27 07:33:32] [INFO ] Invariant cache hit.
[2024-05-27 07:33:32] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 199 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 173/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 372 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 13557ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 13560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/160 places, 174/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13891 ms. Remains : 133/160 places, 174/244 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLCardinality-03
Product exploration explored 100000 steps with 18672 reset in 130 ms.
Product exploration explored 100000 steps with 18724 reset in 133 ms.
Computed a total of 8 stabilizing places and 36 stable transitions
Graph (complete) has 452 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 36 stable transitions
Detected a total of 8/133 stabilizing places and 36/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3340 steps (626 resets) in 16 ms. (196 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 174/174 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-27 07:33:46] [INFO ] Invariant cache hit.
[2024-05-27 07:33:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 07:33:46] [INFO ] Invariant cache hit.
[2024-05-27 07:33:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:33:46] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-27 07:33:46] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-27 07:33:46] [INFO ] Invariant cache hit.
[2024-05-27 07:33:46] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 199 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 173/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 372 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8929 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 13901ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 13903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14232 ms. Remains : 133/133 places, 174/174 transitions.
Computed a total of 8 stabilizing places and 36 stable transitions
Graph (complete) has 452 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 36 stable transitions
Detected a total of 8/133 stabilizing places and 36/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3208 steps (604 resets) in 28 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18694 reset in 124 ms.
Product exploration explored 100000 steps with 18621 reset in 132 ms.
Built C files in :
/tmp/ltsmin15760969515208128795
[2024-05-27 07:34:01] [INFO ] Computing symmetric may disable matrix : 174 transitions.
[2024-05-27 07:34:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:01] [INFO ] Computing symmetric may enable matrix : 174 transitions.
[2024-05-27 07:34:01] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:01] [INFO ] Computing Do-Not-Accords matrix : 174 transitions.
[2024-05-27 07:34:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:01] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760969515208128795
Running compilation step : cd /tmp/ltsmin15760969515208128795;'/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 412 ms.
Running link step : cd /tmp/ltsmin15760969515208128795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15760969515208128795;'/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/stateBased4254682319295261734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-27 07:34:16] [INFO ] Invariant cache hit.
[2024-05-27 07:34:16] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:34:16] [INFO ] Invariant cache hit.
[2024-05-27 07:34:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:34:16] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-27 07:34:16] [INFO ] Redundant transitions in 2 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-27 07:34:16] [INFO ] Invariant cache hit.
[2024-05-27 07:34:16] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 199 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/307 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 173/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 372 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 13684ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 13686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13990 ms. Remains : 133/133 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin16390156254083082188
[2024-05-27 07:34:30] [INFO ] Computing symmetric may disable matrix : 174 transitions.
[2024-05-27 07:34:30] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:30] [INFO ] Computing symmetric may enable matrix : 174 transitions.
[2024-05-27 07:34:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:30] [INFO ] Computing Do-Not-Accords matrix : 174 transitions.
[2024-05-27 07:34:30] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:34:30] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16390156254083082188
Running compilation step : cd /tmp/ltsmin16390156254083082188;'/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 390 ms.
Running link step : cd /tmp/ltsmin16390156254083082188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16390156254083082188;'/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/stateBased2992693100084008723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 07:34:45] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:34:45] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:34:45] [INFO ] Time to serialize gal into /tmp/LTL11788483010972389622.gal : 3 ms
[2024-05-27 07:34:45] [INFO ] Time to serialize properties into /tmp/LTL13248369227755386058.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/LTL11788483010972389622.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8303733387388431255.hoa' '-atoms' '/tmp/LTL13248369227755386058.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...319
Loading property file /tmp/LTL13248369227755386058.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8303733387388431255.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t22, t23, t24, t25, t33, t34, t35, t36, t37, t38, t39, t40, t41, t66, t67, t68, t71,...570
Computing Next relation with stutter on 1.07119e+08 deadlock states
58 unique states visited
0 strongly connected components in search stack
65 transitions explored
54 items max in DFS search stack
1266 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.6825,326688,1,0,446,1.09468e+06,378,309,5058,1.36948e+06,816
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLCardinality-03 finished in 88218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 244/244 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 149 transition count 233
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 149 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 149 transition count 229
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 142 transition count 222
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 142 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 142 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 139 transition count 189
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 139 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 138 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 138 transition count 188
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 134 transition count 184
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 134 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 134 transition count 176
Applied a total of 70 rules in 21 ms. Remains 134 /160 variables (removed 26) and now considering 176/244 (removed 68) transitions.
// Phase 1: matrix 176 rows 134 cols
[2024-05-27 07:34:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:35:00] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:35:00] [INFO ] Invariant cache hit.
[2024-05-27 07:35:00] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-27 07:35:00] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-27 07:35:00] [INFO ] Redundant transitions in 0 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-27 07:35:00] [INFO ] Invariant cache hit.
[2024-05-27 07:35:00] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/310 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 65/201 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 201 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/310 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 65/201 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 175/376 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 376 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 15119ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 15121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/160 places, 176/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15431 ms. Remains : 134/160 places, 176/244 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLCardinality-07
Stuttering criterion allowed to conclude after 355 steps with 66 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLCardinality-07 finished in 15497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 244/244 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 148 transition count 232
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 148 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 148 transition count 228
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 140 transition count 220
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 140 transition count 220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 51 place count 140 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 137 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 136 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 136 transition count 184
Applied a total of 60 rules in 10 ms. Remains 136 /160 variables (removed 24) and now considering 184/244 (removed 60) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 07:35:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:35:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 07:35:15] [INFO ] Invariant cache hit.
[2024-05-27 07:35:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:35:15] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-27 07:35:15] [INFO ] Invariant cache hit.
[2024-05-27 07:35:15] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-27 07:35:18] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:35:18] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 211 constraints, problems are : Problem set: 0 solved, 183 unsolved in 6991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/320 variables, 136/140 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 71/211 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 183/394 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 394 constraints, problems are : Problem set: 0 solved, 183 unsolved in 10139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 2/2 constraints]
After SMT, in 17352ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 17356ms
Starting structural reductions in LTL mode, iteration 1 : 136/160 places, 184/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17687 ms. Remains : 136/160 places, 184/244 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m010-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m010-LTLCardinality-11 finished in 17899 ms.
All properties solved by simple procedures.
Total runtime 210012 ms.

BK_STOP 1716795333375

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r334-tall-171679079500067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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