Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029200836.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DatabaseWithMutex-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029200836
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 24K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 330K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 292K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 61K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748669328003

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 05:28:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 05:28:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:28:49] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2025-05-31 05:28:49] [INFO ] Transformed 140 places.
[2025-05-31 05:28:49] [INFO ] Transformed 128 transitions.
[2025-05-31 05:28:49] [INFO ] Found NUPN structural information;
[2025-05-31 05:28:49] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
[2025-05-31 05:28:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 05:28:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 05:28:49] [INFO ] Reduced 12 identical enabling conditions.
[2025-05-31 05:28:49] [INFO ] Reduced 12 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 124 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 05:28:49] [INFO ] Computed 28 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:28:49] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-31 05:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:28:49] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 05:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6895 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 12112 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19059ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19075ms
Finished structural reductions in LTL mode , in 1 iterations and 19477 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 124 out of 140 places after structural reductions.
[2025-05-31 05:29:09] [INFO ] Flatten gal took : 28 ms
[2025-05-31 05:29:09] [INFO ] Flatten gal took : 14 ms
[2025-05-31 05:29:09] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 30 to 21
RANDOM walk for 1540 steps (0 resets) in 92 ms. (16 steps per ms) remains 0/21 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U ((p2 U p3)&&X(!p4))))'
Support contains 56 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:29:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:09] [INFO ] Implicit Places using invariants in 161 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 177 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 513 ms :[(OR (NOT p3) p4), true, p4, (NOT p1), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p1) p2 p4) (AND (NOT p1) p3 p4)), p4]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 482 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) p0 (NOT p1) (NOT p4)), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (OR (AND p3 (NOT p0) p4) (AND p2 (NOT p0) p4)))), (X (NOT (OR (AND p3 p0 (NOT p1) p4) (AND p2 p0 (NOT p1) p4)))), (X (NOT (AND (NOT p3) (NOT p2) p0 p4))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND p3 p0 p4) (AND p2 p0 p4)))), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p3) p2 (NOT p0) p4))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) p2 p0 p4))), (X (NOT (OR (AND p3 (NOT p1) p4) (AND p2 (NOT p1) p4) (AND (NOT p0) (NOT p1) p4)))), (X (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1)))), (X (OR (AND p3 p0) (AND p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (OR (AND p3 (NOT p0) p4) (AND p2 (NOT p0) p4))))), (X (X (NOT (OR (AND p3 p0 (NOT p1) p4) (AND p2 p0 (NOT p1) p4))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p4)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (OR (AND p3 p0 p4) (AND p2 p0 p4))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p4)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) p2 p0 p4)))), (X (X (NOT (OR (AND p3 (NOT p1) p4) (AND p2 (NOT p1) p4) (AND (NOT p0) (NOT p1) p4))))), (X (X (OR (AND p3 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p4)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1) p4)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1))))), (X (X (NOT (OR (AND p3 p0 (NOT p1)) (AND p2 p0 (NOT p1)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 47 factoid took 135 ms. Reduced automaton from 8 states, 27 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 1822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-31 05:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:11] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 05:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6572 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 12069 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18661ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 18662ms
Finished structural reductions in LTL mode , in 1 iterations and 18828 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 5376 reset in 311 ms.
Product exploration explored 100000 steps with 5324 reset in 295 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 121 steps (0 resets) in 7 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2025-05-31 05:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:29:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 05:29:31] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 72 ms returned sat
[2025-05-31 05:29:32] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-05-31 05:29:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:29:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-31 05:29:32] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 27 ms returned sat
[2025-05-31 05:29:32] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2025-05-31 05:29:32] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 05:29:33] [INFO ] Added : 54 causal constraints over 11 iterations in 251 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 32 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-31 05:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:29:33] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:29:33] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-31 05:29:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6410 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 12040 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18467ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 18468ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18674 ms. Remains : 140/140 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 106 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
[2025-05-31 05:29:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:29:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-05-31 05:29:52] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 68 ms returned sat
[2025-05-31 05:29:52] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-05-31 05:29:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:29:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-05-31 05:29:53] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 27 ms returned sat
[2025-05-31 05:29:53] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2025-05-31 05:29:53] [INFO ] Computed and/alt/rep : 112/192/112 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 05:29:53] [INFO ] Added : 54 causal constraints over 11 iterations in 230 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2797 reset in 237 ms.
Product exploration explored 100000 steps with 2821 reset in 305 ms.
Built C files in :
/tmp/ltsmin3534176930336006563
[2025-05-31 05:29:54] [INFO ] Computing symmetric may disable matrix : 128 transitions.
[2025-05-31 05:29:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:29:54] [INFO ] Computing symmetric may enable matrix : 128 transitions.
[2025-05-31 05:29:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:29:54] [INFO ] Computing Do-Not-Accords matrix : 128 transitions.
[2025-05-31 05:29:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:29:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3534176930336006563
Running compilation step : cd /tmp/ltsmin3534176930336006563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin3534176930336006563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3534176930336006563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6075359382829053035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 33 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2025-05-31 05:30:09] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-31 05:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:09] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:30:09] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-31 05:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2389 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4582 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6989ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6990ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7185 ms. Remains : 88/140 places, 80/128 transitions.
Built C files in :
/tmp/ltsmin3264761661669786372
[2025-05-31 05:30:16] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2025-05-31 05:30:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:30:16] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2025-05-31 05:30:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:30:16] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2025-05-31 05:30:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:30:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3264761661669786372
Running compilation step : cd /tmp/ltsmin3264761661669786372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin3264761661669786372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3264761661669786372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11283175533715641513.hoa' '--buchi-type=spotba'
LTSmin run took 3543 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-01 finished in 69017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)||G(p1)))||G(p2))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 9 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 05:30:20] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-31 05:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:20] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 05:30:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6498 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 12147 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18661ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 18662ms
Finished structural reductions in LTL mode , in 1 iterations and 18908 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 305 ms.
Stack based approach found an accepted trace after 2528 steps with 0 reset with depth 2529 and stack size 2529 in 8 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 19385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(F(p2))||p1)))))'
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 48 rules applied. Total rules applied 116 place count 88 transition count 64
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 17 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2025-05-31 05:30:40] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:40] [INFO ] Implicit Places using invariants in 141 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2025-05-31 05:30:40] [INFO ] Actually due to overlaps returned [0, 6, 14, 20, 19, 32, 36, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 143 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/140 places, 48/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 48/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 6647 reset in 351 ms.
Stack based approach found an accepted trace after 96 steps with 5 reset with depth 14 and stack size 12 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 103
Reduce places removed 28 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 51 rules applied. Total rules applied 76 place count 112 transition count 80
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 100 place count 89 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 88 transition count 79
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 101 place count 88 transition count 61
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 137 place count 70 transition count 61
Applied a total of 137 rules in 20 ms. Remains 70 /140 variables (removed 70) and now considering 61/128 (removed 67) transitions.
// Phase 1: matrix 61 rows 70 cols
[2025-05-31 05:30:40] [INFO ] Computed 25 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:40] [INFO ] Implicit Places using invariants in 114 ms returned [0, 2, 5, 6, 11, 12, 14, 15, 18, 19, 22, 26, 27, 33, 37, 41, 43, 44, 45, 47, 48, 49, 55, 59, 60, 61, 68]
[2025-05-31 05:30:40] [INFO ] Actually due to overlaps returned [0, 15, 27, 41, 14, 47, 48, 68]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 115 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/140 places, 61/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 62/140 places, 61/128 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-08
Product exploration explored 100000 steps with 1668 reset in 143 ms.
Stack based approach found an accepted trace after 113 steps with 1 reset with depth 29 and stack size 29 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0))&&F(p1))) U (X(!p1)&&p2)))'
Support contains 7 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 20 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 05:30:41] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:41] [INFO ] Implicit Places using invariants in 170 ms returned [7, 14, 16, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 172 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 125/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), p1]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 797 steps with 1 reset with depth 724 and stack size 724 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-09 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F((p1 U (p2||G(p1))))) U (X(X(!p3)) U ((X(X(!p3))&&G(!p0))||X(X(G(!p3)))))))'
Support contains 8 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:41] [INFO ] Implicit Places using invariants in 173 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 138]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 174 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 126/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 701 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p1) (NOT p2) p3), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 5546 reset in 205 ms.
Product exploration explored 100000 steps with 5349 reset in 210 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT p0)), (X p1), (X (AND (NOT p0) (NOT p3))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 256 ms. Reduced automaton from 14 states, 52 edges and 4 AP (stutter sensitive) to 14 states, 52 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 742 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p1) (NOT p2) p3), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND (NOT p2) (NOT p1) (NOT p3) p0)]
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 781 ms. (51 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
// Phase 1: matrix 128 rows 126 cols
[2025-05-31 05:30:44] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/73 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 44/126 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 128/254 variables, 126/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 266 constraints, problems are : Problem set: 0 solved, 4 unsolved in 221 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 65/73 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Int declared 126/254 variables, and 96 constraints, problems are : Problem set: 4 solved, 0 unsolved in 105 ms.
Refiners :[Domain max(s): 82/126 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/126 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT p0)), (X p1), (X (AND (NOT p0) (NOT p3))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) (NOT p3)))), (G (OR (NOT p0) (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p0) p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p0 (NOT p3)))), (F (NOT p1)), (F p3), (F p0), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 36 factoid took 1402 ms. Reduced automaton from 14 states, 52 edges and 4 AP (stutter sensitive) to 14 states, 40 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 697 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 721 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-31 05:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:30:47] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-05-31 05:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:48] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:48] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:48] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 3/125 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:49] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:50] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/126 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:52] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:30:52] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (OVERLAPS) 128/254 variables, 126/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 18 (OVERLAPS) 0/254 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 289 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8540 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 23/153 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 3/125 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 128/254 variables, 126/289 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 112/401 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/254 variables, and 401 constraints, problems are : Problem set: 0 solved, 112 unsolved in 30028 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38584ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 38585ms
Finished structural reductions in LTL mode , in 1 iterations and 38940 ms. Remains : 126/126 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p3))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 563 ms. Reduced automaton from 14 states, 40 edges and 4 AP (stutter sensitive) to 14 states, 40 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 723 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 11049 steps (1 resets) in 45 ms. (240 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) p1), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p3))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F p3), (F (NOT (OR p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p0), (F (NOT p1)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 14 factoid took 969 ms. Reduced automaton from 14 states, 40 edges and 4 AP (stutter sensitive) to 14 states, 40 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 716 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 711 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 675 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5694 reset in 186 ms.
Product exploration explored 100000 steps with 5477 reset in 195 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 678 ms :[(AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), (AND (NOT p2) p3 (NOT p1)), p3, (AND p0 p3), p3, (AND (NOT p2) p3 p0 (NOT p1)), (AND (NOT p2) p3 p0 (NOT p1)), (AND p0 p3), p3, p3, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) p3 p0), (AND p0 (NOT p1) (NOT p2))]
Support contains 8 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 128/128 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 126 transition count 128
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 26 place count 126 transition count 134
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 44 place count 126 transition count 134
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 126 transition count 134
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 53 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 134/128 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:31:32] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 134 rows 126 cols
[2025-05-31 05:31:32] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 1 places in 36 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:33] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/150 constraints. Problems are: Problem set: 26 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/150 constraints. Problems are: Problem set: 26 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 4/126 variables, 6/156 constraints. Problems are: Problem set: 26 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 4/160 constraints. Problems are: Problem set: 26 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:34] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:31:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 13/173 constraints. Problems are: Problem set: 37 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/173 constraints. Problems are: Problem set: 37 solved, 81 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 9 (OVERLAPS) 134/260 variables, 126/299 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/299 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/299 constraints. Problems are: Problem set: 59 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 299 constraints, problems are : Problem set: 59 solved, 59 unsolved in 4296 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 33/102 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/102 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 27/96 variables, 5/107 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 27/134 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/134 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 30/126 variables, 9/143 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 30/173 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/173 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 134/260 variables, 126/299 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 59/358 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/358 constraints. Problems are: Problem set: 59 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/358 constraints. Problems are: Problem set: 59 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 358 constraints, problems are : Problem set: 59 solved, 59 unsolved in 24817 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 59/118 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29127ms problems are : Problem set: 59 solved, 59 unsolved
Search for dead transitions found 59 dead transitions in 29128ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 75/128 transitions.
Graph (complete) has 217 edges and 126 vertex of which 73 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 2 place count 70 transition count 81
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 70 transition count 81
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 70 transition count 81
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 13 rules in 8 ms. Remains 70 /126 variables (removed 56) and now considering 81/75 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/126 places, 81/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29166 ms. Remains : 70/126 places, 81/128 transitions.
Built C files in :
/tmp/ltsmin14188000070347509747
[2025-05-31 05:32:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14188000070347509747
Running compilation step : cd /tmp/ltsmin14188000070347509747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin14188000070347509747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14188000070347509747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17736320982888836262.hoa' '--buchi-type=spotba'
LTSmin run took 346 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 80838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&(p1 U (!p0||G(p1)))) U p2))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2025-05-31 05:32:02] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:02] [INFO ] Implicit Places using invariants in 179 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 181 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), true, (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-12 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0)&&X((p1||X(F((X(F(p1))&&p2))))))||G((p1||X(F((X(F(p1))&&p3))))))))'
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-05-31 05:32:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:32:02] [INFO ] Implicit Places using invariants in 185 ms returned [7, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 186 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 125/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 554 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 3849 reset in 158 ms.
Stack based approach found an accepted trace after 11597 steps with 537 reset with depth 116 and stack size 116 in 20 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-13 finished in 951 ms.
All properties solved by simple procedures.
Total runtime 194533 ms.

BK_STOP 1748669523764

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is DatabaseWithMutex-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854029200836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;