Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253300051.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-COL-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253300051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 31K 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-COL-000500-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748845626041

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 06:27:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 06:27:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:27:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 06:27:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 06:27:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2025-06-02 06:27:07] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 06:27:08] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2025-06-02 06:27:08] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40159 steps (76 resets) in 96 ms. (414 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
// Phase 1: matrix 5 rows 5 cols
[2025-06-02 06:27:08] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 5/10 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-02 06:27:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-02 06:27:08] [INFO ] Flatten gal took : 14 ms
FORMULA Philosophers-COL-000500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 06:27:08] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2025-06-02 06:27:08] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 46 ms.
[2025-06-02 06:27:08] [INFO ] Unfolded 12 HLPN properties in 3 ms.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2025-06-02 06:27:08] [INFO ] Computed 1000 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:27:09] [INFO ] Implicit Places using invariants in 631 ms returned []
[2025-06-02 06:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:27:10] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:27:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60695ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in LTL mode , in 1 iterations and 62761 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2025-06-02 06:28:11] [INFO ] Flatten gal took : 218 ms
[2025-06-02 06:28:12] [INFO ] Flatten gal took : 131 ms
[2025-06-02 06:28:12] [INFO ] Input system was already deterministic with 2500 transitions.
RANDOM walk for 40000 steps (8 resets) in 5632 ms. (7 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1616 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1600 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1605 ms. (24 steps per ms) remains 3/3 properties
[2025-06-02 06:28:15] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2825 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4839ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 3 properties in 64 ms. (steps per millisecond=7 )
Parikh walk visited 3 properties in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 176 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:28:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:28:21] [INFO ] Implicit Places using invariants in 928 ms returned []
[2025-06-02 06:28:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:28:24] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 3012 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:28:24] [INFO ] Redundant transitions in 115 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:28: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 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 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60547ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63867 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-00
Product exploration timeout after 69090 steps with 150 reset in 10002 ms.
Product exploration timeout after 67980 steps with 147 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 1915 steps (0 resets) in 381 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2025-06-02 06:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:30:48] [INFO ] [Real]Absence check using 1000 positive place invariants in 1355 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 89 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:30:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:30:49] [INFO ] Implicit Places using invariants in 928 ms returned []
[2025-06-02 06:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:30:51] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:30:51] [INFO ] Redundant transitions in 56 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63546 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 1829 steps (0 resets) in 412 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2025-06-02 06:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:32:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 1783 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration timeout after 70170 steps with 153 reset in 10001 ms.
Product exploration timeout after 68590 steps with 149 reset in 10001 ms.
Built C files in :
/tmp/ltsmin8440474145163262825
[2025-06-02 06:33:14] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2025-06-02 06:33:14] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8440474145163262825
Running compilation step : cd /tmp/ltsmin8440474145163262825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8440474145163262825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8440474145163262825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:33:18] [INFO ] Implicit Places using invariants in 900 ms returned []
[2025-06-02 06:33:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:33:20] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:33:20] [INFO ] Redundant transitions in 144 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60453ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63571 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin15770501728122526076
[2025-06-02 06:34:20] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2025-06-02 06:34:20] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15770501728122526076
Running compilation step : cd /tmp/ltsmin15770501728122526076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15770501728122526076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15770501728122526076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 06:34:24] [INFO ] Flatten gal took : 84 ms
[2025-06-02 06:34:24] [INFO ] Flatten gal took : 80 ms
[2025-06-02 06:34:24] [INFO ] Time to serialize gal into /tmp/LTL8229989326677194621.gal : 21 ms
[2025-06-02 06:34:24] [INFO ] Time to serialize properties into /tmp/LTL365518098337023305.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8229989326677194621.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11234717971781180248.hoa' '-atoms' '/tmp/LTL365518098337023305.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL365518098337023305.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11234717971781180248.hoa
Detected timeout of ITS tools.
[2025-06-02 06:34:39] [INFO ] Flatten gal took : 75 ms
[2025-06-02 06:34:39] [INFO ] Flatten gal took : 70 ms
[2025-06-02 06:34:39] [INFO ] Time to serialize gal into /tmp/LTL5333916494432908688.gal : 14 ms
[2025-06-02 06:34:39] [INFO ] Time to serialize properties into /tmp/LTL10661785078898802286.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5333916494432908688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10661785078898802286.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+Fork...11809
Formula 0 simplified : G!"((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+Fork_...11805
Detected timeout of ITS tools.
[2025-06-02 06:34:54] [INFO ] Flatten gal took : 64 ms
[2025-06-02 06:34:54] [INFO ] Applying decomposition
[2025-06-02 06:34:54] [INFO ] Flatten gal took : 72 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/graph1240010365652423510.txt' '-o' '/tmp/graph1240010365652423510.bin' '-w' '/tmp/graph1240010365652423510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1240010365652423510.bin' '-l' '-1' '-v' '-w' '/tmp/graph1240010365652423510.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:34:56] [INFO ] Decomposing Gal with order
[2025-06-02 06:34:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:34:57] [INFO ] Removed a total of 500 redundant transitions.
[2025-06-02 06:34:58] [INFO ] Flatten gal took : 1798 ms
[2025-06-02 06:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2025-06-02 06:34:58] [INFO ] Time to serialize gal into /tmp/LTL4829226771571211987.gal : 25 ms
[2025-06-02 06:34:58] [INFO ] Time to serialize properties into /tmp/LTL11746917519141969524.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4829226771571211987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11746917519141969524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((gu500.Fork_0+gu500.Fork_1)+(gu500.Fork_2+gu500.Fork_3))+((gu500.Fork_4+gu500.Fork_5)+(gu500.Fork_6+gu500.Fork_7)))+(((...17809
Formula 0 simplified : G!"((((((((((gu500.Fork_0+gu500.Fork_1)+(gu500.Fork_2+gu500.Fork_3))+((gu500.Fork_4+gu500.Fork_5)+(gu500.Fork_6+gu500.Fork_7)))+(((g...17805
Detected timeout of ITS tools.
Treatment of property Philosophers-COL-000500-LTLCardinality-00 finished in 412728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&(p0 U p1)) U X(X(p2))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 22 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:35:14] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-06-02 06:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:35:15] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60506ms
Finished structural reductions in LTL mode , in 1 iterations and 62873 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 629 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03
Product exploration timeout after 36870 steps with 12290 reset in 10003 ms.
Product exploration timeout after 36630 steps with 12210 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 26 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 425664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 32 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:42:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:42:20] [INFO ] Implicit Places using invariants in 826 ms returned []
[2025-06-02 06:42:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:42:22] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:42:22] [INFO ] Redundant transitions in 57 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:42: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63417 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-04
Product exploration timeout after 88090 steps with 128 reset in 10001 ms.
Stack based approach found an accepted trace after 34613 steps with 49 reset with depth 46 and stack size 46 in 4030 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-04 finished in 77555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((p0 U p1)||X(p1)))||(X(((p0 U p1)||X(p1)))&&F(p2)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:43:37] [INFO ] Implicit Places using invariants in 825 ms returned []
[2025-06-02 06:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:43:39] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 63192 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-05
Product exploration timeout after 52360 steps with 482 reset in 10001 ms.
Product exploration timeout after 51310 steps with 507 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 3669 ms. (10 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4770 ms. (8 steps per ms) remains 1/1 properties
[2025-06-02 06:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3098ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 66 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 67 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 601 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
[2025-06-02 06:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:47:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 1296 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 13 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:47:07] [INFO ] Implicit Places using invariants in 832 ms returned []
[2025-06-02 06:47:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:47:09] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60435ms
Finished structural reductions in LTL mode , in 1 iterations and 63263 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 3137 ms. (12 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3642 ms. (10 steps per ms) remains 1/1 properties
[2025-06-02 06:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1000/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3228ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 499 steps, including 0 resets, run visited all 1 properties in 71 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 71 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (NOT (OR p2 p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 587 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
[2025-06-02 06:50:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:50:15] [INFO ] [Real]Absence check using 1000 positive place invariants in 1348 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration timeout after 52590 steps with 327 reset in 10002 ms.
Product exploration timeout after 51730 steps with 362 reset in 10001 ms.
Built C files in :
/tmp/ltsmin7168352640418228671
[2025-06-02 06:50:36] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7168352640418228671
Running compilation step : cd /tmp/ltsmin7168352640418228671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7168352640418228671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7168352640418228671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 12 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:50:39] [INFO ] Implicit Places using invariants in 815 ms returned []
[2025-06-02 06:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:50:41] [INFO ] Implicit Places using invariants and state equation in 1971 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:50: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Finished structural reductions in LTL mode , in 1 iterations and 63215 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin15085711444633195217
[2025-06-02 06:51:42] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15085711444633195217
Running compilation step : cd /tmp/ltsmin15085711444633195217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15085711444633195217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15085711444633195217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 06:51:45] [INFO ] Flatten gal took : 103 ms
[2025-06-02 06:51:45] [INFO ] Flatten gal took : 101 ms
[2025-06-02 06:51:45] [INFO ] Time to serialize gal into /tmp/LTL13493511663822928001.gal : 11 ms
[2025-06-02 06:51:45] [INFO ] Time to serialize properties into /tmp/LTL8964054474220775977.prop : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13493511663822928001.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7726384901934280297.hoa' '-atoms' '/tmp/LTL8964054474220775977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8964054474220775977.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7726384901934280297.hoa
Detected timeout of ITS tools.
[2025-06-02 06:52:01] [INFO ] Flatten gal took : 62 ms
[2025-06-02 06:52:01] [INFO ] Flatten gal took : 63 ms
[2025-06-02 06:52:01] [INFO ] Time to serialize gal into /tmp/LTL3551839569131013458.gal : 11 ms
[2025-06-02 06:52:01] [INFO ] Time to serialize properties into /tmp/LTL13855431641655762132.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3551839569131013458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13855431641655762132.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G((("((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12...79037
Formula 0 simplified : G(F((!"((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+F...79025
Detected timeout of ITS tools.
[2025-06-02 06:52:16] [INFO ] Flatten gal took : 59 ms
[2025-06-02 06:52:16] [INFO ] Applying decomposition
[2025-06-02 06:52:16] [INFO ] Flatten gal took : 58 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/graph4214214486898865582.txt' '-o' '/tmp/graph4214214486898865582.bin' '-w' '/tmp/graph4214214486898865582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4214214486898865582.bin' '-l' '-1' '-v' '-w' '/tmp/graph4214214486898865582.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:52:23] [INFO ] Decomposing Gal with order
[2025-06-02 06:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:52:25] [INFO ] Removed a total of 2000 redundant transitions.
[2025-06-02 06:52:25] [INFO ] Flatten gal took : 1921 ms
[2025-06-02 06:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2025-06-02 06:52:26] [INFO ] Time to serialize gal into /tmp/LTL5883467136757363229.gal : 22 ms
[2025-06-02 06:52:26] [INFO ] Time to serialize properties into /tmp/LTL16985711094633936870.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5883467136757363229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16985711094633936870.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G((("((((((((((gu243.Fork_0+gu243.Fork_1)+(gu243.Fork_2+gu243.Fork_3))+((gu243.Fork_4+gu243.Fork_5)+(gu243.Fork_6+gu243.Fork_7))...127037
Formula 0 simplified : G(F((!"((((((((((gu243.Fork_0+gu243.Fork_1)+(gu243.Fork_2+gu243.Fork_3))+((gu243.Fork_4+gu243.Fork_5)+(gu243.Fork_6+gu243.Fork_7)))+...127025
Detected timeout of ITS tools.
Treatment of property Philosophers-COL-000500-LTLCardinality-05 finished in 544786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 227 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:52:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:52:42] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2025-06-02 06:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:52:45] [INFO ] Implicit Places using invariants and state equation in 2265 ms returned []
Implicit Place search using SMT with State Equation took 3319 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:52:45] [INFO ] Redundant transitions in 56 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60485ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64095 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 3124 ms.
Stack based approach found an accepted trace after 38306 steps with 0 reset with depth 38307 and stack size 38272 in 1421 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-06 finished in 68699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:53:51] [INFO ] Implicit Places using invariants in 810 ms returned []
[2025-06-02 06:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:53:53] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2750 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:53:53] [INFO ] Redundant transitions in 51 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 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 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63268 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-07
Product exploration explored 100000 steps with 2 reset in 6649 ms.
Product exploration explored 100000 steps with 1 reset in 6425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 1954 steps (0 resets) in 407 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2025-06-02 06:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (NOT p0)
[2025-06-02 06:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG p1
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 38 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:56:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:37] [INFO ] Implicit Places using invariants in 896 ms returned []
[2025-06-02 06:56:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:56:40] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:56:40] [INFO ] Redundant transitions in 54 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Error getting values : (error "ParserException while parsing response: ((s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 1)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 timeout
0)
(s1156 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63565 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) p1), (NOT p0), p1]
RANDOM walk for 1775 steps (0 resets) in 428 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p1), (NOT p0), p1]
[2025-06-02 06:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:831)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-02 06:58:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2025-06-02 06:58:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 06:59:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 698 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 0 reset in 5967 ms.
Product exploration explored 100000 steps with 3 reset in 6158 ms.
Built C files in :
/tmp/ltsmin7858894796534161710
[2025-06-02 06:59:24] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2025-06-02 06:59:24] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7858894796534161710
Running compilation step : cd /tmp/ltsmin7858894796534161710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7858894796534161710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7858894796534161710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 34 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 06:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:59:28] [INFO ] Implicit Places using invariants in 888 ms returned []
[2025-06-02 06:59:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:59:30] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 3068 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:59:30] [INFO ] Redundant transitions in 56 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 06:59: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63579 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin4797942671344978938
[2025-06-02 07:00:30] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2025-06-02 07:00:30] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4797942671344978938
Running compilation step : cd /tmp/ltsmin4797942671344978938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4797942671344978938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4797942671344978938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 07:00:33] [INFO ] Flatten gal took : 55 ms
[2025-06-02 07:00:34] [INFO ] Flatten gal took : 57 ms
[2025-06-02 07:00:34] [INFO ] Time to serialize gal into /tmp/LTL26393952068554614.gal : 10 ms
[2025-06-02 07:00:34] [INFO ] Time to serialize properties into /tmp/LTL1783189967190241167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL26393952068554614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7238386149140768473.hoa' '-atoms' '/tmp/LTL1783189967190241167.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL1783189967190241167.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7238386149140768473.hoa
Detected timeout of ITS tools.
[2025-06-02 07:00:49] [INFO ] Flatten gal took : 57 ms
[2025-06-02 07:00:49] [INFO ] Flatten gal took : 59 ms
[2025-06-02 07:00:49] [INFO ] Time to serialize gal into /tmp/LTL14546092492311865166.gal : 13 ms
[2025-06-02 07:00:49] [INFO ] Time to serialize properties into /tmp/LTL2865871412699163413.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14546092492311865166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2865871412699163413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_1...29998
Formula 0 simplified : F(G!"(((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_10+...29988
Detected timeout of ITS tools.
[2025-06-02 07:01:04] [INFO ] Flatten gal took : 62 ms
[2025-06-02 07:01:04] [INFO ] Applying decomposition
[2025-06-02 07:01:04] [INFO ] Flatten gal took : 54 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/graph13722496366793104583.txt' '-o' '/tmp/graph13722496366793104583.bin' '-w' '/tmp/graph13722496366793104583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13722496366793104583.bin' '-l' '-1' '-v' '-w' '/tmp/graph13722496366793104583.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:01:06] [INFO ] Decomposing Gal with order
[2025-06-02 07:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:01:08] [INFO ] Removed a total of 1434 redundant transitions.
[2025-06-02 07:01:08] [INFO ] Flatten gal took : 1207 ms
[2025-06-02 07:01:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2025-06-02 07:01:08] [INFO ] Time to serialize gal into /tmp/LTL12108186351771934905.gal : 18 ms
[2025-06-02 07:01:08] [INFO ] Time to serialize properties into /tmp/LTL10042664709369800540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12108186351771934905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10042664709369800540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu245.Catch1_0+gu245.Catch1_1)+(gu245.Catch1_2+gu245.Catch1_3))+((gu245.Catch1_4+gu245.Catch1_5)+(gu245.Catch1_6+g...50998
Formula 0 simplified : F(G!"(((((((((((gu245.Catch1_0+gu245.Catch1_1)+(gu245.Catch1_2+gu245.Catch1_3))+((gu245.Catch1_4+gu245.Catch1_5)+(gu245.Catch1_6+gu2...50988
Detected timeout of ITS tools.
Treatment of property Philosophers-COL-000500-LTLCardinality-07 finished in 453177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p0)&&(F(G(p1)) U p2))) U X(!p1))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:24] [INFO ] Implicit Places using invariants in 783 ms returned []
[2025-06-02 07:01:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:01:26] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2643 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:01: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in LTL mode , in 1 iterations and 63152 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 314 ms :[p1, p1, p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-08
Product exploration timeout after 88950 steps with 520 reset in 10001 ms.
Stack based approach found an accepted trace after 45531 steps with 271 reset with depth 755 and stack size 755 in 5306 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-08 finished in 78821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(p1&&X((!p0&&F(G(p1))))))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:42] [INFO ] Implicit Places using invariants in 604 ms returned []
[2025-06-02 07:02:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:02:44] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:02:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in LTL mode , in 1 iterations and 62587 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 104 ms :[p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-10
Product exploration timeout after 74620 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 4883 steps with 0 reset with depth 4884 and stack size 4884 in 697 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-10 finished in 73424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&X(G(p0)))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:03:56] [INFO ] Implicit Places using invariants in 585 ms returned []
[2025-06-02 07:03:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:03:57] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 62588 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-11 finished in 62770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||X((F(p1)||X(X(G(p2)))))))))))'
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 10 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:04:58] [INFO ] Implicit Places using invariants in 451 ms returned []
[2025-06-02 07:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:05:00] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 62198 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12
Product exploration timeout after 76910 steps with 12656 reset in 10002 ms.
Product exploration timeout after 74450 steps with 12256 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 3593 ms. (11 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2411 ms. (16 steps per ms) remains 1/1 properties
[2025-06-02 07:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2924ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 28 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
[2025-06-02 07:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 5 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:06:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:43] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-06-02 07:06:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:44] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:06:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Finished structural reductions in LTL mode , in 1 iterations and 62151 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 3700 ms. (10 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2848 ms. (14 steps per ms) remains 1/1 properties
[2025-06-02 07:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2924ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 9 states, 10 edges and 3 AP (stutter sensitive) to 9 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
[2025-06-02 07:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration timeout after 77260 steps with 12706 reset in 10001 ms.
Product exploration timeout after 74500 steps with 12261 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 16 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:08:27] [INFO ] Redundant transitions in 58 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60562 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin354629123451469226
[2025-06-02 07:09:27] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin354629123451469226
Running compilation step : cd /tmp/ltsmin354629123451469226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin354629123451469226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin354629123451469226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 5 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:09:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:31] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-02 07:09:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:32] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 62075 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin15216006196176866802
[2025-06-02 07:10:33] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15216006196176866802
Running compilation step : cd /tmp/ltsmin15216006196176866802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15216006196176866802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15216006196176866802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 07:10:36] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:10:36] [INFO ] Flatten gal took : 52 ms
[2025-06-02 07:10:36] [INFO ] Time to serialize gal into /tmp/LTL14079887523223862943.gal : 9 ms
[2025-06-02 07:10:36] [INFO ] Time to serialize properties into /tmp/LTL1821930821336206692.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14079887523223862943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15861702486519079086.hoa' '-atoms' '/tmp/LTL1821930821336206692.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1821930821336206692.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15861702486519079086.hoa
Detected timeout of ITS tools.
[2025-06-02 07:10:51] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:10:51] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:10:51] [INFO ] Time to serialize gal into /tmp/LTL8336461164756691539.gal : 9 ms
[2025-06-02 07:10:51] [INFO ] Time to serialize properties into /tmp/LTL13765139319743079663.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8336461164756691539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13765139319743079663.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(("((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch...35402
Formula 0 simplified : XXXX(!"((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_10...35382
Detected timeout of ITS tools.
[2025-06-02 07:11:06] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:11:06] [INFO ] Applying decomposition
[2025-06-02 07:11:06] [INFO ] Flatten gal took : 51 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/graph3935317070258342242.txt' '-o' '/tmp/graph3935317070258342242.bin' '-w' '/tmp/graph3935317070258342242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3935317070258342242.bin' '-l' '-1' '-v' '-w' '/tmp/graph3935317070258342242.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:11:09] [INFO ] Decomposing Gal with order
[2025-06-02 07:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:11:12] [INFO ] Removed a total of 1000 redundant transitions.
[2025-06-02 07:11:13] [INFO ] Flatten gal took : 3442 ms
[2025-06-02 07:11:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-02 07:11:13] [INFO ] Time to serialize gal into /tmp/LTL910468653788510445.gal : 20 ms
[2025-06-02 07:11:13] [INFO ] Time to serialize properties into /tmp/LTL18263463512532087568.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL910468653788510445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18263463512532087568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(("((((((((((gi1.gu2.Catch1_0+gi1.gu2.Catch1_1)+(gi1.gu2.Catch1_2+gi1.gu2.Catch1_3))+((gi1.gu2.Catch1_4+gi1.gu2.Catch1_5)+(g...55402
Formula 0 simplified : XXXX(!"((((((((((gi1.gu2.Catch1_0+gi1.gu2.Catch1_1)+(gi1.gu2.Catch1_2+gi1.gu2.Catch1_3))+((gi1.gu2.Catch1_4+gi1.gu2.Catch1_5)+(gi1.g...55382
Detected timeout of ITS tools.
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 390156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 13 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:11:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:29] [INFO ] Implicit Places using invariants in 649 ms returned []
[2025-06-02 07:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:30] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:11: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Finished structural reductions in LTL mode , in 1 iterations and 62690 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-13
Product exploration timeout after 74610 steps with 37305 reset in 10001 ms.
Product exploration timeout after 75260 steps with 37630 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000500-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-13 finished in 184639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(G(p1)&&X(p2)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:34] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2025-06-02 07:14:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:36] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Finished structural reductions in LTL mode , in 1 iterations and 63961 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-14
Product exploration timeout after 80560 steps with 20140 reset in 10001 ms.
Product exploration timeout after 78080 steps with 19520 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8 resets) in 2082 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1189 ms. (33 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84471 steps, run timeout after 3033 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 84471 steps, saw 84262 distinct states, run finished after 3037 ms. (steps per millisecond=27 ) properties seen :0
[2025-06-02 07:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1571 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2859ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 41 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 500 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 24 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:52] [INFO ] Implicit Places using invariants in 1137 ms returned []
[2025-06-02 07:16:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:55] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3686 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:16:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Finished structural reductions in LTL mode , in 1 iterations and 64238 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8 resets) in 2113 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1212 ms. (32 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 83480 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 83480 steps, saw 83272 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2025-06-02 07:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1500/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2000 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 500/2500 variables, 500/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2867ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 44 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration timeout after 83280 steps with 20820 reset in 10001 ms.
Product exploration timeout after 80160 steps with 20040 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 240 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:18:23] [INFO ] Redundant transitions in 51 ms returned []
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:18:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60751 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin3053118615661665238
[2025-06-02 07:19:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3053118615661665238
Running compilation step : cd /tmp/ltsmin3053118615661665238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3053118615661665238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3053118615661665238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2025-06-02 07:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:28] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2025-06-02 07:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:30] [INFO ] Implicit Places using invariants and state equation in 2411 ms returned []
Implicit Place search using SMT with State Equation took 3499 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2025-06-02 07:19: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/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in LTL mode , in 1 iterations and 63993 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin1011466061750524653
[2025-06-02 07:20:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1011466061750524653
Running compilation step : cd /tmp/ltsmin1011466061750524653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1011466061750524653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1011466061750524653;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 07:20:34] [INFO ] Flatten gal took : 50 ms
[2025-06-02 07:20:34] [INFO ] Flatten gal took : 50 ms
[2025-06-02 07:20:34] [INFO ] Time to serialize gal into /tmp/LTL13735619622733985200.gal : 9 ms
[2025-06-02 07:20:34] [INFO ] Time to serialize properties into /tmp/LTL15067628474661055468.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13735619622733985200.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18273048192900639559.hoa' '-atoms' '/tmp/LTL15067628474661055468.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15067628474661055468.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18273048192900639559.hoa
Detected timeout of ITS tools.
[2025-06-02 07:20:49] [INFO ] Flatten gal took : 52 ms
[2025-06-02 07:20:49] [INFO ] Flatten gal took : 55 ms
[2025-06-02 07:20:49] [INFO ] Time to serialize gal into /tmp/LTL6145385772064418416.gal : 9 ms
[2025-06-02 07:20:49] [INFO ] Time to serialize properties into /tmp/LTL11227758798475887164.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6145385772064418416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11227758798475887164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X("((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11...21630
Formula 0 simplified : X(XX!"((((((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+...21618
Detected timeout of ITS tools.
[2025-06-02 07:21:04] [INFO ] Flatten gal took : 56 ms
[2025-06-02 07:21:04] [INFO ] Applying decomposition
[2025-06-02 07:21:05] [INFO ] Flatten gal took : 53 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/graph3780176285855713901.txt' '-o' '/tmp/graph3780176285855713901.bin' '-w' '/tmp/graph3780176285855713901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3780176285855713901.bin' '-l' '-1' '-v' '-w' '/tmp/graph3780176285855713901.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:21:05] [INFO ] Decomposing Gal with order
[2025-06-02 07:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:21:07] [INFO ] Removed a total of 1663 redundant transitions.
[2025-06-02 07:21:07] [INFO ] Flatten gal took : 1194 ms
[2025-06-02 07:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 52 ms.
[2025-06-02 07:21:07] [INFO ] Time to serialize gal into /tmp/LTL9196785638868023620.gal : 18 ms
[2025-06-02 07:21:07] [INFO ] Time to serialize properties into /tmp/LTL17217655588620739087.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9196785638868023620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17217655588620739087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X("((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0...37630
Formula 0 simplified : X(XX!"((((((((((gu0.Think_0+gu0.Think_1)+(gu0.Think_2+gu0.Think_3))+((gu0.Think_4+gu0.Think_5)+(gu0.Think_6+gu0.Think_7)))+(((gu0.Th...37618
Detected timeout of ITS tools.
Treatment of property Philosophers-COL-000500-LTLCardinality-14 finished in 409395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((p0 U p1)||X(p1)))||(X(((p0 U p1)||X(p1)))&&F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0||X((F(p1)||X(X(G(p2)))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||(G(p1)&&X(p2)))))'
[2025-06-02 07:21:23] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5602251014016284867
[2025-06-02 07:21:23] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2025-06-02 07:21:23] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5602251014016284867
Running compilation step : cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 07:21:23] [INFO ] Applying decomposition
[2025-06-02 07:21:23] [INFO ] Flatten gal took : 60 ms
Compilation finished in 6940 ms.
Running link step : cd /tmp/ltsmin5602251014016284867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
[2025-06-02 07:21:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14396072616141070338.txt' '-o' '/tmp/graph14396072616141070338.bin' '-w' '/tmp/graph14396072616141070338.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-02 07:21:38] [INFO ] Flatten gal took : 344 ms
[2025-06-02 07:21:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality15143562737762812479.gal : 121 ms
[2025-06-02 07:21:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality4001636955728422340.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15143562737762812479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4001636955728422340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 5 LTL properties
Checking formula 0 : !((F("((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+Fork...11809
Formula 0 simplified : G!"((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+Fork_...11805
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((((LTLAPp1==true) U (LTLAPp2==true))||X((LTLAPp2==true))))||(X((((LTLAPp1==true) U (LTLAPp2==true))||X((LTLAPp2==true))))&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 2793 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp4==true))&&<>([](!(LTLAPp5==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp4==true))&&<>([](!(LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5602251014016284867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(X(((LTLAPp6==true)||X((<>((LTLAPp3==true))||X(X([]((LTLAPp7==true)))))))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253300051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;