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.r180-tall-171640603400427.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 GPPP-PT-C0100N0000010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000010000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000010000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716503308099

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 22:28:29] [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-23 22:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:28:29] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-23 22:28:29] [INFO ] Transformed 33 places.
[2024-05-23 22:28:29] [INFO ] Transformed 22 transitions.
[2024-05-23 22:28:29] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-23 22:28:29] [INFO ] Computed 12 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 20457ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 20469ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-23 22:28:50] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 22:28:50] [INFO ] Implicit Places using invariants in 74 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 21/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20600 ms. Remains : 32/33 places, 21/22 transitions.
Support contains 24 out of 32 places after structural reductions.
[2024-05-23 22:28:50] [INFO ] Flatten gal took : 16 ms
[2024-05-23 22:28:50] [INFO ] Flatten gal took : 5 ms
[2024-05-23 22:28:50] [INFO ] Input system was already deterministic with 21 transitions.
Support contains 23 out of 32 places (down from 24) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40742 steps (12 resets) in 130 ms. (311 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
// Phase 1: matrix 21 rows 32 cols
[2024-05-23 22:28:50] [INFO ] Computed 12 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/13 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/28 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 21/51 variables, 30/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 9 (OVERLAPS) 2/53 variables, 2/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 1/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 44 constraints, problems are : Problem set: 3 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/26 variables, 5/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-23 22:28:50] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 6 ms to minimize.
[2024-05-23 22:28:50] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28/53 variables, and 12 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/32 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1206ms problems are : Problem set: 4 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 14 place count 24 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 22 transition count 12
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 22 transition count 10
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 19 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 18 transition count 9
Applied a total of 23 rules in 28 ms. Remains 18 /32 variables (removed 14) and now considering 9/21 (removed 12) transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 18 cols
[2024-05-23 22:28:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 22:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/27 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 8 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/27 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 36 constraints, problems are : Problem set: 0 solved, 8 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 18/32 places, 9/21 transitions.
RANDOM walk for 41073 steps (48 resets) in 413 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3738416 steps, run timeout after 3001 ms. (steps per millisecond=1245 ) properties seen :0 out of 1
Probabilistic random walk after 3738416 steps, saw 729007 distinct states, run finished after 3004 ms. (steps per millisecond=1244 ) properties seen :0
[2024-05-23 22:28:55] [INFO ] Invariant cache hit.
[2024-05-23 22:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/16 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/27 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/27 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 28 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/16 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Int declared 18/27 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/18 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 19 stable transitions
Graph (complete) has 75 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 23 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 22 transition count 13
Applied a total of 14 rules in 20 ms. Remains 22 /32 variables (removed 10) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 22 cols
[2024-05-23 22:28:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 22:28:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/34 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/34 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/35 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/35 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/35 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 46 constraints, problems are : Problem set: 0 solved, 12 unsolved in 10109 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 10263ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 10263ms
[2024-05-23 22:29:06] [INFO ] Invariant cache hit.
[2024-05-23 22:29:06] [INFO ] Implicit Places using invariants in 44 ms returned [0, 2, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 13/21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 15 transition count 10
Applied a total of 7 rules in 9 ms. Remains 15 /19 variables (removed 4) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-05-23 22:29:06] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 22:29:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 22:29:06] [INFO ] Invariant cache hit.
[2024-05-23 22:29:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 22:29:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 10410 ms. Remains : 14/32 places, 10/21 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-00 finished in 10655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 18
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 24 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 23 transition count 14
Applied a total of 13 rules in 20 ms. Remains 23 /32 variables (removed 9) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-23 22:29:06] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/37 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 14/37 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 46 constraints, problems are : Problem set: 0 solved, 13 unsolved in 9157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 9284ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 9284ms
[2024-05-23 22:29:16] [INFO ] Invariant cache hit.
[2024-05-23 22:29:16] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 13]
[2024-05-23 22:29:16] [INFO ] Actually due to overlaps returned [13, 0, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 19 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Applied a total of 4 rules in 8 ms. Remains 18 /20 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-23 22:29:16] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 22:29:16] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9388 ms. Remains : 17/32 places, 12/21 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-01
Product exploration explored 100000 steps with 286 reset in 203 ms.
Stack based approach found an accepted trace after 52 steps with 1 reset with depth 17 and stack size 17 in 1 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-01 finished in 9689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 23 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 21 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 20 transition count 12
Applied a total of 17 rules in 25 ms. Remains 20 /32 variables (removed 12) and now considering 12/21 (removed 9) transitions.
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-23 22:29:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 22:29:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 11/31 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 11/31 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 42 constraints, problems are : Problem set: 0 solved, 11 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 417ms
[2024-05-23 22:29:17] [INFO ] Invariant cache hit.
[2024-05-23 22:29:17] [INFO ] Implicit Places using invariants in 34 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 12/21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 15 transition count 10
Applied a total of 5 rules in 2 ms. Remains 15 /18 variables (removed 3) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-05-23 22:29:17] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 22:29:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 22:29:17] [INFO ] Invariant cache hit.
[2024-05-23 22:29:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 22:29:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 547 ms. Remains : 14/32 places, 10/21 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-02 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&(p1||F(p2)))))||G(p3)))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-23 22:29:17] [INFO ] Computed 11 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19531 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 19739ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 19741ms
[2024-05-23 22:29:37] [INFO ] Invariant cache hit.
[2024-05-23 22:29:37] [INFO ] Implicit Places using invariants in 44 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19787 ms. Remains : 29/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-04
Stuttering criterion allowed to conclude after 2889 steps with 0 reset in 17 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-04 finished in 20083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 28 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 24 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 22 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 21 transition count 13
Applied a total of 15 rules in 10 ms. Remains 21 /32 variables (removed 11) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 21 cols
[2024-05-23 22:29:37] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 22:29:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/33 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 32 constraints, problems are : Problem set: 0 solved, 12 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/33 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/34 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/34 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 44 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 8739ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 8740ms
[2024-05-23 22:29:46] [INFO ] Invariant cache hit.
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants in 42 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/32 places, 13/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 12
Applied a total of 2 rules in 1 ms. Remains 18 /19 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 18 cols
[2024-05-23 22:29:46] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 22:29:46] [INFO ] Invariant cache hit.
[2024-05-23 22:29:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8859 ms. Remains : 17/32 places, 12/21 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-05 finished in 8999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 27 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 23 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 21 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 20 transition count 12
Applied a total of 17 rules in 13 ms. Remains 20 /32 variables (removed 12) and now considering 12/21 (removed 9) transitions.
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-23 22:29:46] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 22:29:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 11/31 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 11/31 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 42 constraints, problems are : Problem set: 0 solved, 11 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 373ms
[2024-05-23 22:29:46] [INFO ] Invariant cache hit.
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants in 33 ms returned [0, 2, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 12/21 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 11
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-23 22:29:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 22:29:46] [INFO ] Invariant cache hit.
[2024-05-23 22:29:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 22:29:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 11/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 479 ms. Remains : 15/32 places, 11/21 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-06 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-23 22:29:46] [INFO ] Computed 11 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19790 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20015ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20015ms
[2024-05-23 22:30:06] [INFO ] Invariant cache hit.
[2024-05-23 22:30:06] [INFO ] Implicit Places using invariants in 36 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20068 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-07
Product exploration explored 100000 steps with 34 reset in 111 ms.
Product exploration explored 100000 steps with 34 reset in 143 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 30 cols
[2024-05-23 22:30:07] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 22:30:08] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 22:30:08] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-23 22:30:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 22:30:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:30:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 22:30:08] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-23 22:30:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:30:08] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 22:30:08] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-23 22:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 30/51 variables, and 10 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/30 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20215ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20216ms
[2024-05-23 22:30:28] [INFO ] Invariant cache hit.
[2024-05-23 22:30:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 22:30:28] [INFO ] Invariant cache hit.
[2024-05-23 22:30:28] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [1, 2, 4]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 89 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/30 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20307 ms. Remains : 27/30 places, 21/21 transitions.
Computed a total of 25 stabilizing places and 19 stable transitions
Graph (complete) has 58 edges and 27 vertex of which 19 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 19 stable transitions
Detected a total of 25/27 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 27 cols
[2024-05-23 22:30:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 22:30:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:30:29] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-23 22:30:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 22:30:29] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-23 22:30:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 22:30:29] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 22:30:29] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 73 ms.
Product exploration explored 100000 steps with 34 reset in 94 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 21/21 transitions.
Graph (trivial) has 4 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 56 edges and 26 vertex of which 23 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 23 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 23 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 23 transition count 17
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 5 rules in 6 ms. Remains 23 /27 variables (removed 4) and now considering 17/21 (removed 4) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 23 cols
[2024-05-23 22:30:29] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 22:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/30 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/31 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 31 constraints, problems are : Problem set: 3 solved, 13 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 4/23 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 16/39 variables, 23/30 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 13/43 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/44 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 3 solved, 13 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 3 solved, 13 unsolved
Search for dead transitions found 3 dead transitions in 947ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
[2024-05-23 22:30:30] [INFO ] Redundant transitions in 0 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 23/27 places, 14/21 transitions.
Graph (complete) has 48 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 20 /23 variables (removed 3) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/27 places, 14/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 968 ms. Remains : 20/27 places, 14/21 transitions.
Built C files in :
/tmp/ltsmin8346220590452132298
[2024-05-23 22:30:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8346220590452132298
Running compilation step : cd /tmp/ltsmin8346220590452132298;'/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 218 ms.
Running link step : cd /tmp/ltsmin8346220590452132298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8346220590452132298;'/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/stateBased18295185551033879612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 27 cols
[2024-05-23 22:30:45] [INFO ] Computed 7 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 34 constraints, problems are : Problem set: 0 solved, 20 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 27/48 variables, and 7 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/27 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20209ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20210ms
[2024-05-23 22:31:06] [INFO ] Invariant cache hit.
[2024-05-23 22:31:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 22:31:06] [INFO ] Invariant cache hit.
[2024-05-23 22:31:06] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-23 22:31:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 34 constraints, problems are : Problem set: 0 solved, 20 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/48 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 54 constraints, problems are : Problem set: 0 solved, 20 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 528ms
Finished structural reductions in LTL mode , in 1 iterations and 20812 ms. Remains : 27/27 places, 21/21 transitions.
Built C files in :
/tmp/ltsmin7793264968061557310
[2024-05-23 22:31:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7793264968061557310
Running compilation step : cd /tmp/ltsmin7793264968061557310;'/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 101 ms.
Running link step : cd /tmp/ltsmin7793264968061557310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7793264968061557310;'/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/stateBased12535347257802284917.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 22:31:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:31:21] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:31:21] [INFO ] Time to serialize gal into /tmp/LTL16149484286868112070.gal : 1 ms
[2024-05-23 22:31:21] [INFO ] Time to serialize properties into /tmp/LTL18157656560033335423.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/LTL16149484286868112070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12741786647078124202.hoa' '-atoms' '/tmp/LTL18157656560033335423.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18157656560033335423.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12741786647078124202.hoa
Detected timeout of ITS tools.
[2024-05-23 22:31:36] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:31:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:31:36] [INFO ] Time to serialize gal into /tmp/LTL6891493176487570157.gal : 2 ms
[2024-05-23 22:31:36] [INFO ] Time to serialize properties into /tmp/LTL17376015312108120018.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/LTL6891493176487570157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17376015312108120018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
Detected timeout of ITS tools.
[2024-05-23 22:31:51] [INFO ] Flatten gal took : 9 ms
[2024-05-23 22:31:51] [INFO ] Applying decomposition
[2024-05-23 22:31:51] [INFO ] Flatten gal took : 3 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/graph11623957390094972139.txt' '-o' '/tmp/graph11623957390094972139.bin' '-w' '/tmp/graph11623957390094972139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11623957390094972139.bin' '-l' '-1' '-v' '-w' '/tmp/graph11623957390094972139.weights' '-q' '0' '-e' '0.001'
[2024-05-23 22:31:51] [INFO ] Decomposing Gal with order
[2024-05-23 22:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:31:51] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-23 22:31:52] [INFO ] Flatten gal took : 54 ms
[2024-05-23 22:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-23 22:31:52] [INFO ] Time to serialize gal into /tmp/LTL2484521757238093478.gal : 6 ms
[2024-05-23 22:31:52] [INFO ] Time to serialize properties into /tmp/LTL2128106354791035629.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/LTL2484521757238093478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2128106354791035629.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i0.u3.ADP>=3)")))))
Formula 0 simplified : XXF!"(i0.u3.ADP>=3)"
Detected timeout of ITS tools.
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-07 finished in 140125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1) U X(X(G(p2))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-23 22:32:07] [INFO ] Computed 11 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 20230ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20231ms
[2024-05-23 22:32:27] [INFO ] Invariant cache hit.
[2024-05-23 22:32:27] [INFO ] Implicit Places using invariants in 42 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20291 ms. Remains : 29/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-08 finished in 20578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||F(!p0))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 16
Applied a total of 7 rules in 6 ms. Remains 27 /32 variables (removed 5) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 27 cols
[2024-05-23 22:32:27] [INFO ] Computed 12 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 16/43 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/27 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 16/43 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 54 constraints, problems are : Problem set: 0 solved, 15 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 713ms
[2024-05-23 22:32:28] [INFO ] Invariant cache hit.
[2024-05-23 22:32:28] [INFO ] Implicit Places using invariants in 46 ms returned [0, 1, 2, 17]
[2024-05-23 22:32:28] [INFO ] Actually due to overlaps returned [17, 0, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 16/21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 23 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 22 transition count 14
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-23 22:32:28] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 22:32:28] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/32 places, 14/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 799 ms. Remains : 21/32 places, 14/21 transitions.
Stuttering acceptance computed with spot in 123 ms :[false, (AND p0 (NOT p1)), p0]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-09
Stuttering criterion allowed to conclude after 12682 steps with 17 reset in 22 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-09 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (complete) has 75 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 2 ms. Remains 23 /32 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-23 22:32:28] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/38 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/38 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 46 constraints, problems are : Problem set: 0 solved, 14 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 419ms
[2024-05-23 22:32:29] [INFO ] Invariant cache hit.
[2024-05-23 22:32:29] [INFO ] Implicit Places using invariants in 34 ms returned [2, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 15/21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 13
Applied a total of 4 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-23 22:32:29] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 22:32:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 22:32:29] [INFO ] Invariant cache hit.
[2024-05-23 22:32:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32 places, 13/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 528 ms. Remains : 19/32 places, 13/21 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-12
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-12 TRUE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-12 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(p1))||F(!p0))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Applied a total of 1 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 31 cols
[2024-05-23 22:32:29] [INFO ] Computed 11 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/52 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 62 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 19488ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 19490ms
[2024-05-23 22:32:48] [INFO ] Invariant cache hit.
[2024-05-23 22:32:48] [INFO ] Implicit Places using invariants in 42 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/32 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19541 ms. Remains : 30/32 places, 21/21 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 33 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPPP-PT-C0100N0000010000-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-15 finished in 19924 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))))'
Found a Lengthening insensitive property : GPPP-PT-C0100N0000010000-LTLCardinality-07
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 21/21 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 73 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 29 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 28 transition count 18
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 11 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 23 transition count 15
Applied a total of 14 rules in 4 ms. Remains 23 /32 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 23 cols
[2024-05-23 22:32:49] [INFO ] Computed 9 invariants in 0 ms
[2024-05-23 22:32:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/37 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 33 constraints, problems are : Problem set: 0 solved, 14 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 23/38 variables, and 9 constraints, problems are : Problem set: 0 solved, 14 unsolved in 20005 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/23 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 20188ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 20188ms
[2024-05-23 22:33:09] [INFO ] Invariant cache hit.
[2024-05-23 22:33:09] [INFO ] Implicit Places using invariants in 31 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/32 places, 15/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 14
Applied a total of 2 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 21 cols
[2024-05-23 22:33:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-23 22:33:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 22:33:09] [INFO ] Invariant cache hit.
[2024-05-23 22:33:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:33:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 20/32 places, 14/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 20296 ms. Remains : 20/32 places, 14/21 transitions.
Running random walk in product with property : GPPP-PT-C0100N0000010000-LTLCardinality-07
Product exploration explored 100000 steps with 79 reset in 79 ms.
Product exploration explored 100000 steps with 79 reset in 84 ms.
Computed a total of 20 stabilizing places and 13 stable transitions
Graph (complete) has 48 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 20 stabilizing places and 13 stable transitions
Detected a total of 20/20 stabilizing places and 13/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 14 rows 20 cols
[2024-05-23 22:33:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 22:33:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:33:10] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-23 22:33:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 22:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:33:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:33:10] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-23 22:33:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-23 22:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:33:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 22:33:10] [INFO ] Computed and/alt/rep : 13/34/13 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 22:33:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 13 sub problems to find dead transitions.
[2024-05-23 22:33:10] [INFO ] Invariant cache hit.
[2024-05-23 22:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20/34 variables, and 7 constraints, problems are : Problem set: 0 solved, 13 unsolved in 20008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/20 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 20168ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 20168ms
[2024-05-23 22:33:30] [INFO ] Invariant cache hit.
[2024-05-23 22:33:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 22:33:30] [INFO ] Invariant cache hit.
[2024-05-23 22:33:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:33:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-05-23 22:33:30] [INFO ] Invariant cache hit.
[2024-05-23 22:33:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20/34 variables, and 7 constraints, problems are : Problem set: 0 solved, 13 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/20 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 30162ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 30164ms
Finished structural reductions in LTL mode , in 1 iterations and 50407 ms. Remains : 20/20 places, 14/14 transitions.
Computed a total of 20 stabilizing places and 13 stable transitions
Graph (complete) has 48 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 13 stable transitions
Detected a total of 20/20 stabilizing places and 13/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2024-05-23 22:34:01] [INFO ] Invariant cache hit.
[2024-05-23 22:34:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:34:01] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-23 22:34:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 22:34:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 22:34:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:34:01] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-23 22:34:01] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 22:34:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:34:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 22:34:01] [INFO ] Computed and/alt/rep : 13/34/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 22:34:01] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 79 reset in 81 ms.
Product exploration explored 100000 steps with 79 reset in 82 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 13 sub problems to find dead transitions.
[2024-05-23 22:34:02] [INFO ] Invariant cache hit.
[2024-05-23 22:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20/34 variables, and 7 constraints, problems are : Problem set: 0 solved, 13 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/20 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 20153ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 20154ms
[2024-05-23 22:34:22] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-23 22:34:22] [INFO ] Invariant cache hit.
[2024-05-23 22:34:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 30159ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 30160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50325 ms. Remains : 20/20 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin11333764712571242171
[2024-05-23 22:34:52] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11333764712571242171
Running compilation step : cd /tmp/ltsmin11333764712571242171;'/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 87 ms.
Running link step : cd /tmp/ltsmin11333764712571242171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11333764712571242171;'/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/stateBased7588625164711739022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 13 sub problems to find dead transitions.
[2024-05-23 22:35:07] [INFO ] Invariant cache hit.
[2024-05-23 22:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 41 constraints, problems are : Problem set: 0 solved, 13 unsolved in 12386 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 12551ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 12552ms
[2024-05-23 22:35:20] [INFO ] Invariant cache hit.
[2024-05-23 22:35:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-23 22:35:20] [INFO ] Invariant cache hit.
[2024-05-23 22:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:35:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-05-23 22:35:20] [INFO ] Invariant cache hit.
[2024-05-23 22:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/33 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20/34 variables, and 7 constraints, problems are : Problem set: 0 solved, 13 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/20 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 30161ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 30161ms
Finished structural reductions in LTL mode , in 1 iterations and 42790 ms. Remains : 20/20 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin16949725541948228615
[2024-05-23 22:35:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16949725541948228615
Running compilation step : cd /tmp/ltsmin16949725541948228615;'/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 97 ms.
Running link step : cd /tmp/ltsmin16949725541948228615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16949725541948228615;'/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/stateBased7005014789318325347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 22:36:05] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:36:05] [INFO ] Flatten gal took : 1 ms
[2024-05-23 22:36:05] [INFO ] Time to serialize gal into /tmp/LTL6753614420957333482.gal : 1 ms
[2024-05-23 22:36:05] [INFO ] Time to serialize properties into /tmp/LTL694401492317491815.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/LTL6753614420957333482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7457770813561309632.hoa' '-atoms' '/tmp/LTL694401492317491815.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...316
Loading property file /tmp/LTL694401492317491815.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7457770813561309632.hoa
Detected timeout of ITS tools.
[2024-05-23 22:36:20] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:36:20] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:36:20] [INFO ] Time to serialize gal into /tmp/LTL4557817655637792106.gal : 1 ms
[2024-05-23 22:36:20] [INFO ] Time to serialize properties into /tmp/LTL16529884477437882251.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/LTL4557817655637792106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16529884477437882251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
Detected timeout of ITS tools.
[2024-05-23 22:36:35] [INFO ] Flatten gal took : 1 ms
[2024-05-23 22:36:35] [INFO ] Applying decomposition
[2024-05-23 22:36:35] [INFO ] Flatten gal took : 2 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/graph12724795918082431691.txt' '-o' '/tmp/graph12724795918082431691.bin' '-w' '/tmp/graph12724795918082431691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12724795918082431691.bin' '-l' '-1' '-v' '-w' '/tmp/graph12724795918082431691.weights' '-q' '0' '-e' '0.001'
[2024-05-23 22:36:35] [INFO ] Decomposing Gal with order
[2024-05-23 22:36:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:36:35] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-23 22:36:35] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:36:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 22:36:35] [INFO ] Time to serialize gal into /tmp/LTL7191239182292318333.gal : 1 ms
[2024-05-23 22:36:35] [INFO ] Time to serialize properties into /tmp/LTL10244301069940883178.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/LTL7191239182292318333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10244301069940883178.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 : !((X(X(G("(i1.u3.ADP>=3)")))))
Formula 0 simplified : XXF!"(i1.u3.ADP>=3)"
Detected timeout of ITS tools.
Treatment of property GPPP-PT-C0100N0000010000-LTLCardinality-07 finished in 241707 ms.
[2024-05-23 22:36:50] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3298197577599277540
[2024-05-23 22:36:50] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-23 22:36:50] [INFO ] Applying decomposition
[2024-05-23 22:36:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:36:50] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:36:50] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-23 22:36:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:36:50] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-23 22:36:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:36:50] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3298197577599277540
Running compilation step : cd /tmp/ltsmin3298197577599277540;'/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'
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/graph11708814549534397719.txt' '-o' '/tmp/graph11708814549534397719.bin' '-w' '/tmp/graph11708814549534397719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11708814549534397719.bin' '-l' '-1' '-v' '-w' '/tmp/graph11708814549534397719.weights' '-q' '0' '-e' '0.001'
[2024-05-23 22:36:50] [INFO ] Decomposing Gal with order
[2024-05-23 22:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:36:50] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-23 22:36:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 22:36:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality8775560628091510560.gal : 0 ms
[2024-05-23 22:36:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality2511296188440055617.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/LTLCardinality8775560628091510560.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2511296188440055617.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(i3.u4.ADP>=3)")))))
Formula 0 simplified : XXF!"(i3.u4.ADP>=3)"
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin3298197577599277540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3298197577599277540;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: X(X([]((LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "X(X([]((LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.046: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.046: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.046: State length is 33, there are 26 groups
pins2lts-mc-linux64( 0/ 8), 0.046: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.046: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.046: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.046: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.573: ~1 levels ~960 states ~3840 transitions
pins2lts-mc-linux64( 0/ 8), 0.646: ~1 levels ~1920 states ~9992 transitions
pins2lts-mc-linux64( 7/ 8), 0.685: ~1 levels ~3840 states ~20512 transitions
pins2lts-mc-linux64( 7/ 8), 0.744: ~1 levels ~7680 states ~42944 transitions
pins2lts-mc-linux64( 7/ 8), 1.015: ~1 levels ~15360 states ~89184 transitions
pins2lts-mc-linux64( 5/ 8), 1.538: ~1 levels ~30720 states ~178696 transitions
pins2lts-mc-linux64( 5/ 8), 2.359: ~1 levels ~61440 states ~373440 transitions
pins2lts-mc-linux64( 5/ 8), 4.600: ~1 levels ~122880 states ~780608 transitions
pins2lts-mc-linux64( 5/ 8), 6.736: ~1 levels ~245760 states ~1647384 transitions
pins2lts-mc-linux64( 4/ 8), 9.037: ~1 levels ~491520 states ~3677368 transitions
pins2lts-mc-linux64( 4/ 8), 11.812: ~1 levels ~983040 states ~7510776 transitions
pins2lts-mc-linux64( 1/ 8), 13.639: ~1 levels ~1966080 states ~14263328 transitions
pins2lts-mc-linux64( 1/ 8), 17.357: ~1 levels ~3932160 states ~29213272 transitions
pins2lts-mc-linux64( 1/ 8), 24.757: ~1 levels ~7864320 states ~59952832 transitions
pins2lts-mc-linux64( 1/ 8), 40.420: ~1 levels ~15728640 states ~123835416 transitions
pins2lts-mc-linux64( 7/ 8), 76.238: ~1 levels ~31457280 states ~260875712 transitions
pins2lts-mc-linux64( 3/ 8), 144.976: ~1 levels ~62914560 states ~529960424 transitions
pins2lts-mc-linux64( 0/ 8), 291.514: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 291.574:
pins2lts-mc-linux64( 0/ 8), 291.574: mean standard work distribution: 2.2% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 291.574:
pins2lts-mc-linux64( 0/ 8), 291.574: Explored 114851741 states 984954188 transitions, fanout: 8.576
pins2lts-mc-linux64( 0/ 8), 291.574: Total exploration time 291.520 sec (291.440 sec minimum, 291.473 sec on average)
pins2lts-mc-linux64( 0/ 8), 291.574: States per second: 393976, Transitions per second: 3378685
pins2lts-mc-linux64( 0/ 8), 291.574:
pins2lts-mc-linux64( 0/ 8), 291.574: Progress states detected: 134217239
pins2lts-mc-linux64( 0/ 8), 291.574: Redundant explorations: -14.4286
pins2lts-mc-linux64( 0/ 8), 291.574:
pins2lts-mc-linux64( 0/ 8), 291.574: Queue width: 8B, total height: 41123968, memory: 313.75MB
pins2lts-mc-linux64( 0/ 8), 291.574: Tree memory: 1072.7MB, 8.4 B/state, compr.: 6.3%
pins2lts-mc-linux64( 0/ 8), 291.574: Tree fill ratio (roots/leafs): 99.0%/19.0%
pins2lts-mc-linux64( 0/ 8), 291.574: Stored 21 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 291.574: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 291.574: Est. total memory use: 1386.4MB (~1337.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3298197577599277540;'/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' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3298197577599277540;'/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' 'X(X([]((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-23 22:59:38] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:59:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality7653731154571693545.gal : 1 ms
[2024-05-23 22:59:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality12683140488252029167.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/LTLCardinality7653731154571693545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12683140488252029167.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(G("(ADP>=3)")))))
Formula 0 simplified : XXF!"(ADP>=3)"
ITS-tools command line returned an error code 137
[2024-05-23 23:11:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:11:50] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-23 23:11:50] [INFO ] Transformed 32 places.
[2024-05-23 23:11:50] [INFO ] Transformed 21 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 23:11:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality6724274432891840131.gal : 1 ms
[2024-05-23 23:11:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality4615833910627034426.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/LTLCardinality6724274432891840131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4615833910627034426.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

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="GPPP-PT-C0100N0000010000"
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 GPPP-PT-C0100N0000010000, 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 r180-tall-171640603400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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