Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253400138.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 Philosophers-PT-000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253400138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 362K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 101K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 701K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 51K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 210K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 217K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 398K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 215K 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 Philosophers-PT-000100-CTLFireability-2025-00
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-01
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-02
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-03
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-04
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-05
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-06
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-07
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-08
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-09
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-10
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-11
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-12
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-13
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-14
FORMULA_NAME Philosophers-PT-000100-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748866761994

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:19:23] [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 12:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:19:23] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-02 12:19:23] [INFO ] Transformed 500 places.
[2025-06-02 12:19:23] [INFO ] Transformed 500 transitions.
[2025-06-02 12:19:23] [INFO ] Found NUPN structural information;
[2025-06-02 12:19:23] [INFO ] Parsed PT model containing 500 places and 500 transitions and 1600 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2025-06-02 12:19:23] [INFO ] Computed 200 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:23] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-02 12:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:24] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30023 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in LTL mode , in 1 iterations and 60835 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2025-06-02 12:20:24] [INFO ] Flatten gal took : 175 ms
[2025-06-02 12:20:25] [INFO ] Flatten gal took : 87 ms
[2025-06-02 12:20:25] [INFO ] Input system was already deterministic with 500 transitions.
Reduction of identical properties reduced properties to check from 56 to 51
RANDOM walk for 40000 steps (9 resets) in 1517 ms. (26 steps per ms) remains 1/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2021 ms. (19 steps per ms) remains 1/1 properties
[2025-06-02 12:20:27] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 400/1000 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 90 ms.
Refiners :[Domain max(s): 0/500 constraints, Positive P Invariants (semi-flows): 0/200 constraints, State Equation: 0/500 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-02 12:20:27] [INFO ] Flatten gal took : 54 ms
[2025-06-02 12:20:27] [INFO ] Flatten gal took : 65 ms
[2025-06-02 12:20:28] [INFO ] Input system was already deterministic with 500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:28] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 12:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:28] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:20:28] [INFO ] Redundant transitions in 32 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-02 12:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30016 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60588 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:21:28] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:21:28] [INFO ] Flatten gal took : 30 ms
[2025-06-02 12:21:29] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:21:29] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:21:29] [INFO ] Flatten gal took : 22 ms
[2025-06-02 12:21:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9944239236807860986.gal : 12 ms
[2025-06-02 12:21:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8892677130102894322.ctl : 12 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/CTLFireability9944239236807860986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8892677130102894322.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,5.15378e+47,0.200393,8036,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: E((AG(!(((((((((Eat_71==1)||(Eat_10==1))||((Eat_75==1)||(Eat_63==1)))||(((Eat_2==1)||(Eat_67==1))||((Eat_54==1)||(Eat_58==1))))||((((Eat_...30911
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(((((((((Eat_71==1)||(Eat_10==1))||((Eat_75==1)||(Eat_63==1)))||(((Eat_2==1)||(Eat_67...37790
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/0/300
(forward)formula 0,0,3.19503,106948,1,0,11,738780,25,5,14167,118039,13
FORMULA Philosophers-PT-000100-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:32] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-02 12:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:32] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:22:32] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:22:32] [INFO ] Flatten gal took : 21 ms
[2025-06-02 12:22:33] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:22:33] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:22:33] [INFO ] Flatten gal took : 19 ms
[2025-06-02 12:22:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3974368912819802080.gal : 4 ms
[2025-06-02 12:22:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2807141869680537962.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/CTLFireability3974368912819802080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2807141869680537962.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,5.15378e+47,0.186486,8080,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: (AG(AF(E(AG((((((((((Think_43==1)&&(Fork_43==1))||((Think_62==1)&&(Fork_62==1)))||(((Think_41==1)&&(Fork_41==1))||((Think_1==1)&&(Fork_1=...24929
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(!(E(TRUE U !((((((((((Think_43==1)&&(Fork_43==1))||((Think_62==1)&&(Fork_62==1)))||((...25039
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
Hit Full ! (commute/partial/dont) 0/0/500
Hit Full ! (commute/partial/dont) 200/0/300
(forward)formula 0,0,6.96802,225008,1,0,20,1.22998e+06,47,9,15277,915841,30
FORMULA Philosophers-PT-000100-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:40] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 12:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:40] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:22:40] [INFO ] Redundant transitions in 9 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-02 12:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60616 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:23:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:23:40] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:23:40] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:23:40] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:23:40] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:23:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11051172569643931535.gal : 3 ms
[2025-06-02 12:23:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17357606395342835196.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/CTLFireability11051172569643931535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17357606395342835196.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 -...285
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,5.15378e+47,0.171099,8080,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AF((((((((A((((((((((Fork_38==1)&&(Catch2_39==1))||((Fork_35==1)&&(Catch2_36==1)))||(((Fork_44==1)&&(Catch2_45==1))||((Fork_21==1)&&(Catc...6395
=> equivalent forward existential formula: [FwdG(Init,!((((((((!((E(!(((((((((Eat_71==1)||(Eat_10==1))||((Eat_75==1)||(Eat_63==1)))||(((Eat_2==1)||(Eat_67=...9445
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/29700/300
Hit Full ! (commute/partial/dont) 200/29700/300
Detected timeout of ITS tools.
[2025-06-02 12:24:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:24:10] [INFO ] Applying decomposition
[2025-06-02 12:24:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10993224715223286760.txt' '-o' '/tmp/graph10993224715223286760.bin' '-w' '/tmp/graph10993224715223286760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10993224715223286760.bin' '-l' '-1' '-v' '-w' '/tmp/graph10993224715223286760.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:24:11] [INFO ] Decomposing Gal with order
[2025-06-02 12:24:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:24:11] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-02 12:24:11] [INFO ] Flatten gal took : 66 ms
[2025-06-02 12:24:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 17 ms.
[2025-06-02 12:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5437474919201278776.gal : 6 ms
[2025-06-02 12:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability839495428577795440.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/CTLFireability5437474919201278776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability839495428577795440.ctl'

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 -...261
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,5.15378e+47,0.099496,8512,564,51,4596,307,619,3225,90,449,0


Converting to forward existential form...Done !
original formula: AF((((((((A((((((((((i10.i2.u63.Fork_38==1)&&(i10.i2.u64.Catch2_39==1))||((i2.i1.u66.Fork_35==1)&&(i2.i1.u2.Catch2_36==1)))||(((i3.i0.u29...10545
=> equivalent forward existential formula: [FwdG(Init,!((((((((!((E(!(((((((((i4.i1.u53.Eat_71==1)||(i9.i0.u10.Eat_10==1))||((i4.i2.u45.Eat_75==1)||(i15.i2...15669
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:41] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 12:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:41] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30010 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in LTL mode , in 1 iterations and 60492 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:25:41] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:25:41] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:25:41] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:25:41] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:25:41] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4979311182634907978.gal : 3 ms
[2025-06-02 12:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2614254936783131265.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/CTLFireability4979311182634907978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2614254936783131265.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,5.15378e+47,0.181134,8080,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AF((EF(AX(!(E((((((((((Fork_63==1)&&(Catch1_63==1))||((Fork_75==1)&&(Catch1_75==1)))||(((Fork_14==1)&&(Catch1_14==1))||((Fork_6==1)&&(Cat...14774
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(!(E((((((((((Fork_63==1)&&(Catch1_63==1))||((Fork_75==1)&&(Catch1_75==1)))||(((For...14849
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/23202/500
Hit Full ! (commute/partial/dont) 0/0/500
(forward)formula 0,1,15.7753,459316,1,0,17,3.18973e+06,37,9,14767,1.64722e+06,21
FORMULA Philosophers-PT-000100-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 12:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:58] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:25:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:26:58] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:26:58] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:26:58] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:26:58] [INFO ] Flatten gal took : 27 ms
[2025-06-02 12:26:58] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12734615509639937885.gal : 2 ms
[2025-06-02 12:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1496909319948893387.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12734615509639937885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1496909319948893387.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,5.15378e+47,0.182105,8080,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AX(A(!((((((((((EX((((((((((Fork_38==1)&&(Catch2_39==1))||((Fork_35==1)&&(Catch2_36==1)))||(((Fork_44==1)&&(Catch2_45==1))||((Fork_21==1)...31404
=> equivalent forward existential formula: ([((FwdU((FwdU(EY(Init),!(!(E(TRUE U !((EG((((((((((Think_43==1)&&(Fork_43==1))||((Think_62==1)&&(Fork_62==1)))|...56679
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/29700/300
Hit Full ! (commute/partial/dont) 200/29700/300
(forward)formula 0,0,18.3678,540824,1,0,16,3.10004e+06,37,11,15767,2.55711e+06,18
FORMULA Philosophers-PT-000100-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:27:17] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 12:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:27:17] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 timeout
1)
(s5 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 18 ms
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:28:17] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 24 ms
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 25 ms
[2025-06-02 12:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8676654600529729946.gal : 2 ms
[2025-06-02 12:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10571041637294480297.ctl : 8 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/CTLFireability8676654600529729946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10571041637294480297.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,5.15378e+47,0.174308,8072,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EG((A(((E(((((((((Eat_71==1)||(Eat_10==1))||((Eat_75==1)||(Eat_63==1)))||(((Eat_2==1)||(Eat_67==1))||((Eat_54==1)||(Eat_58==1))))||((((Ea...64062
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((((((EX((((((((((Think_43==1)&&(Fork_43==1))||((Think_62==1)&&(Fork_62==1)))||(((Think_41==...100039
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
Detected timeout of ITS tools.
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 35 ms
[2025-06-02 12:28:47] [INFO ] Applying decomposition
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4906006337127216122.txt' '-o' '/tmp/graph4906006337127216122.bin' '-w' '/tmp/graph4906006337127216122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4906006337127216122.bin' '-l' '-1' '-v' '-w' '/tmp/graph4906006337127216122.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:28:47] [INFO ] Decomposing Gal with order
[2025-06-02 12:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:28:47] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 42 ms
[2025-06-02 12:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 8 ms.
[2025-06-02 12:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6679279760805655191.gal : 3 ms
[2025-06-02 12:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5517239371110715220.ctl : 9 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/CTLFireability6679279760805655191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5517239371110715220.ctl'

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 -...262
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,5.15378e+47,0.098694,8512,384,51,3583,307,644,2652,94,485,0


Converting to forward existential form...Done !
original formula: EG((A(((E(((((((((i11.i2.u41.Eat_71==1)||(i4.i0.u60.Eat_10==1))||((i11.i1.u47.Eat_75==1)||(i9.i0.u82.Eat_63==1)))||(((i10.i0.u63.Eat_2==1...104361
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((((((EX((((((((((i1.i0.u5.Think_43==1)&&(i1.i0.u5.Fork_43==1))||((i9.i0.u81.Think_62==1)&&(...163070
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 2 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:18] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 12:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:18] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 60431 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:30:18] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:30:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 12:30:18] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:30:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 12:30:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 12:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2024869474067072387.gal : 2 ms
[2025-06-02 12:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1686916489011533101.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2024869474067072387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1686916489011533101.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,5.15378e+47,0.17051,8084,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EG(((EG(A((((((((((Eat_71==1)||(Eat_10==1))||((Eat_75==1)||(Eat_63==1)))||(((Eat_2==1)||(Eat_67==1))||((Eat_54==1)||(Eat_58==1))))||((((E...40864
=> equivalent forward existential formula: [FwdG(Init,((EG(!((E(!(((((((((((Think_28==1)&&(Fork_27==1))||((Think_93==1)&&(Fork_92==1)))||(((Think_69==1)&&(...50522
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/44614/500
Hit Full ! (commute/partial/dont) 0/44614/500
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/0/500
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/0/500
Detected timeout of ITS tools.
[2025-06-02 12:30:48] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:30:48] [INFO ] Applying decomposition
[2025-06-02 12:30:48] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11073448467815574001.txt' '-o' '/tmp/graph11073448467815574001.bin' '-w' '/tmp/graph11073448467815574001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11073448467815574001.bin' '-l' '-1' '-v' '-w' '/tmp/graph11073448467815574001.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:30:49] [INFO ] Decomposing Gal with order
[2025-06-02 12:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:30:49] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-02 12:30:49] [INFO ] Flatten gal took : 35 ms
[2025-06-02 12:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 7 ms.
[2025-06-02 12:30:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7665577990557186201.gal : 4 ms
[2025-06-02 12:30:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14091641391114049286.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/CTLFireability7665577990557186201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14091641391114049286.ctl'

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 -...263
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,5.15378e+47,0.126271,8516,478,58,3941,319,657,2884,94,530,0


Converting to forward existential form...Done !
original formula: EG(((EG(A((((((((((i9.i0.u10.Eat_71==1)||(i4.i0.u15.Eat_10==1))||((i12.i1.u49.Eat_75==1)||(i10.i1.u45.Eat_63==1)))||(((i5.i1.u19.Eat_2==1...66619
=> equivalent forward existential formula: [FwdG(Init,((EG(!((E(!(((((((((((i2.i1.u5.Think_28==1)&&(i2.i1.u5.Fork_27==1))||((i17.i1.u89.Think_93==1)&&(i17....82457
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,25.1802,660036,1,0,1.60148e+06,1037,7476,1.63165e+06,467,4338,925078
FORMULA Philosophers-PT-000100-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 24 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:14] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 12:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:14] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:31:14] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-02 12:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30008 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)timeout

(s95 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60505 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:32:15] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:32:15] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:32:15] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:32:15] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:32:15] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:32:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7935523148369299655.gal : 2 ms
[2025-06-02 12:32:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13368444200674710091.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/CTLFireability7935523148369299655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13368444200674710091.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,5.15378e+47,0.176674,8084,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: E(EF((((((((((Fork_63==1)&&(Catch1_63==1))||((Fork_75==1)&&(Catch1_75==1)))||(((Fork_14==1)&&(Catch1_14==1))||((Fork_6==1)&&(Catch1_6==1)...6692
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U (((((((((Fork_63==1)&&(Catch1_63==1))||((Fork_75==1)&&(Catch1_75==1)))||(((Fork_14==1)&...6742
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/500
(forward)formula 0,1,6.88057,218952,1,0,110,1.30143e+06,28,204,13567,1.09469e+06,315
FORMULA Philosophers-PT-000100-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:22] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-02 12:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:32:22] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:32:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60728 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:33:22] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:33:22] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:33:22] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:33:22] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:33:22] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:33:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9673308957120791896.gal : 3 ms
[2025-06-02 12:33:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2862290374492374832.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/CTLFireability9673308957120791896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2862290374492374832.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,5.15378e+47,0.17005,8084,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EX(AG(AX(((EF(((Fork_29==1)&&(Catch2_30==1))) + ((Think_92==1)&&(Fork_92==1))) + (((Think_68==1)&&(Fork_67==1))||((Think_88==1)&&(Fork_88...165
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((E(TRUE U ((Fork_29==1)&&(Catch2_30==1))) + ((Think_92==1)&&(Fork_92==1))) + (...234
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.74312,102020,1,0,12,706643,16,5,12575,58272,11
FORMULA Philosophers-PT-000100-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:33:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:33:25] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-02 12:33:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:33:26] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:34:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:34:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:34:26] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:34:26] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:34:26] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9355424132416855820.gal : 3 ms
[2025-06-02 12:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13805980631966579481.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/CTLFireability9355424132416855820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13805980631966579481.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,5.15378e+47,0.176833,8084,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: EF(((AF(((Fork_10==1)&&(Catch1_10==1))) * EG(EX((Eat_46==0)))) + (((!(A(EF((Eat_54==1)) U (((Fork_4==1)&&(Catch1_4==1))||(Eat_88==1)))) +...501
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(EG(!(((Fork_10==1)&&(Catch1_10==1)))))),EX((Eat_46==0)))] != FALSE + (([((FwdU(((Fwd...1721
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 493/0/7
(forward)formula 0,1,3.40295,121352,1,0,19,833953,25,16,12580,226902,23
FORMULA Philosophers-PT-000100-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:34:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:34:30] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-02 12:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:34:30] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:35:30] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:35:30] [INFO ] Flatten gal took : 16 ms
[2025-06-02 12:35:30] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:35:30] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:35:30] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:35:30] [INFO ] Time to serialize gal into /tmp/CTLFireability68106389175160035.gal : 2 ms
[2025-06-02 12:35:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6925115684555128340.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/CTLFireability68106389175160035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6925115684555128340.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 -...281
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,5.15378e+47,0.180009,8088,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: A(!((((EX((Eat_10!=1)) + A((((Think_77==1)&&(Fork_76==1))&&((Think_11==1)&&(Fork_11==1))) U !(((Fork_76==1)&&(Catch2_77==1))))) + (AX(((T...584
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !((!(EX((Eat_76==1))) + ((Think_55==1)&&(Fork_54==1))))))))))) * !(E(!(E(TR...936
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.72549,99008,1,0,13,696014,23,6,12571,59436,11
FORMULA Philosophers-PT-000100-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 0 with 186 rules applied. Total rules applied 186 place count 407 transition count 407
Applied a total of 186 rules in 57 ms. Remains 407 /500 variables (removed 93) and now considering 407/500 (removed 93) transitions.
// Phase 1: matrix 407 rows 407 cols
[2025-06-02 12:35:33] [INFO ] Computed 200 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:35:33] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-02 12:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:35:34] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:35:34] [INFO ] Redundant transitions in 2 ms returned []
Running 207 sub problems to find dead transitions.
[2025-06-02 12:35:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 100/407 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 100/407 variables, 100/507 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 100/607 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 407/814 variables, 407/1014 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/814 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/814 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 1014 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17521 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 100/407 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 100/407 variables, 100/507 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 100/607 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 407/814 variables, 407/1014 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/814 variables, 207/1221 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/814 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/814 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 1221 constraints, problems are : Problem set: 0 solved, 207 unsolved in 18020 ms.
Refiners :[Domain max(s): 407/407 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35560ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 35562ms
Starting structural reductions in SI_CTL mode, iteration 1 : 407/500 places, 407/500 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36264 ms. Remains : 407/500 places, 407/500 transitions.
[2025-06-02 12:36:09] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:36:09] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:36:09] [INFO ] Input system was already deterministic with 407 transitions.
[2025-06-02 12:36:09] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:36:09] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:36:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3419589558764561328.gal : 2 ms
[2025-06-02 12:36:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16829206277388594212.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/CTLFireability3419589558764561328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16829206277388594212.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,1.77389e+42,0.12222,7288,2,1682,5,7824,6,0,2038,5734,0


Converting to forward existential form...Done !
original formula: EG(((EG((((Think_63==1)&&(Fork_63==1))&&((Think_1==1)&&(Fork_100==1)))) * (Eat_79==0)) * ((Think_28==1)&&(Fork_28==1))))
=> equivalent forward existential formula: [FwdG(Init,((EG((((Think_63==1)&&(Fork_63==1))&&((Think_1==1)&&(Fork_100==1)))) * (Eat_79==0)) * ((Think_28==1)&...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.51835,99100,1,0,205,631969,24,200,10128,401512,204
FORMULA Philosophers-PT-000100-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 401 transition count 401
Applied a total of 198 rules in 28 ms. Remains 401 /500 variables (removed 99) and now considering 401/500 (removed 99) transitions.
// Phase 1: matrix 401 rows 401 cols
[2025-06-02 12:36:12] [INFO ] Computed 200 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:12] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-02 12:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:13] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:36:13] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2025-06-02 12:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 100/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 100/401 variables, 100/501 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 100/601 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/802 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 1002 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16898 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 301/301 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 100/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 100/401 variables, 100/501 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 100/601 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 401/802 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 201/1203 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 1203 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16630 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33545ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 33546ms
Starting structural reductions in SI_CTL mode, iteration 1 : 401/500 places, 401/500 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34422 ms. Remains : 401/500 places, 401/500 transitions.
[2025-06-02 12:36:46] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:36:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:36:46] [INFO ] Input system was already deterministic with 401 transitions.
[2025-06-02 12:36:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:36:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17506594838933554282.gal : 1 ms
[2025-06-02 12:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5553903043464395951.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/CTLFireability17506594838933554282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5553903043464395951.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,7.34545e+41,0.125548,7236,2,1600,5,7018,6,0,2008,4955,0


Converting to forward existential form...Done !
original formula: EG(EF((Eat_6==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (Eat_6==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.57707,126140,1,0,108,704917,20,204,10390,672871,211
FORMULA Philosophers-PT-000100-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2025-06-02 12:36:50] [INFO ] Computed 200 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:50] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-02 12:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:51] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30015 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:37:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:37:51] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:37:51] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:37:51] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:37:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3168165114640089979.gal : 2 ms
[2025-06-02 12:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4976712146673370020.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/CTLFireability3168165114640089979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4976712146673370020.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,5.15378e+47,0.173582,8080,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: ((AX((EG(EX(((Fork_95==1)&&(Catch1_95==1)))) * !(E(((Fork_8==1)&&(Catch2_9==1)) U (Eat_67==1))))) * EF((AG(((Fork_16==0)||(Catch1_16==0))...334
=> equivalent forward existential formula: ((([(EY(Init) * !(EG(EX(((Fork_95==1)&&(Catch1_95==1))))))] = FALSE * [(FwdU(EY(Init),((Fork_8==1)&&(Catch2_9==1...542
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 497/0/3
Hit Full ! (commute/partial/dont) 497/0/3
Hit Full ! (commute/partial/dont) 493/0/7
Hit Full ! (commute/partial/dont) 493/6/7
(forward)formula 0,0,3.02552,106516,1,0,25,739350,50,13,13256,96367,35
FORMULA Philosophers-PT-000100-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-06-02 12:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:37:54] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-02 12:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:37:55] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 12:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1200 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 100/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 100/500 variables, 100/600 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 500/1000 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 300/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1500 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 60748 ms. Remains : 500/500 places, 500/500 transitions.
[2025-06-02 12:38:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:38:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:38:55] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-02 12:38:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:38:55] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:38:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7178834358852936665.gal : 2 ms
[2025-06-02 12:38:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2837944397267962502.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/CTLFireability7178834358852936665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2837944397267962502.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,5.15378e+47,0.170261,8088,2,2656,5,11351,6,0,2503,8493,0


Converting to forward existential form...Done !
original formula: AF((EX(((((Think_68==1)&&(Fork_68==1))&&(((Think_49==0)||(Fork_49==0))||(((Think_32==1)&&(Fork_32==1))||(Eat_86==1)))) + AG(AX((Eat_58==1...223
=> equivalent forward existential formula: [FwdG(Init,!((EX(((((Think_68==1)&&(Fork_68==1))&&(((Think_49==0)||(Fork_49==0))||(((Think_32==1)&&(Fork_32==1))...292
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 497/0/3
Detected timeout of ITS tools.
[2025-06-02 12:39:25] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:39:25] [INFO ] Applying decomposition
[2025-06-02 12:39:25] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17986382126128258388.txt' '-o' '/tmp/graph17986382126128258388.bin' '-w' '/tmp/graph17986382126128258388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17986382126128258388.bin' '-l' '-1' '-v' '-w' '/tmp/graph17986382126128258388.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:39:25] [INFO ] Decomposing Gal with order
[2025-06-02 12:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:39:25] [INFO ] Removed a total of 99 redundant transitions.
[2025-06-02 12:39:25] [INFO ] Flatten gal took : 20 ms
[2025-06-02 12:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 5 ms.
[2025-06-02 12:39:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4283045436507344145.gal : 4 ms
[2025-06-02 12:39:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13163193373094860474.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/CTLFireability4283045436507344145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13163193373094860474.ctl'

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 -...263
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,5.15378e+47,0.101102,8532,466,53,4117,307,650,2896,89,465,0


Converting to forward existential form...Done !
original formula: AF((EX(((((i19.i0.u82.Think_68==1)&&(i19.i0.u82.Fork_68==1))&&(((i17.i0.u91.Think_49==0)||(i17.i0.u91.Fork_49==0))||(((i18.i1.u71.Think_3...339
=> equivalent forward existential formula: [FwdG(Init,!((EX(((((i19.i0.u82.Think_68==1)&&(i19.i0.u82.Fork_68==1))&&(((i17.i0.u91.Think_49==0)||(i17.i0.u91....408
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 402 transition count 402
Applied a total of 196 rules in 17 ms. Remains 402 /500 variables (removed 98) and now considering 402/500 (removed 98) transitions.
// Phase 1: matrix 402 rows 402 cols
[2025-06-02 12:39:55] [INFO ] Computed 200 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:39:55] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-02 12:39:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:39:56] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:39:56] [INFO ] Redundant transitions in 2 ms returned []
Running 202 sub problems to find dead transitions.
[2025-06-02 12:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 100/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 100/402 variables, 100/502 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 100/602 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 402/804 variables, 402/1004 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/804 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 804/804 variables, and 1004 constraints, problems are : Problem set: 0 solved, 202 unsolved in 17249 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 302/302 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 100/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 100/402 variables, 100/502 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 100/602 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 402/804 variables, 402/1004 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/804 variables, 202/1206 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/804 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/804 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 804/804 variables, and 1206 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16963 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34230ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 34231ms
Starting structural reductions in SI_CTL mode, iteration 1 : 402/500 places, 402/500 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35014 ms. Remains : 402/500 places, 402/500 transitions.
[2025-06-02 12:40:30] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:40:30] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:40:30] [INFO ] Input system was already deterministic with 402 transitions.
[2025-06-02 12:40:30] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:40:30] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:40:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7187828876980798683.gal : 2 ms
[2025-06-02 12:40:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3842982293806091102.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/CTLFireability7187828876980798683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3842982293806091102.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,8.41714e+41,0.116692,7256,2,1610,5,7052,6,0,2013,4977,0


Converting to forward existential form...Done !
original formula: AF(((Fork_58==1)&&(Catch2_59==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((Fork_58==1)&&(Catch2_59==1))))] = FALSE
Hit Full ! (commute/partial/dont) 395/0/7
(forward)formula 0,0,1.22007,51332,1,0,8,335394,20,4,10425,22287,8
FORMULA Philosophers-PT-000100-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-02 12:40:31] [INFO ] Flatten gal took : 24 ms
[2025-06-02 12:40:31] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:40:31] [INFO ] Applying decomposition
[2025-06-02 12:40:31] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10278328143593641305.txt' '-o' '/tmp/graph10278328143593641305.bin' '-w' '/tmp/graph10278328143593641305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10278328143593641305.bin' '-l' '-1' '-v' '-w' '/tmp/graph10278328143593641305.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:40:31] [INFO ] Decomposing Gal with order
[2025-06-02 12:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:40:31] [INFO ] Removed a total of 100 redundant transitions.
[2025-06-02 12:40:31] [INFO ] Flatten gal took : 39 ms
[2025-06-02 12:40:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 15 ms.
[2025-06-02 12:40:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6223348943176124653.gal : 9 ms
[2025-06-02 12:40:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8941272127442825076.ctl : 9 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/CTLFireability6223348943176124653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8941272127442825076.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 3 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,5.15378e+47,0.120387,8544,491,31,4140,233,628,2984,68,395,0


Converting to forward existential form...Done !
original formula: AF((((((((A((((((((((i13.i1.u22.Fork_38==1)&&(i13.i1.u65.Catch2_39==1))||((i13.i2.u70.Fork_35==1)&&(i13.i0.u71.Catch2_36==1)))||(((i3.i0....10555
=> equivalent forward existential formula: [FwdG(Init,!((((((((!((E(!(((((((((i17.i1.u83.Eat_71==1)||(i1.i0.u2.Eat_10==1))||((i4.i1.u45.Eat_75==1)||(i10.i1...15683
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,231.24,2200656,1,0,4.40271e+06,526,1169,3.37842e+06,152,2675,416834
FORMULA Philosophers-PT-000100-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((A(((E(((((((((i17.i1.u83.Eat_71==1)||(i1.i0.u2.Eat_10==1))||((i4.i1.u45.Eat_75==1)||(i10.i1.u86.Eat_63==1)))||(((i0.i1.u14.Eat_2==1)|...104655
Detected timeout of ITS tools.
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((((((EX((((((((((i15.i1.u29.Think_43==1)&&(i15.i1.u29.Fork_43==1))||((i11.i1.u85.Think_62==...161540
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 13:07:34] [INFO ] Applying decomposition
[2025-06-02 13:07:34] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:07:34] [INFO ] Decomposing Gal with order
[2025-06-02 13:07:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 13:07:34] [INFO ] Removed a total of 200 redundant transitions.
[2025-06-02 13:07:34] [INFO ] Flatten gal took : 40 ms
[2025-06-02 13:07:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 13:07:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10979687437429282067.gal : 4 ms
[2025-06-02 13:07:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11904253871261235830.ctl : 5 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/CTLFireability10979687437429282067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11904253871261235830.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 2 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,5.15378e+47,0.265839,10872,1783,20,7024,637,1419,2994,30,452,0


Converting to forward existential form...Done !
original formula: EG((A(((E(((((((((u71.Eat_71==1)||(u9.Eat_10==1))||((u75.Eat_75==1)||(u63.Eat_63==1)))||(((u1.Eat_2==1)||(u67.Eat_67==1))||((u53.Eat_54==...80856
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((((((EX((((((((((u145.Think_43==1)&&(u43.Fork_43==1))||((u166.Think_62==1)&&(u62.Fork_62==1...126533
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="Philosophers-PT-000100"
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 Philosophers-PT-000100, 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-174881253400138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000100.tgz
mv Philosophers-PT-000100 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;