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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K 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 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 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 DES-PT-10b-LTLCardinality-00
FORMULA_NAME DES-PT-10b-LTLCardinality-01
FORMULA_NAME DES-PT-10b-LTLCardinality-02
FORMULA_NAME DES-PT-10b-LTLCardinality-03
FORMULA_NAME DES-PT-10b-LTLCardinality-04
FORMULA_NAME DES-PT-10b-LTLCardinality-05
FORMULA_NAME DES-PT-10b-LTLCardinality-06
FORMULA_NAME DES-PT-10b-LTLCardinality-07
FORMULA_NAME DES-PT-10b-LTLCardinality-08
FORMULA_NAME DES-PT-10b-LTLCardinality-09
FORMULA_NAME DES-PT-10b-LTLCardinality-10
FORMULA_NAME DES-PT-10b-LTLCardinality-11
FORMULA_NAME DES-PT-10b-LTLCardinality-12
FORMULA_NAME DES-PT-10b-LTLCardinality-13
FORMULA_NAME DES-PT-10b-LTLCardinality-14
FORMULA_NAME DES-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716343654119

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 02:07:35] [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-22 02:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:07:35] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 02:07:35] [INFO ] Transformed 320 places.
[2024-05-22 02:07:35] [INFO ] Transformed 271 transitions.
[2024-05-22 02:07:35] [INFO ] Found NUPN structural information;
[2024-05-22 02:07:35] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 195 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.
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 296 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 296 transition count 250
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 283 transition count 237
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 283 transition count 237
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 283 transition count 228
Applied a total of 80 rules in 85 ms. Remains 283 /320 variables (removed 37) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 283 cols
[2024-05-22 02:07:35] [INFO ] Computed 62 invariants in 27 ms
[2024-05-22 02:07:36] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-22 02:07:36] [INFO ] Invariant cache hit.
[2024-05-22 02:07:36] [INFO ] Implicit Places using invariants and state equation in 307 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 647 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 228/271 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 282/320 places, 228/271 transitions.
Support contains 23 out of 282 places after structural reductions.
[2024-05-22 02:07:36] [INFO ] Flatten gal took : 42 ms
[2024-05-22 02:07:36] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:07:36] [INFO ] Input system was already deterministic with 228 transitions.
Support contains 21 out of 282 places (down from 23) after GAL structural reductions.
RANDOM walk for 14814 steps (127 resets) in 471 ms. (31 steps per ms) remains 0/14 properties
FORMULA DES-PT-10b-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 277 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 274 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 274 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 273 transition count 214
Applied a total of 23 rules in 38 ms. Remains 273 /282 variables (removed 9) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-22 02:07:37] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 02:07:37] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 02:07:37] [INFO ] Invariant cache hit.
[2024-05-22 02:07:37] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 02:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:40] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/487 variables, 273/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:07:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 11 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:07:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:07:47] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:07:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-22 02:07:47] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 4 ms to minimize.
[2024-05-22 02:07:47] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:49] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:07:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/487 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:07:59] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:03] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:06] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:08:07] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:08:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 381 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:09] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:08:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:08:09] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:08:09] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 214/487 variables, 273/388 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 213/601 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:08:17] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:08:17] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 4 ms to minimize.
[2024-05-22 02:08:17] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:08:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 02:08:23] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:08:23] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 607 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 60/60 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-03
Stuttering criterion allowed to conclude after 963 steps with 26 reset in 12 ms.
FORMULA DES-PT-10b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-03 finished in 61034 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 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 248 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 248 transition count 196
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 248 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 247 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 247 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 247 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 246 transition count 191
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 212 place count 172 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 220 place count 168 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 166 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 165 transition count 124
Applied a total of 223 rules in 58 ms. Remains 165 /282 variables (removed 117) and now considering 124/228 (removed 104) transitions.
// Phase 1: matrix 124 rows 165 cols
[2024-05-22 02:08:38] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 02:08:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 02:08:38] [INFO ] Invariant cache hit.
[2024-05-22 02:08:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 02:08:38] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-22 02:08:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/164 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 124/288 variables, 164/222 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:08:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/289 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:08:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:08:41] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-22 02:08:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:08:42] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:08:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 230 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5966 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 3/164 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 124/288 variables, 164/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 120/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:08:52] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 351 constraints, problems are : Problem set: 0 solved, 120 unsolved in 23149 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 8/8 constraints]
After SMT, in 29162ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 29164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/282 places, 124/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29547 ms. Remains : 165/282 places, 124/228 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-04
Product exploration explored 100000 steps with 4526 reset in 449 ms.
Product exploration explored 100000 steps with 4618 reset in 367 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 557 steps (24 resets) in 13 ms. (39 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 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-22 02:09:08] [INFO ] Invariant cache hit.
[2024-05-22 02:09:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 02:09:08] [INFO ] Invariant cache hit.
[2024-05-22 02:09:09] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-22 02:09:09] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-22 02:09:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/164 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 124/288 variables, 164/222 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:09:10] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:09:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/289 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:09:11] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:09:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:09:12] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:09:13] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:09:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 230 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6054 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 3/164 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 124/288 variables, 164/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 120/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 02:09:22] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 351 constraints, problems are : Problem set: 0 solved, 120 unsolved in 22944 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 8/8 constraints]
After SMT, in 29031ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 29033ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 29333 ms. Remains : 165/165 places, 124/124 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 81 steps (3 resets) in 6 ms. (11 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 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4696 reset in 225 ms.
Product exploration explored 100000 steps with 4638 reset in 246 ms.
Built C files in :
/tmp/ltsmin11035265365195560475
[2024-05-22 02:09:39] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-22 02:09:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:09:39] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-22 02:09:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:09:39] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-22 02:09:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:09:39] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11035265365195560475
Running compilation step : cd /tmp/ltsmin11035265365195560475;'/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 529 ms.
Running link step : cd /tmp/ltsmin11035265365195560475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11035265365195560475;'/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/stateBased5980884101620976790.hoa' '--buchi-type=spotba'
LTSmin run took 2952 ms.
FORMULA DES-PT-10b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLCardinality-04 finished in 64573 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 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 276 transition count 210
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 262 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 246 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 246 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 246 transition count 193
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 65 place count 243 transition count 190
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 243 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 72 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 74 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 74 place count 242 transition count 183
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 78 place count 240 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 228 place count 165 transition count 108
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 6 with 4 rules applied. Total rules applied 232 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 160 transition count 108
Applied a total of 235 rules in 53 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2024-05-22 02:09:42] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:09:42] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 02:09:42] [INFO ] Invariant cache hit.
[2024-05-22 02:09:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 02:09:42] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 02:09:42] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 02:09:42] [INFO ] Invariant cache hit.
[2024-05-22 02:09:42] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 108/267 variables, 159/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:09:45] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:09:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/268 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:09:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:09:47] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:09:47] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:09:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/268 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 0/268 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 230 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6655 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 160/160 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/158 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 108/267 variables, 159/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 105/334 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:09:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:09:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 1/268 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:10:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:10:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:10:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/268 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:10:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:10:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/268 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:10:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:10:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/268 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/268 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 344 constraints, problems are : Problem set: 0 solved, 105 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 160/160 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 15/15 constraints]
After SMT, in 36691ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 36692ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37001 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-06
Stuttering criterion allowed to conclude after 481 steps with 12 reset in 4 ms.
FORMULA DES-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-06 finished in 37059 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) U (p2||X(p3)))||p0)))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 279 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 279 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 279 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 277 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 277 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 277 transition count 220
Applied a total of 13 rules in 8 ms. Remains 277 /282 variables (removed 5) and now considering 220/228 (removed 8) transitions.
// Phase 1: matrix 220 rows 277 cols
[2024-05-22 02:10:19] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 02:10:19] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 02:10:19] [INFO ] Invariant cache hit.
[2024-05-22 02:10:20] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-22 02:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/497 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:10:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:10:24] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:10:25] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:10:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:10:25] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:10:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:27] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:10:27] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:10:27] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:10:27] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:10:27] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:28] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:10:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:10:28] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:10:29] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:31] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:10:31] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:34] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:10:34] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:10:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:10:35] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:38] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:42] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:10:43] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:10:43] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:10:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/497 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (OVERLAPS) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 384 constraints, problems are : Problem set: 0 solved, 219 unsolved in 29353 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:50] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-22 02:10:50] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:10:51] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
[2024-05-22 02:10:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:10:51] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 5 ms to minimize.
[2024-05-22 02:10:51] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:10:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:10:53] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:53] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:10:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:10:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 220/497 variables, 277/396 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 219/615 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:10:59] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:11:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:11:03] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 618 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 61/61 constraints]
After SMT, in 59409ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 59411ms
Starting structural reductions in LTL mode, iteration 1 : 277/282 places, 220/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59789 ms. Remains : 277/282 places, 220/228 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-07
Product exploration explored 100000 steps with 884 reset in 228 ms.
Product exploration explored 100000 steps with 893 reset in 261 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (352 resets) in 437 ms. (91 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
[2024-05-22 02:11:20] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/166 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/247 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/262 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 208/470 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/489 variables, 11/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/493 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/493 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/495 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/497 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/497 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/497 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/166 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/247 variables, 25/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 02:11:21] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/262 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/470 variables, 262/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 19/489 variables, 11/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 493/497 variables, and 338 constraints, problems are : Problem set: 1 solved, 0 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 275/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 430ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p3))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 317 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-22 02:11:21] [INFO ] Invariant cache hit.
[2024-05-22 02:11:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 02:11:22] [INFO ] Invariant cache hit.
[2024-05-22 02:11:22] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-22 02:11:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/497 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:25] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:11:25] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:11:26] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:11:27] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:11:27] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:11:27] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:11:27] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:11:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:11:29] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:11:29] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 02:11:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:11:29] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:11:31] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:11:33] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:36] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:11:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:11:37] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:11:37] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:39] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:41] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:45] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:11:45] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:11:45] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:11:46] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/497 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (OVERLAPS) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 384 constraints, problems are : Problem set: 0 solved, 219 unsolved in 29867 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:53] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:11:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:11:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:11:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:11:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:11:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:11:55] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:11:56] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:11:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:11:57] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 220/497 variables, 277/396 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 219/615 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:12:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:12:04] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:12:05] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 618 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 61/61 constraints]
After SMT, in 59906ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 59910ms
Finished structural reductions in LTL mode , in 1 iterations and 60293 ms. Remains : 277/277 places, 220/220 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 5203 steps (43 resets) in 46 ms. (110 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p3 p1))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 334 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 874 reset in 169 ms.
Product exploration explored 100000 steps with 895 reset in 194 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Graph (complete) has 535 edges and 277 vertex of which 272 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 272 transition count 217
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 14 place count 272 transition count 218
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 272 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 267 transition count 213
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 267 transition count 213
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 109 place count 267 transition count 219
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 118 place count 258 transition count 210
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 127 place count 258 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 258 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 256 transition count 220
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 256 transition count 220
Deduced a syphon composed of 85 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 137 place count 256 transition count 217
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 137 rules in 64 ms. Remains 256 /277 variables (removed 21) and now considering 217/220 (removed 3) transitions.
[2024-05-22 02:12:24] [INFO ] Redundant transitions in 10 ms returned []
Running 216 sub problems to find dead transitions.
// Phase 1: matrix 217 rows 256 cols
[2024-05-22 02:12:24] [INFO ] Computed 59 invariants in 7 ms
[2024-05-22 02:12:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 5 (OVERLAPS) 217/473 variables, 256/315 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 2/317 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 1/318 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/318 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/318 constraints. Problems are: Problem set: 102 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 318 constraints, problems are : Problem set: 102 solved, 114 unsolved in 6107 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 102 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 13/13 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 65/235 variables, 31/44 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/45 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/45 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 14/249 variables, 15/60 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:31] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-22 02:12:31] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:12:31] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:12:31] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:12:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 5/65 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/65 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 213/462 variables, 249/314 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 2/316 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 114/430 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/431 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/431 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 11/473 variables, 7/438 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:12:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 2/440 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 1/441 constraints. Problems are: Problem set: 102 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 0/441 constraints. Problems are: Problem set: 102 solved, 114 unsolved
[2024-05-22 02:12:58] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 442 constraints, problems are : Problem set: 102 solved, 114 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 114/216 constraints, Known Traps: 11/11 constraints]
After SMT, in 36175ms problems are : Problem set: 102 solved, 114 unsolved
Search for dead transitions found 102 dead transitions in 36177ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) removed 102 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 256/277 places, 115/220 transitions.
Graph (complete) has 540 edges and 256 vertex of which 171 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 171 /256 variables (removed 85) and now considering 115/115 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/277 places, 115/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36281 ms. Remains : 171/277 places, 115/220 transitions.
Built C files in :
/tmp/ltsmin1163122625046372319
[2024-05-22 02:13:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1163122625046372319
Running compilation step : cd /tmp/ltsmin1163122625046372319;'/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 442 ms.
Running link step : cd /tmp/ltsmin1163122625046372319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1163122625046372319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4720532616473645457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 220/220 transitions.
Applied a total of 0 rules in 11 ms. Remains 277 /277 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 277 cols
[2024-05-22 02:13:15] [INFO ] Computed 61 invariants in 4 ms
[2024-05-22 02:13:15] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 02:13:15] [INFO ] Invariant cache hit.
[2024-05-22 02:13:16] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-22 02:13:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/497 variables, 277/338 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:13:19] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:13:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:13:21] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:13:23] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:13:23] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:13:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:13:23] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:13:24] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:13:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:13:25] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 9/372 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:27] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:13:27] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:13:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:13:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:13:31] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:32] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:34] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:39] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 3 ms to minimize.
[2024-05-22 02:13:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:13:39] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:13:39] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/497 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (OVERLAPS) 0/497 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 384 constraints, problems are : Problem set: 0 solved, 219 unsolved in 29712 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:13:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:13:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:13:49] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:13:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 02:13:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 220/497 variables, 277/396 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 219/615 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 02:13:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 02:13:58] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:13:59] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 618 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 61/61 constraints]
After SMT, in 59762ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 59765ms
Finished structural reductions in LTL mode , in 1 iterations and 60132 ms. Remains : 277/277 places, 220/220 transitions.
Built C files in :
/tmp/ltsmin13150269784941054058
[2024-05-22 02:14:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13150269784941054058
Running compilation step : cd /tmp/ltsmin13150269784941054058;'/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 426 ms.
Running link step : cd /tmp/ltsmin13150269784941054058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13150269784941054058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10529308748463371844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 02:14:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 02:14:31] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:14:31] [INFO ] Time to serialize gal into /tmp/LTL9315760821081823283.gal : 4 ms
[2024-05-22 02:14:31] [INFO ] Time to serialize properties into /tmp/LTL2426827776361210648.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/LTL9315760821081823283.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1184729669711872770.hoa' '-atoms' '/tmp/LTL2426827776361210648.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/LTL2426827776361210648.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1184729669711872770.hoa
Detected timeout of ITS tools.
[2024-05-22 02:14:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:14:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:14:46] [INFO ] Time to serialize gal into /tmp/LTL189868810508352247.gal : 2 ms
[2024-05-22 02:14:46] [INFO ] Time to serialize properties into /tmp/LTL18222870922888961629.ltl : 3 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/LTL189868810508352247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18222870922888961629.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(("((p129==0)||(p69==1))")||((F("((p145==0)||(p57==1))"))U(("(p197==1)")||(X("((p79==0)||(p78==1))")))))))
Formula 0 simplified : F(!"((p129==0)||(p69==1))" & (G!"((p145==0)||(p57==1))" R (!"(p197==1)" & X!"((p79==0)||(p78==1))")))
Detected timeout of ITS tools.
[2024-05-22 02:15:01] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:15:01] [INFO ] Applying decomposition
[2024-05-22 02:15:01] [INFO ] Flatten gal took : 15 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/graph3723098451797791340.txt' '-o' '/tmp/graph3723098451797791340.bin' '-w' '/tmp/graph3723098451797791340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3723098451797791340.bin' '-l' '-1' '-v' '-w' '/tmp/graph3723098451797791340.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:15:01] [INFO ] Decomposing Gal with order
[2024-05-22 02:15:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:15:01] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 02:15:01] [INFO ] Flatten gal took : 45 ms
[2024-05-22 02:15:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-22 02:15:01] [INFO ] Time to serialize gal into /tmp/LTL14834969747249981736.gal : 5 ms
[2024-05-22 02:15:01] [INFO ] Time to serialize properties into /tmp/LTL9476530397545010267.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/LTL14834969747249981736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9476530397545010267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.i1.u27.p129==0)||(i2.u7.p69==1))")||((F("((i5.i1.u29.p145==0)||(i2.u6.p57==1))"))U(("(i10.i0.u44.p197==1)")||(X("((i3.i1.u...194
Formula 0 simplified : F(!"((i5.i1.u27.p129==0)||(i2.u7.p69==1))" & (G!"((i5.i1.u29.p145==0)||(i2.u6.p57==1))" R (!"(i10.i0.u44.p197==1)" & X!"((i3.i1.u10....187
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLCardinality-07 finished in 296706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 261 transition count 198
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 250 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 246 transition count 194
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 246 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 246 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 243 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 243 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 72 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 74 place count 242 transition count 183
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 78 place count 240 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 228 place count 165 transition count 108
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 5 with 4 rules applied. Total rules applied 232 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 160 transition count 108
Applied a total of 235 rules in 38 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2024-05-22 02:15:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 02:15:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 02:15:16] [INFO ] Invariant cache hit.
[2024-05-22 02:15:16] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-22 02:15:16] [INFO ] Redundant transitions in 0 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 02:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 108/267 variables, 159/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:18] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 10 ms to minimize.
[2024-05-22 02:15:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:15:18] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/268 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:20] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 224 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5809 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 2/159 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 108/267 variables, 159/223 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 105/328 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-22 02:15:30] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:15:30] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 1/268 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 333 constraints, problems are : Problem set: 0 solved, 105 unsolved in 24731 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints]
After SMT, in 30562ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 30564ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30943 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-08
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-08 finished in 31021 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 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 277 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 274 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 274 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 273 transition count 214
Applied a total of 23 rules in 18 ms. Remains 273 /282 variables (removed 9) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 273 cols
[2024-05-22 02:15:47] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 02:15:47] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 02:15:47] [INFO ] Invariant cache hit.
[2024-05-22 02:15:47] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 02:15:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:15:50] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:15:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 214/487 variables, 273/336 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:15:54] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:15:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:15:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:56] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:15:56] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:15:56] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:15:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:15:56] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:15:57] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:15:57] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:15:58] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:15:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:16:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:01] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:16:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:16:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 11/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/487 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:06] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:16:06] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:16:06] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 02:16:06] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/487 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/487 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:10] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:16:10] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:12] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/487 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:16] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:16:16] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:16:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/487 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 381 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:19] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:16:19] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-22 02:16:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:16:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 02:16:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:21] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-22 02:16:21] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 214/487 variables, 273/388 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 213/601 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 02:16:27] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-22 02:16:27] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-22 02:16:27] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:16:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:16:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:16:33] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 607 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 60/60 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60444 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-09 finished in 60573 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(F(p0))))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 278 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 278 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 275 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 275 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 274 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 274 transition count 216
Applied a total of 20 rules in 11 ms. Remains 274 /282 variables (removed 8) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 274 cols
[2024-05-22 02:16:48] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 02:16:48] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 02:16:48] [INFO ] Invariant cache hit.
[2024-05-22 02:16:48] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-22 02:16:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:16:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:16:52] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:16:52] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:16:52] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:16:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:16:54] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:16:54] [INFO ] Deduced a trap composed of 35 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/354 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:16:56] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:16:56] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:16:56] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:16:56] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:16:56] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:16:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 02:16:58] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-05-22 02:17:01] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:17:02] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:17:02] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:17:03] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 3/382 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:17:04] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 14 (OVERLAPS) 0/490 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 383 constraints, problems are : Problem set: 0 solved, 215 unsolved in 22579 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 02:17:12] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:17:13] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 216/490 variables, 274/392 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 215/607 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:17:19] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-22 02:17:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-22 02:17:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:17:23] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:17:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 10/617 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 617 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 67/67 constraints]
After SMT, in 52636ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 52640ms
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53051 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 93 ms.
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 31 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLCardinality-11 finished in 53487 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 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 276 transition count 209
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 261 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 261 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 251 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 248 transition count 196
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 248 transition count 196
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 248 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 246 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 246 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 246 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 246 transition count 189
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 68 place count 244 transition count 189
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 224 place count 166 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 166 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 164 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 164 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 162 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 161 transition count 113
Applied a total of 233 rules in 42 ms. Remains 161 /282 variables (removed 121) and now considering 113/228 (removed 115) transitions.
// Phase 1: matrix 113 rows 161 cols
[2024-05-22 02:17:41] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:17:41] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 02:17:41] [INFO ] Invariant cache hit.
[2024-05-22 02:17:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-22 02:17:41] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 02:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 2/160 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 113/273 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:17:43] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:45] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:17:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/274 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:47] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (OVERLAPS) 0/274 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 226 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7850 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 2/160 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:17:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 113/273 variables, 160/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 110/336 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 1/274 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 337 constraints, problems are : Problem set: 0 solved, 110 unsolved in 14217 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 8/8 constraints]
After SMT, in 22091ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 22092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/282 places, 113/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22478 ms. Remains : 161/282 places, 113/228 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLCardinality-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLCardinality-15 finished in 22549 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) U (p2||X(p3)))||p0)))'
Found a Lengthening insensitive property : DES-PT-10b-LTLCardinality-07
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 548 edges and 282 vertex of which 277 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 276 transition count 212
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 264 transition count 212
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 25 place count 264 transition count 203
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 43 place count 255 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 252 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 252 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 252 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 250 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 250 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 250 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 56 place count 250 transition count 193
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 248 transition count 193
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 214 place count 171 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 171 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 216 place count 171 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 169 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 168 transition count 113
Applied a total of 219 rules in 44 ms. Remains 168 /282 variables (removed 114) and now considering 113/228 (removed 115) transitions.
// Phase 1: matrix 113 rows 168 cols
[2024-05-22 02:18:04] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:18:04] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 02:18:04] [INFO ] Invariant cache hit.
[2024-05-22 02:18:04] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-22 02:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 3/167 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/280 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:18:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/281 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:08] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:09] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7097 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 3/167 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 113/280 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 109/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:14] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/281 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 341 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17354 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
After SMT, in 24469ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 24470ms
Starting structural reductions in LI_LTL mode, iteration 1 : 168/282 places, 113/228 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 24761 ms. Remains : 168/282 places, 113/228 transitions.
Running random walk in product with property : DES-PT-10b-LTLCardinality-07
Product exploration explored 100000 steps with 3770 reset in 190 ms.
Product exploration explored 100000 steps with 3755 reset in 213 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 11 factoid took 245 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 40000 steps (1471 resets) in 137 ms. (289 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (234 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-05-22 02:18:30] [INFO ] Invariant cache hit.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/78 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/117 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/143 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/148 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 101/249 variables, 148/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/259 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/271 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/271 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/271 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 10/281 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/281 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/281 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/78 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/117 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/143 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/148 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 101/249 variables, 148/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 259/281 variables, and 212 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 156/168 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT (OR p1 p3))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 488 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-22 02:18:31] [INFO ] Invariant cache hit.
[2024-05-22 02:18:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 02:18:31] [INFO ] Invariant cache hit.
[2024-05-22 02:18:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-22 02:18:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 3/167 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/280 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:18:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:33] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/281 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7285 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 3/167 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 113/280 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 109/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:18:41] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/281 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 341 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17971 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
After SMT, in 25273ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 25274ms
Finished structural reductions in LTL mode , in 1 iterations and 25534 ms. Remains : 168/168 places, 113/113 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
RANDOM walk for 886 steps (31 resets) in 24 ms. (35 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p3 p1))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 454 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Product exploration explored 100000 steps with 3779 reset in 188 ms.
Product exploration explored 100000 steps with 3778 reset in 213 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1)]
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-22 02:18:58] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-22 02:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 3/167 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/280 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:00] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:19:00] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/281 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:03] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7183 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 3/167 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 113/280 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 109/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:08] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/281 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 341 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17413 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
After SMT, in 24620ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 24622ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24639 ms. Remains : 168/168 places, 113/113 transitions.
Built C files in :
/tmp/ltsmin8017067180222006899
[2024-05-22 02:19:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8017067180222006899
Running compilation step : cd /tmp/ltsmin8017067180222006899;'/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 292 ms.
Running link step : cd /tmp/ltsmin8017067180222006899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8017067180222006899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1357483962960473517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-22 02:19:38] [INFO ] Invariant cache hit.
[2024-05-22 02:19:38] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 02:19:38] [INFO ] Invariant cache hit.
[2024-05-22 02:19:38] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-22 02:19:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 3/167 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/280 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:19:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:41] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/281 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:43] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 231 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7127 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 3/167 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 113/280 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 109/339 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-22 02:19:48] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/281 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/281 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 341 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17826 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
After SMT, in 24970ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 24971ms
Finished structural reductions in LTL mode , in 1 iterations and 25227 ms. Remains : 168/168 places, 113/113 transitions.
Built C files in :
/tmp/ltsmin2966784260588728170
[2024-05-22 02:20:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2966784260588728170
Running compilation step : cd /tmp/ltsmin2966784260588728170;'/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 279 ms.
Running link step : cd /tmp/ltsmin2966784260588728170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2966784260588728170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7975371456130178734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 02:20:18] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:20:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:20:18] [INFO ] Time to serialize gal into /tmp/LTL14295632138681487095.gal : 2 ms
[2024-05-22 02:20:18] [INFO ] Time to serialize properties into /tmp/LTL12349229349238771939.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/LTL14295632138681487095.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7133317304791502912.hoa' '-atoms' '/tmp/LTL12349229349238771939.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/LTL12349229349238771939.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7133317304791502912.hoa
Detected timeout of ITS tools.
[2024-05-22 02:20:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:20:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:20:34] [INFO ] Time to serialize gal into /tmp/LTL2110394331723810376.gal : 3 ms
[2024-05-22 02:20:34] [INFO ] Time to serialize properties into /tmp/LTL5060170835939571743.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/LTL2110394331723810376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5060170835939571743.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(("((p129==0)||(p69==1))")||((F("((p145==0)||(p57==1))"))U(("(p197==1)")||(X("((p79==0)||(p78==1))")))))))
Formula 0 simplified : F(!"((p129==0)||(p69==1))" & (G!"((p145==0)||(p57==1))" R (!"(p197==1)" & X!"((p79==0)||(p78==1))")))
Detected timeout of ITS tools.
[2024-05-22 02:20:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:20:49] [INFO ] Applying decomposition
[2024-05-22 02:20:49] [INFO ] Flatten gal took : 7 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/graph5874447259814216363.txt' '-o' '/tmp/graph5874447259814216363.bin' '-w' '/tmp/graph5874447259814216363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5874447259814216363.bin' '-l' '-1' '-v' '-w' '/tmp/graph5874447259814216363.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:20:49] [INFO ] Decomposing Gal with order
[2024-05-22 02:20:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:20:49] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-22 02:20:49] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:20:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2024-05-22 02:20:49] [INFO ] Time to serialize gal into /tmp/LTL16243736102133866888.gal : 2 ms
[2024-05-22 02:20:49] [INFO ] Time to serialize properties into /tmp/LTL10151990469650496780.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/LTL16243736102133866888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10151990469650496780.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("((i0.u7.p129==0)||(i0.u1.p69==1))")||((F("((i0.u8.p145==0)||(i1.u0.p57==1))"))U(("(i5.i1.u16.p197==1)")||(X("((i2.u3.p79==0)||(...177
Formula 0 simplified : F(!"((i0.u7.p129==0)||(i0.u1.p69==1))" & (G!"((i0.u8.p145==0)||(i1.u0.p57==1))" R (!"(i5.i1.u16.p197==1)" & X!"((i2.u3.p79==0)||(i2....170
Reverse transition relation is NOT exact ! Due to transitions t220_t79, t7_t48_t39, t188_t34, t187_t25, u11.t178, u46.t11.t17, u46.t149.t15.t16, i0.t218_t9...545
Computing Next relation with stutter on 8.68949e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-10b-LTLCardinality-07 finished in 180128 ms.
[2024-05-22 02:21:04] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9808582078401422357
[2024-05-22 02:21:04] [INFO ] Applying decomposition
[2024-05-22 02:21:04] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2024-05-22 02:21:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:21:04] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2024-05-22 02:21:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 02:21:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:21:04] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2024-05-22 02:21:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16505451518758230630.txt' '-o' '/tmp/graph16505451518758230630.bin' '-w' '/tmp/graph16505451518758230630.weights'
[2024-05-22 02:21:04] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9808582078401422357
Running compilation step : cd /tmp/ltsmin9808582078401422357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16505451518758230630.bin' '-l' '-1' '-v' '-w' '/tmp/graph16505451518758230630.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:21:04] [INFO ] Decomposing Gal with order
[2024-05-22 02:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:21:04] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 02:21:04] [INFO ] Flatten gal took : 16 ms
[2024-05-22 02:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 02:21:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality15835428629948414528.gal : 3 ms
[2024-05-22 02:21:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality11158158621461226049.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/LTLCardinality15835428629948414528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11158158621461226049.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.u27.p129==0)||(i2.u8.p69==1))")||((F("((i5.u29.p145==0)||(i2.u7.p57==1))"))U(("(i10.i0.i0.u45.p197==1)")||(X("((i3.u12.p79...185
Formula 0 simplified : F(!"((i5.u27.p129==0)||(i2.u8.p69==1))" & (G!"((i5.u29.p145==0)||(i2.u7.p57==1))" R (!"(i10.i0.i0.u45.p197==1)" & X!"((i3.u12.p79==0...178
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin9808582078401422357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9808582078401422357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t168, t187, t188, t220, u35.t79, u37.t76, i2.t128, i2.u7.t133, i2.u7.t135, i2.u8.t13...874
Computing Next relation with stutter on 2.09172e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.308: LTL layer: formula: [](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.308: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.308: "[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.308: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.314: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.317: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.323: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.355: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.393: DFS-FIFO for weak LTL, using special progress label 233
pins2lts-mc-linux64( 0/ 8), 0.394: There are 234 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.394: State length is 283, there are 235 groups
pins2lts-mc-linux64( 0/ 8), 0.394: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.394: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.394: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.394: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.857: ~1 levels ~960 states ~4136 transitions
pins2lts-mc-linux64( 2/ 8), 0.866: ~1 levels ~1920 states ~8808 transitions
pins2lts-mc-linux64( 2/ 8), 0.916: ~1 levels ~3840 states ~18584 transitions
pins2lts-mc-linux64( 2/ 8), 1.252: ~1 levels ~7680 states ~38816 transitions
pins2lts-mc-linux64( 5/ 8), 1.502: ~1 levels ~15360 states ~87920 transitions
pins2lts-mc-linux64( 2/ 8), 1.763: ~1 levels ~30720 states ~177808 transitions
pins2lts-mc-linux64( 6/ 8), 2.303: ~1 levels ~61440 states ~429184 transitions
pins2lts-mc-linux64( 6/ 8), 3.163: ~1 levels ~122880 states ~883896 transitions
pins2lts-mc-linux64( 6/ 8), 4.601: ~1 levels ~245760 states ~1847664 transitions
pins2lts-mc-linux64( 3/ 8), 8.057: ~1 levels ~491520 states ~3830024 transitions
pins2lts-mc-linux64( 3/ 8), 11.918: ~1 levels ~983040 states ~7593640 transitions
pins2lts-mc-linux64( 3/ 8), 19.214: ~1 levels ~1966080 states ~15179304 transitions
pins2lts-mc-linux64( 3/ 8), 33.868: ~1 levels ~3932160 states ~30969744 transitions
pins2lts-mc-linux64( 3/ 8), 73.648: ~1 levels ~7864320 states ~78765200 transitions
pins2lts-mc-linux64( 0/ 8), 153.078: ~1 levels ~15728640 states ~166396600 transitions
pins2lts-mc-linux64( 2/ 8), 308.970: ~1 levels ~31457280 states ~353004328 transitions
pins2lts-mc-linux64( 2/ 8), 630.414: ~1 levels ~62914560 states ~733809160 transitions
pins2lts-mc-linux64( 3/ 8), 836.985: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 837.001:
pins2lts-mc-linux64( 0/ 8), 837.001: mean standard work distribution: 4.4% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 837.002:
pins2lts-mc-linux64( 0/ 8), 837.002: Explored 77237010 states 963463409 transitions, fanout: 12.474
pins2lts-mc-linux64( 0/ 8), 837.002: Total exploration time 836.600 sec (836.560 sec minimum, 836.579 sec on average)
pins2lts-mc-linux64( 0/ 8), 837.002: States per second: 92323, Transitions per second: 1151642
pins2lts-mc-linux64( 0/ 8), 837.002:
pins2lts-mc-linux64( 0/ 8), 837.002: Progress states detected: 134217262
pins2lts-mc-linux64( 0/ 8), 837.002: Redundant explorations: -42.4538
pins2lts-mc-linux64( 0/ 8), 837.002:
pins2lts-mc-linux64( 0/ 8), 837.002: Queue width: 8B, total height: 99531928, memory: 759.37MB
pins2lts-mc-linux64( 0/ 8), 837.002: Tree memory: 1107.3MB, 8.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 837.002: Tree fill ratio (roots/leafs): 99.0%/32.0%
pins2lts-mc-linux64( 0/ 8), 837.002: Stored 285 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 837.002: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 837.002: Est. total memory use: 1866.6MB (~1783.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9808582078401422357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9808582078401422357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp3==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 02:45:33] [INFO ] Applying decomposition
[2024-05-22 02:45:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:45:33] [INFO ] Decomposing Gal with order
[2024-05-22 02:45:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:45:33] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 02:45:33] [INFO ] Flatten gal took : 26 ms
[2024-05-22 02:45:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2024-05-22 02:45:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality2707202319451688272.gal : 3 ms
[2024-05-22 02:45:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality17986833216764963583.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/LTLCardinality2707202319451688272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17986833216764963583.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.i0.i1.i0.i1.i0.i1.u133.p129==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p69==1))")||((F("((i1.i0.i1.i0.i1.i0.i1.u31.p145==0)||(i1.i0.i0...329
Formula 0 simplified : F(!"((i1.i0.i1.i0.i1.i0.i1.u133.p129==0)||(i1.i0.i0.i0.i0.i0.i0.u16.p69==1))" & (G!"((i1.i0.i1.i0.i1.i0.i1.u31.p145==0)||(i1.i0.i0.i...322

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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 DES-PT-10b, 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 r092-tall-171624189800675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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