About the Execution of ITS-Tools for PhilosophersDyn-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 58846.00 | 0.00 | 0.00 | FFTFFFFTTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253600234.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 PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253600234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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 87K 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 PhilosophersDyn-PT-03-CTLFireability-2025-00
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-01
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-02
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-03
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-04
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-05
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-06
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-07
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-08
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-09
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-10
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-11
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-12
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-13
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-14
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748891311332
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 19:08:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:08:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:08:32] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2025-06-02 19:08:32] [INFO ] Transformed 30 places.
[2025-06-02 19:08:32] [INFO ] Transformed 84 transitions.
[2025-06-02 19:08:32] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 3 formulas.
[2025-06-02 19:08:32] [INFO ] Reduced 5 identical enabling conditions.
[2025-06-02 19:08:32] [INFO ] Reduced 5 identical enabling conditions.
[2025-06-02 19:08:32] [INFO ] Reduced 5 identical enabling conditions.
[2025-06-02 19:08:32] [INFO ] Reduced 5 identical enabling conditions.
[2025-06-02 19:08:32] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2025-06-02 19:08:32] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2025-06-02 19:08:32] [INFO ] Computed 11 invariants in 14 ms
[2025-06-02 19:08:32] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 12 solved, 66 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 77 constraints, problems are : Problem set: 30 solved, 48 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 48/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 125 constraints, problems are : Problem set: 30 solved, 48 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5210ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 5225ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2025-06-02 19:08:37] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-02 19:08:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:08:38] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5402 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2025-06-02 19:08:38] [INFO ] Flatten gal took : 33 ms
[2025-06-02 19:08:38] [INFO ] Flatten gal took : 26 ms
[2025-06-02 19:08:38] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 39 to 31
RANDOM walk for 40000 steps (5693 resets) in 1940 ms. (20 steps per ms) remains 10/31 properties
BEST_FIRST walk for 40003 steps (499 resets) in 1104 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (857 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1100 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (580 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (938 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1300 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 117 ms. (338 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2500 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1135 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
[2025-06-02 19:08:39] [INFO ] Invariant cache hit.
[2025-06-02 19:08:39] [INFO ] State equation strengthened by 30 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp32 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 71 constraints, problems are : Problem set: 9 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/23 variables, 2/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/29 variables, 5/11 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/80 variables, 29/40 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 30/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/70 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/71 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 72 constraints, problems are : Problem set: 9 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 50
Applied a total of 2 rules in 16 ms. Remains 29 /30 variables (removed 1) and now considering 50/51 (removed 1) transitions.
Running 47 sub problems to find dead transitions.
// Phase 1: matrix 50 rows 29 cols
[2025-06-02 19:08:40] [INFO ] Computed 11 invariants in 2 ms
[2025-06-02 19:08:40] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/79 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 73 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/79 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 47/120 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:41] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 121 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3248ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3265 ms. Remains : 29/30 places, 50/51 transitions.
RANDOM walk for 40000 steps (5669 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Probably explored full state space saw : 274 states, properties seen :0
Probabilistic random walk after 916 steps, saw 274 distinct states, run finished after 11 ms. (steps per millisecond=83 ) properties seen :0
Explored full state space saw : 274 states, properties seen :0
Exhaustive walk after 916 steps, saw 274 distinct states, run finished after 2 ms. (steps per millisecond=458 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:08:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 19:08:43] [INFO ] Flatten gal took : 13 ms
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:08:43] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:08:43] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
// Phase 1: matrix 51 rows 30 cols
[2025-06-02 19:08:43] [INFO ] Computed 11 invariants in 1 ms
[2025-06-02 19:08:43] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 123 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2243 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3358ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3358ms
[2025-06-02 19:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 19:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:08:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:08:47] [INFO ] Invariant cache hit.
[2025-06-02 19:08:47] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:48] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2583ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2584ms
Finished structural reductions in LTL mode , in 1 iterations and 6037 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:08:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:08:49] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:08:49] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:08:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:08:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:08:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4718620830038169819.gal : 3 ms
[2025-06-02 19:08:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9734906146996959104.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4718620830038169819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9734906146996959104.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.029295,4432,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: A((EG(((EX((((Think_3>=1)||(Think_2>=1))||(Think_1>=1))) + (Think_3>=1)) + ((Think_2>=1)||(Think_1>=1)))) + AF(AX(((((((((Outside_3>=1)&&...2144
=> equivalent forward existential formula: [((Init * !(EG(!(((((Forks_1>=1)&&(WaitLeft_1>=1))||((Forks_3>=1)&&(WaitLeft_3>=1)))||((WaitLeft_2>=1)&&(Forks_2...2435
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.241064,14160,1,0,208,42966,130,111,1972,35145,276
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:08:50] [INFO ] Invariant cache hit.
[2025-06-02 19:08:50] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2758ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2759ms
[2025-06-02 19:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 19:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:08:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:08:53] [INFO ] Invariant cache hit.
[2025-06-02 19:08:53] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:53] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:54] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2621ms
Finished structural reductions in LTL mode , in 1 iterations and 5470 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:08:55] [INFO ] Flatten gal took : 9 ms
[2025-06-02 19:08:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:08:55] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:08:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:08:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability718274795767590098.gal : 3 ms
[2025-06-02 19:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9369459644305070870.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability718274795767590098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9369459644305070870.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.020181,4592,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: EX((EX(((((((((Forks_1<1)||(Think_1<1))||((Neighbourhood_1_1<1)||(Neighbourhood_2_1<1)))&&(((Think_3<1)||(Forks_3<1))||((Neighbourhood_3_...4588
=> equivalent forward existential formula: [(((EY(Init) * EX(((((((((Forks_1<1)||(Think_1<1))||((Neighbourhood_1_1<1)||(Neighbourhood_2_1<1)))&&(((Think_3<...5831
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.270815,14960,1,0,195,44816,129,104,2045,37015,256
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:08:56] [INFO ] Invariant cache hit.
[2025-06-02 19:08:56] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:57] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2572ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2573ms
[2025-06-02 19:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 19:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:08:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:08:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:08:58] [INFO ] Invariant cache hit.
[2025-06-02 19:08:58] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:08:59] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2678ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2680ms
Finished structural reductions in LTL mode , in 1 iterations and 5320 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 19:09:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 19:09:01] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:09:01] [INFO ] Flatten gal took : 8 ms
[2025-06-02 19:09:01] [INFO ] Flatten gal took : 8 ms
[2025-06-02 19:09:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4525968001354427763.gal : 1 ms
[2025-06-02 19:09:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14595992540049923898.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4525968001354427763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14595992540049923898.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.020292,4600,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: ((AG((((((((Neighbourhood_2_2>=1)&&(WaitRight_2>=1))&&(Forks_2>=1))||(((WaitRight_1>=1)&&(Forks_3>=1))&&(Neighbourhood_1_3>=1)))||((((For...26056
=> equivalent forward existential formula: (([(FwdU(((Init * !((!(E(TRUE U !((((((((Neighbourhood_2_2>=1)&&(WaitRight_2>=1))&&(Forks_2>=1))||(((WaitRight_1...82708
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Using saturation style SCC detection
(forward)formula 0,1,0.771328,19704,1,0,273,59023,151,160,2190,54781,396
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:02] [INFO ] Invariant cache hit.
[2025-06-02 19:09:02] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:02] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2643ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2643ms
[2025-06-02 19:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 19:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:09:04] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:09:04] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:04] [INFO ] Invariant cache hit.
[2025-06-02 19:09:04] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:06] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2584ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2585ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 5298 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:09:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 19:09:07] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:09:07] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:09:07] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1015880817144428753.gal : 1 ms
[2025-06-02 19:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14449676273191812650.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1015880817144428753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14449676273191812650.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.019023,4476,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: E(AG(((((A(((!((((Forks_1>=1)&&(WaitLeft_1>=1))||((Forks_3>=1)&&(WaitLeft_3>=1)))||((WaitLeft_2>=1)&&(Forks_2>=1))))&&(!(((Think_3>=1)||(...8468
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(((((!((E(!(!((E(!(((((Forks_1>=1)&&(WaitLeft_1>=1))||((Forks_3>=1)&&(WaitLeft_3>=1)))|...13573
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
(forward)formula 0,0,0.375738,17532,1,0,249,53790,149,140,2106,48509,360
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:08] [INFO ] Invariant cache hit.
[2025-06-02 19:09:08] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:09] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2602ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2603ms
[2025-06-02 19:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 19:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:09:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:09:10] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:10] [INFO ] Invariant cache hit.
[2025-06-02 19:09:10] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:11] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2619ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2620ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 5320 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:09:13] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:09:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6244353047577337105.gal : 1 ms
[2025-06-02 19:09:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13735732327840396653.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6244353047577337105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13735732327840396653.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.02151,4516,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: AG((((((AG(((EF(((((((((Forks_1>=1)&&(Think_1>=1))&&((Neighbourhood_1_1>=1)&&(Neighbourhood_2_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&((N...7422
=> equivalent forward existential formula: ((((([(((FwdU(FwdU(Init,TRUE),TRUE) * !((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_2>=1)&&(Forks_2>=1))))) * !...7988
(forward)formula 0,0,0.031074,4772,1,0,8,2152,9,2,283,1731,1
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:13] [INFO ] Invariant cache hit.
[2025-06-02 19:09:13] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2658ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2662ms
[2025-06-02 19:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 19:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:09:16] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:09:16] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:16] [INFO ] Invariant cache hit.
[2025-06-02 19:09:16] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2678ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2679ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 5468 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:18] [INFO ] Flatten gal took : 7 ms
[2025-06-02 19:09:18] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:09:18] [INFO ] Input system was already deterministic with 51 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 19:09:18] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:18] [INFO ] Flatten gal took : 3 ms
[2025-06-02 19:09:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3814660248317660211.gal : 0 ms
[2025-06-02 19:09:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2693404824376055862.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3814660248317660211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2693404824376055862.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:18] [INFO ] Invariant cache hit.
[2025-06-02 19:09:18] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:20] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2623ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2623ms
[2025-06-02 19:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:21] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-02 19:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:09:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:21] [INFO ] Invariant cache hit.
[2025-06-02 19:09:21] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:22] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1589 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2675ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Finished structural reductions in LTL mode , in 1 iterations and 5426 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 19:09:24] [INFO ] Flatten gal took : 3 ms
[2025-06-02 19:09:24] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:09:24] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:24] [INFO ] Flatten gal took : 3 ms
[2025-06-02 19:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2272831315887306957.gal : 0 ms
[2025-06-02 19:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11441622497198084960.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2272831315887306957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11441622497198084960.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.018784,4604,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: EX((((Think_3<1)&&(Think_2<1))&&(Think_1<1)))
=> equivalent forward existential formula: [(EY(Init) * (((Think_3<1)&&(Think_2<1))&&(Think_1<1)))] != FALSE
(forward)formula 0,0,0.020128,4860,1,0,8,2152,8,1,331,1731,2
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:24] [INFO ] Invariant cache hit.
[2025-06-02 19:09:24] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:25] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2636ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2636ms
[2025-06-02 19:09:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 19:09:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:09:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 19:09:27] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:09:27] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 19:09:27] [INFO ] Invariant cache hit.
[2025-06-02 19:09:27] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/81 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:09:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 51/81 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 30/73 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 48/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2611ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2611ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 5348 ms. Remains : 30/30 places, 51/51 transitions.
[2025-06-02 19:09:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:29] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 19:09:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:29] [INFO ] Flatten gal took : 4 ms
[2025-06-02 19:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6011534401180885373.gal : 1 ms
[2025-06-02 19:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1963381698372235644.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6011534401180885373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1963381698372235644.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.018902,4476,2,498,5,2152,6,0,180,1731,0
Converting to forward existential form...Done !
original formula: A(!(((((((((Forks_1<1)||(Think_1<1))||((Neighbourhood_1_1<1)||(Neighbourhood_2_1<1)))&&(((Think_3<1)||(Forks_3<1))||((Neighbourhood_3_3<1...3791
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!((!((((((((Neighbourhood_2_2>=1)&&(WaitRight_2>=1))&&(Forks_2>=1))||(((WaitRight_1>=1)&...10663
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
(forward)formula 0,1,0.326944,13308,1,0,172,38453,130,87,1932,32803,224
FORMULA PhilosophersDyn-PT-03-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-02 19:09:30] [INFO ] Flatten gal took : 3 ms
[2025-06-02 19:09:30] [INFO ] Flatten gal took : 4 ms
Total runtime 57681 ms.
BK_STOP 1748891370178
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
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 PhilosophersDyn-PT-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253600234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;