fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r210-smll-177969941900017
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for Philosophers-COL-000020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
547.771 92081.00 116843.00 491.20 FTTFTFTFFFFTTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r210-smll-177969941900017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is Philosophers-COL-000020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-177969941900017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.4K Mar 5 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 5 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 16 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 11K Mar 3 18:30 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-000020-CTLCardinality-2024-00
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-01
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-02
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-03
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-04
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-05
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-06
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-07
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-08
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-09
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-10
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-11
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-12
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-13
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-14
FORMULA_NAME Philosophers-COL-000020-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779782360317

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-26 07:59:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 07:59:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 07:59:22] [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.
[2026-05-26 07:59:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 07:59:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1176 ms
[2026-05-26 07:59:24] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 45 ms.
[2026-05-26 07:59:24] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2026-05-26 07:59:24] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40011 steps (1810 resets) in 1007 ms. (39 steps per ms) remains 74/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 87 ms. (45 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 91 ms. (43 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 100 ms. (39 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 90 ms. (44 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 111 ms. (35 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (9 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 113 ms. (35 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (20 resets) in 115 ms. (34 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 42 ms. (93 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (48 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7256141029276609970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1986780996204820410.kers'
[2026-05-26 07:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7256141029276609970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1986780996204820410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 15 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-26 07:59:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1986780996204820410.kers
Total runtime 1 ms.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
After SMT solving in domain Real declared 5/10 variables, and 2 constraints, problems are : Problem set: 74 solved, 0 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 74 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 74 atomic propositions for a total of 16 simplifications.
FORMULA Philosophers-COL-000020-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 07:59:26] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-26 07:59:26] [INFO ] Flatten gal took : 31 ms
[2026-05-26 07:59:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Philosophers-COL-000020-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000020-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 07:59:26] [INFO ] Flatten gal took : 5 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 20) 20) 20)]] contains successor/predecessor on variables of sort Philo
[2026-05-26 07:59:26] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions 320 arcs in 34 ms.
[2026-05-26 07:59:26] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6420159570867967503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14220828132636111138.kers'
[2026-05-26 07:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6420159570867967503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14220828132636111138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 100 cols 320 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-26 07:59:26] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14220828132636111138.kers
Total runtime 2 ms.
[2026-05-26 07:59:27] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-26 07:59:27] [INFO ] Invariant cache hit.
[2026-05-26 07:59:27] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2026-05-26 07:59:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4100 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 20/100 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 60/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4067 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8218ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8221ms
Finished structural reductions in LTL mode , in 1 iterations and 8690 ms. Remains : 100/100 places, 100/100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 07:59:35] [INFO ] Invariant cache hit.
[2026-05-26 07:59:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-26 07:59:35] [INFO ] Invariant cache hit.
[2026-05-26 07:59:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2026-05-26 07:59:35] [INFO ] Flatten gal took : 24 ms
[2026-05-26 07:59:35] [INFO ] Flatten gal took : 20 ms
[2026-05-26 07:59:35] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 40000 steps (71 resets) in 3990 ms. (10 steps per ms) remains 36/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
[2026-05-26 07:59:37] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 40/40 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 35 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 34/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/100 variables, 40/40 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 140 constraints, problems are : Problem set: 35 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 1/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 35 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 35 atomic propositions for a total of 7 simplifications.
[2026-05-26 07:59:37] [INFO ] Flatten gal took : 18 ms
[2026-05-26 07:59:37] [INFO ] Flatten gal took : 32 ms
[2026-05-26 07:59:37] [INFO ] Input system was already deterministic with 100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 07:59:37] [INFO ] Invariant cache hit.
[2026-05-26 07:59:38] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-26 07:59:38] [INFO ] Invariant cache hit.
[2026-05-26 07:59:38] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 07:59:38] [INFO ] Flatten gal took : 13 ms
[2026-05-26 07:59:38] [INFO ] Flatten gal took : 15 ms
[2026-05-26 07:59:38] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 07:59:38] [INFO ] Flatten gal took : 15 ms
[2026-05-26 07:59:38] [INFO ] Flatten gal took : 15 ms
[2026-05-26 07:59:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality14416212004853542642.gal : 5 ms
[2026-05-26 07:59:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12592548229157621919.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14416212004853542642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12592548229157621919.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.064628,4520,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: EF((EX(EF(((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+((Thi...1398
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),TRUE) * ((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_...1488
(forward)formula 0,1,5.39148,55320,1,0,7,2833,9,1,92948,1876,4
FORMULA Philosophers-COL-000020-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 07:59:43] [INFO ] Invariant cache hit.
[2026-05-26 07:59:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-26 07:59:44] [INFO ] Invariant cache hit.
[2026-05-26 07:59:44] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 07:59:44] [INFO ] Flatten gal took : 8 ms
[2026-05-26 07:59:44] [INFO ] Flatten gal took : 9 ms
[2026-05-26 07:59:44] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 07:59:44] [INFO ] Flatten gal took : 8 ms
[2026-05-26 07:59:44] [INFO ] Flatten gal took : 8 ms
[2026-05-26 07:59:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10762908387918909994.gal : 3 ms
[2026-05-26 07:59:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17805906795620735740.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10762908387918909994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17805906795620735740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.028006,4616,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: AX(AG(E(((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_7)))+(((Catch2_8+Catch2_9)+(Catch2_10+Catch2_...872
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(((((((Catch2_0+Catch2_1)+(Catch2_2+Catch2_3))+((Catch2_4+Catch2_5)+(Catch2_6+Catch2_...932
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 20/0/80
(forward)formula 0,1,20.6195,202076,1,0,8,78662,21,1,331323,66783,8
FORMULA Philosophers-COL-000020-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 08:00:05] [INFO ] Invariant cache hit.
[2026-05-26 08:00:05] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-26 08:00:05] [INFO ] Invariant cache hit.
[2026-05-26 08:00:05] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2026-05-26 08:00:05] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 250 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 08:00:05] [INFO ] Flatten gal took : 9 ms
[2026-05-26 08:00:05] [INFO ] Flatten gal took : 8 ms
[2026-05-26 08:00:05] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 08:00:05] [INFO ] Flatten gal took : 7 ms
[2026-05-26 08:00:05] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10705068304621022764.gal : 3 ms
[2026-05-26 08:00:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12450049032163646541.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10705068304621022764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12450049032163646541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.027304,4608,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: AG((AG(((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+((Think_...664
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !(((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+T...740
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,15.5193,161648,1,0,10,45734,18,3,269887,19484,8
FORMULA Philosophers-COL-000020-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 08:00:21] [INFO ] Invariant cache hit.
[2026-05-26 08:00:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-26 08:00:21] [INFO ] Invariant cache hit.
[2026-05-26 08:00:21] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2026-05-26 08:00:21] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 279 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 08:00:21] [INFO ] Flatten gal took : 7 ms
[2026-05-26 08:00:21] [INFO ] Flatten gal took : 7 ms
[2026-05-26 08:00:21] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 08:00:21] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:21] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16981534507252173942.gal : 2 ms
[2026-05-26 08:00:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6750838749074159377.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16981534507252173942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6750838749074159377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.039336,4620,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7)))+(((Think_8+Think_9)+(Think_10+Think_11))+((Thin...243
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U ((((((Think_0+Think_1)+(Think_2+Think_3))+((Think_4+Think_5)+(Think_6+Think_7...306
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.502194,13196,1,0,8,37058,18,5,5458,14059,12
FORMULA Philosophers-COL-000020-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 08:00:22] [INFO ] Invariant cache hit.
[2026-05-26 08:00:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-26 08:00:22] [INFO ] Invariant cache hit.
[2026-05-26 08:00:22] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 08:00:22] [INFO ] Flatten gal took : 10 ms
[2026-05-26 08:00:22] [INFO ] Flatten gal took : 10 ms
[2026-05-26 08:00:22] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 08:00:22] [INFO ] Flatten gal took : 11 ms
[2026-05-26 08:00:22] [INFO ] Flatten gal took : 10 ms
[2026-05-26 08:00:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality1266917620349544183.gal : 2 ms
[2026-05-26 08:00:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality14697948284522899146.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1266917620349544183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14697948284522899146.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.042309,4612,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: ((EF((((((((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_13)+(F...1280
=> equivalent forward existential formula: (([(Init * !(E(TRUE U (((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9...1383
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,15.8611,159336,1,0,10,46436,14,4,265199,19456,6
FORMULA Philosophers-COL-000020-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 08:00:38] [INFO ] Invariant cache hit.
[2026-05-26 08:00:38] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-26 08:00:38] [INFO ] Invariant cache hit.
[2026-05-26 08:00:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2026-05-26 08:00:38] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 262 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 08:00:38] [INFO ] Flatten gal took : 9 ms
[2026-05-26 08:00:38] [INFO ] Flatten gal took : 9 ms
[2026-05-26 08:00:38] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 08:00:38] [INFO ] Flatten gal took : 11 ms
[2026-05-26 08:00:38] [INFO ] Flatten gal took : 11 ms
[2026-05-26 08:00:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10896469258950760165.gal : 2 ms
[2026-05-26 08:00:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7807395207838852624.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10896469258950760165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7807395207838852624.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.044988,4612,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: EF(((AG((((((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+Eat_11))+((Eat_12+Eat_13)+(Eat_14+Eat...2122
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((((((Eat_0+Eat_1)+(Eat_2+Eat_3))+((Eat_4+Eat_5)+(Eat_6+Eat_7)))+(((Eat_8+Eat_9)+(Eat_10+E...2186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,12.7313,128584,1,0,11,67962,17,5,188433,44173,7
FORMULA Philosophers-COL-000020-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 08:00:51] [INFO ] Invariant cache hit.
[2026-05-26 08:00:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 08:00:51] [INFO ] Invariant cache hit.
[2026-05-26 08:00:52] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 100/100 places, 100/100 transitions.
[2026-05-26 08:00:52] [INFO ] Flatten gal took : 5 ms
[2026-05-26 08:00:52] [INFO ] Flatten gal took : 5 ms
[2026-05-26 08:00:52] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-26 08:00:52] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:52] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14162168803767121687.gal : 1 ms
[2026-05-26 08:00:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17255657806460715055.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14162168803767121687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17255657806460715055.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.026777,4620,2,506,5,2179,6,0,503,1612,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.107253,7888,1,0,7,26774,9,3,2225,3569,2
FORMULA Philosophers-COL-000020-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 08:00:52] [INFO ] Flatten gal took : 6 ms
[2026-05-26 08:00:52] [INFO ] Flatten gal took : 5 ms
Total runtime 89593 ms.

BK_STOP 1779782452398

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-000020"
export BK_EXAMINATION="CTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000020, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-177969941900017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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