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.r066-tall-177946967700362.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 CO4-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 132K 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 CO4-PT-11-CTLFireability-2024-00
FORMULA_NAME CO4-PT-11-CTLFireability-2024-01
FORMULA_NAME CO4-PT-11-CTLFireability-2024-02
FORMULA_NAME CO4-PT-11-CTLFireability-2024-03
FORMULA_NAME CO4-PT-11-CTLFireability-2024-04
FORMULA_NAME CO4-PT-11-CTLFireability-2024-05
FORMULA_NAME CO4-PT-11-CTLFireability-2024-06
FORMULA_NAME CO4-PT-11-CTLFireability-2024-07
FORMULA_NAME CO4-PT-11-CTLFireability-2024-08
FORMULA_NAME CO4-PT-11-CTLFireability-2024-09
FORMULA_NAME CO4-PT-11-CTLFireability-2024-10
FORMULA_NAME CO4-PT-11-CTLFireability-2024-11
FORMULA_NAME CO4-PT-11-CTLFireability-2024-12
FORMULA_NAME CO4-PT-11-CTLFireability-2024-13
FORMULA_NAME CO4-PT-11-CTLFireability-2024-14
FORMULA_NAME CO4-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779522675038

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 07:51:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 07:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:51:16] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-23 07:51:16] [INFO ] Transformed 545 places.
[2026-05-23 07:51:16] [INFO ] Transformed 617 transitions.
[2026-05-23 07:51:16] [INFO ] Found NUPN structural information;
[2026-05-23 07:51:16] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-11-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 68 place count 323 transition count 384
Iterating global reduction 1 with 53 rules applied. Total rules applied 121 place count 323 transition count 384
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 158 place count 286 transition count 347
Iterating global reduction 1 with 37 rules applied. Total rules applied 195 place count 286 transition count 347
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 197 place count 286 transition count 345
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 210 place count 273 transition count 332
Iterating global reduction 2 with 13 rules applied. Total rules applied 223 place count 273 transition count 332
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 230 place count 266 transition count 325
Iterating global reduction 2 with 7 rules applied. Total rules applied 237 place count 266 transition count 325
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 239 place count 264 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 264 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 263 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 263 transition count 322
Applied a total of 243 rules in 107 ms. Remains 263 /388 variables (removed 125) and now considering 322/440 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1676401019720710725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5960054372705226117.kers'
[2026-05-23 07:51:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1676401019720710725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5960054372705226117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 263 cols 722 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-23 07:51:16] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5960054372705226117.kers
Total runtime 3 ms.
[2026-05-23 07:51:16] [INFO ] Implicit Places using invariants in 256 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 262/388 places, 322/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 262 /262 variables (removed 0) and now considering 322/322 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 409 ms. Remains : 262/388 places, 322/440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 262 /262 variables (removed 0) and now considering 322/322 (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-17484841197871609154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17205150538385835303.kers'
[2026-05-23 07:51:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17484841197871609154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17205150538385835303.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 262 cols 720 entries
Finished phase 1 with 259 SingleSign rule and 0 generalized
[2026-05-23 07:51:16] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17205150538385835303.kers
Total runtime 1 ms.
[2026-05-23 07:51:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 07:51:16] [INFO ] Invariant cache hit.
[2026-05-23 07:51:17] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2026-05-23 07:51:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 322/584 variables, 262/265 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/584 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 267 constraints, problems are : Problem set: 0 solved, 321 unsolved in 25335 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/584 variables, 262/267 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 321/588 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 589 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55444ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 55457ms
Finished structural reductions in LTL mode , in 1 iterations and 55814 ms. Remains : 262/262 places, 322/322 transitions.
Support contains 69 out of 262 places after structural reductions.
[2026-05-23 07:52:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 42 ms
FORMULA CO4-PT-11-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 16 ms
[2026-05-23 07:52:12] [INFO ] Input system was already deterministic with 322 transitions.
Support contains 58 out of 262 places (down from 69) after GAL structural reductions.
FORMULA CO4-PT-11-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (56 resets) in 1513 ms. (26 steps per ms) remains 36/45 properties
BEST_FIRST walk for 4002 steps (33 resets) in 23 ms. (166 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4000 steps (22 resets) in 37 ms. (105 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (21 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (24 resets) in 55 ms. (71 steps per ms) remains 30/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 36 ms. (108 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4002 steps (32 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (26 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (16 resets) in 22 ms. (173 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (44 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (22 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (16 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (29 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (23 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (37 resets) in 16 ms. (235 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (40 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (24 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (25 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (17 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (18 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (30 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
[2026-05-23 07:52:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 10/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 16/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 134/195 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 201/396 variables, 93/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 131/527 variables, 71/228 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 43/570 variables, 27/255 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 13/583 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 15 (OVERLAPS) 1/584 variables, 1/265 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/584 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/584 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 584/584 variables, and 265 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 10/43 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 16/59 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 130/189 variables, 59/62 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 4/66 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 200/389 variables, 92/158 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 18/176 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 135/524 variables, 72/249 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 46/570 variables, 29/278 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/570 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 13/583 variables, 9/287 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 18 (OVERLAPS) 1/584 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/584 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/584 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 584/584 variables, and 288 constraints, problems are : Problem set: 4 solved, 19 unsolved in 4476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6281ms problems are : Problem set: 4 solved, 19 unsolved
Parikh walk visited 17 properties in 4887 ms.
Support contains 4 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 260 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 401 edges and 260 vertex of which 243 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 243 transition count 178
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 115 rules applied. Total rules applied 244 place count 132 transition count 174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 247 place count 129 transition count 174
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 247 place count 129 transition count 158
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 279 place count 113 transition count 158
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 291 place count 101 transition count 146
Iterating global reduction 3 with 12 rules applied. Total rules applied 303 place count 101 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 101 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 304 place count 101 transition count 141
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 312 place count 97 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 317 place count 92 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 322 place count 92 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 323 place count 92 transition count 135
Performed 37 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 397 place count 55 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 401 place count 55 transition count 85
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 405 place count 51 transition count 81
Iterating global reduction 6 with 4 rules applied. Total rules applied 409 place count 51 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 413 place count 49 transition count 79
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 433 place count 39 transition count 80
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 440 place count 39 transition count 73
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 449 place count 30 transition count 55
Iterating global reduction 7 with 9 rules applied. Total rules applied 458 place count 30 transition count 55
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 465 place count 30 transition count 48
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 467 place count 28 transition count 42
Iterating global reduction 8 with 2 rules applied. Total rules applied 469 place count 28 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 470 place count 28 transition count 41
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 472 place count 28 transition count 39
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 475 place count 26 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 476 place count 26 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 477 place count 25 transition count 37
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 480 place count 23 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 481 place count 22 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 483 place count 21 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 488 place count 21 transition count 30
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 491 place count 18 transition count 27
Iterating global reduction 12 with 3 rules applied. Total rules applied 494 place count 18 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 496 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 497 place count 17 transition count 24
Iterating global reduction 13 with 1 rules applied. Total rules applied 498 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 499 place count 17 transition count 23
Free-agglomeration rule applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 501 place count 17 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 503 place count 15 transition count 21
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 506 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 507 place count 15 transition count 20
Applied a total of 507 rules in 56 ms. Remains 15 /262 variables (removed 247) and now considering 20/322 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 15/262 places, 20/322 transitions.
RANDOM walk for 854 steps (80 resets) in 7 ms. (106 steps per ms) remains 0/2 properties
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2026-05-23 07:52:24] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:52:24] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:52:25] [INFO ] Input system was already deterministic with 322 transitions.
Computed a total of 19 stabilizing places and 22 stable transitions
Graph (complete) has 404 edges and 262 vertex of which 253 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 295
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 237 transition count 293
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 221 transition count 277
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 221 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 221 transition count 275
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 217 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 217 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 217 transition count 270
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 215 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 215 transition count 268
Applied a total of 99 rules in 14 ms. Remains 215 /262 variables (removed 47) and now considering 268/322 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12354690865216358001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4026750732367952140.kers'
[2026-05-23 07:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12354690865216358001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4026750732367952140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 215 cols 604 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:52:25] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4026750732367952140.kers
Total runtime 2 ms.
[2026-05-23 07:52:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 07:52:25] [INFO ] Invariant cache hit.
[2026-05-23 07:52:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:52:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/483 variables, 215/218 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/483 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 220 constraints, problems are : Problem set: 0 solved, 267 unsolved in 17058 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/483 variables, 215/220 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 267/487 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/483 variables, and 488 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47110ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 47111ms
Starting structural reductions in LTL mode, iteration 1 : 215/262 places, 268/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47301 ms. Remains : 215/262 places, 268/322 transitions.
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:53:12] [INFO ] Input system was already deterministic with 268 transitions.
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7213729749522669375.gal : 4 ms
[2026-05-23 07:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10162138587212736121.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/CTLFireability7213729749522669375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10162138587212736121.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,494980,0.186944,11080,2,1419,5,23830,6,0,1126,35170,0


Converting to forward existential form...Done !
original formula: EG((EX(EF(((p293==0)||(p228==1)))) + (EX((EX((p380==0)) + AF((p382==1)))) * ((p472==1) + (EF((p525==0)) * (p368==1))))))
=> equivalent forward existential formula: [FwdG(Init,(EX(E(TRUE U ((p293==0)||(p228==1)))) + (EX((EX((p380==0)) + !(EG(!((p382==1)))))) * ((p472==1) + (E(...199
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t25, t33, t42, t45, t46, t47, t48, t49, t51, t54, t15...300
(forward)formula 0,1,11.5626,386224,1,0,999,2.36521e+06,573,589,6572,2.34625e+06,1211
FORMULA CO4-PT-11-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 270 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 260 vertex of which 251 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 250 transition count 195
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 231 place count 136 transition count 194
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 231 place count 136 transition count 178
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 263 place count 120 transition count 178
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 274 place count 109 transition count 165
Iterating global reduction 2 with 11 rules applied. Total rules applied 285 place count 109 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 109 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 286 place count 109 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 294 place count 105 transition count 160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 298 place count 101 transition count 156
Iterating global reduction 3 with 4 rules applied. Total rules applied 302 place count 101 transition count 156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 334 place count 85 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 340 place count 85 transition count 134
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 343 place count 83 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 347 place count 79 transition count 129
Iterating global reduction 5 with 4 rules applied. Total rules applied 351 place count 79 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 360 place count 79 transition count 120
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 364 place count 79 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 368 place count 75 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 368 place count 75 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 370 place count 74 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 73 transition count 114
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 374 place count 73 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 71 transition count 112
Applied a total of 376 rules in 39 ms. Remains 71 /262 variables (removed 191) and now considering 112/322 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13774687496619330188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8990686438128802240.kers'
[2026-05-23 07:53:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13774687496619330188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8990686438128802240.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 71 cols 268 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:53:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8990686438128802240.kers
Total runtime 0 ms.
[2026-05-23 07:53:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 07:53:24] [INFO ] Invariant cache hit.
[2026-05-23 07:53:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:53:24] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2026-05-23 07:53:24] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-23 07:53:24] [INFO ] Invariant cache hit.
[2026-05-23 07:53:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/182 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/183 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 75 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/182 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 102/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 177 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7313ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/262 places, 112/322 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7492 ms. Remains : 71/262 places, 112/322 transitions.
[2026-05-23 07:53:31] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:53:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:53:31] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 07:53:31] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:53:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:53:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2740097269180019051.gal : 2 ms
[2026-05-23 07:53:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9660952789352380975.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/CTLFireability2740097269180019051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9660952789352380975.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,11665,0.018374,4548,2,200,5,1896,6,0,388,1710,0


Converting to forward existential form...Done !
original formula: EG((p333==0))
=> equivalent forward existential formula: [FwdG(Init,(p333==0))] != FALSE
Hit Full ! (commute/partial/dont) 109/0/3
(forward)formula 0,1,0.051085,6008,1,0,10,9874,19,4,1873,5859,8
FORMULA CO4-PT-11-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 236 transition count 294
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 236 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 236 transition count 293
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 218 transition count 275
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 218 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 218 transition count 273
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 97 place count 212 transition count 267
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 212 transition count 267
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 209 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 209 transition count 264
Applied a total of 109 rules in 17 ms. Remains 209 /262 variables (removed 53) and now considering 264/322 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11535388880764651208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4538399983948694878.kers'
[2026-05-23 07:53:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11535388880764651208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4538399983948694878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 209 cols 592 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-23 07:53:31] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4538399983948694878.kers
Total runtime 1 ms.
[2026-05-23 07:53:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 07:53:31] [INFO ] Invariant cache hit.
[2026-05-23 07:53:31] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-23 07:53:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/473 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 214 constraints, problems are : Problem set: 0 solved, 263 unsolved in 16297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/473 variables, 209/214 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 263/477 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 478 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46333ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 46334ms
Starting structural reductions in LTL mode, iteration 1 : 209/262 places, 264/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46517 ms. Remains : 209/262 places, 264/322 transitions.
[2026-05-23 07:54:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:54:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:54:18] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-23 07:54:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:54:18] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:54:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6235374692932229344.gal : 2 ms
[2026-05-23 07:54:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9844326549413998659.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/CTLFireability6235374692932229344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9844326549413998659.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,510880,0.093557,8004,2,1328,5,14232,6,0,1098,15492,0


Converting to forward existential form...Done !
original formula: AG((E(!(A(AX((p224==1)) U (p115!=1))) U (!((((p224!=1)&&(p518==1))&&(p542==1))) * AF((p283==1)))) + ((p443==0)&&(p392==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p443==0)&&(p392==0)))) * !(E(!(!((E(!((p115!=1)) U (!(!(EX(!((p224==1))))) * !((p115!=1...258
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t55, t99...311
(forward)formula 0,0,5.3544,180060,1,0,977,881072,566,504,5882,1.0925e+06,1305
FORMULA CO4-PT-11-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 241 transition count 301
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 241 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 241 transition count 300
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 223 transition count 282
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 223 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 223 transition count 280
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 216 transition count 273
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 216 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 216 transition count 272
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 213 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 213 transition count 269
Applied a total of 102 rules in 14 ms. Remains 213 /262 variables (removed 49) and now considering 269/322 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4228157253850619323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7904457096129603050.kers'
[2026-05-23 07:54:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4228157253850619323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7904457096129603050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 213 cols 603 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-23 07:54:23] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7904457096129603050.kers
Total runtime 1 ms.
[2026-05-23 07:54:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 07:54:23] [INFO ] Invariant cache hit.
[2026-05-23 07:54:23] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-23 07:54:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/482 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 218 constraints, problems are : Problem set: 0 solved, 268 unsolved in 16785 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/482 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 268/486 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 487 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46833ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 46834ms
Starting structural reductions in LTL mode, iteration 1 : 213/262 places, 269/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46999 ms. Remains : 213/262 places, 269/322 transitions.
[2026-05-23 07:55:10] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:55:10] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:55:10] [INFO ] Input system was already deterministic with 269 transitions.
[2026-05-23 07:55:10] [INFO ] Flatten gal took : 18 ms
[2026-05-23 07:55:10] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:55:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15548116942891049916.gal : 1 ms
[2026-05-23 07:55:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16000894116975022250.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/CTLFireability15548116942891049916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16000894116975022250.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,895245,0.099707,8120,2,1561,5,13951,6,0,1118,14656,0


Converting to forward existential form...Done !
original formula: EG((((E((p465==1) U (((p292==1)&&(p530==1))||(p471==1))) + AG((p537==1))) + (EX(((p433==0)||(p537==0))) + EF((p402==1)))) + ((p536==1)||(...166
=> equivalent forward existential formula: [FwdG(Init,(((E((p465==1) U (((p292==1)&&(p530==1))||(p471==1))) + !(E(TRUE U !((p537==1))))) + (EX(((p433==0)||...227
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t26, t34, t43, t47, t48, t50,...405
(forward)formula 0,1,4.39486,152852,1,0,757,512304,574,471,6295,1.0203e+06,871
FORMULA CO4-PT-11-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 235 transition count 293
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 235 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 235 transition count 291
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 215 transition count 271
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 215 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 215 transition count 269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 208 transition count 262
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 208 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 208 transition count 261
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 205 transition count 258
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 205 transition count 258
Applied a total of 119 rules in 15 ms. Remains 205 /262 variables (removed 57) and now considering 258/322 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16319516421826307707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15769219342906877993.kers'
[2026-05-23 07:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16319516421826307707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15769219342906877993.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 205 cols 580 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:55:15] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15769219342906877993.kers
Total runtime 1 ms.
[2026-05-23 07:55:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 07:55:15] [INFO ] Invariant cache hit.
[2026-05-23 07:55:15] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 07:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45949ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45950ms
Starting structural reductions in LTL mode, iteration 1 : 205/262 places, 258/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46131 ms. Remains : 205/262 places, 258/322 transitions.
[2026-05-23 07:56:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:01] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:01] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-23 07:56:01] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:01] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5700045026604876182.gal : 1 ms
[2026-05-23 07:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16244584278281063908.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/CTLFireability5700045026604876182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16244584278281063908.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,459604,0.088196,7804,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EX(AF(!(E((p134==1) U (p421!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E((p134==1) U (p421!=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.46756,159072,1,0,730,742125,544,461,6021,980195,915
FORMULA CO4-PT-11-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 271 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 260 vertex of which 251 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 250 transition count 197
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 227 place count 138 transition count 196
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 227 place count 138 transition count 180
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 259 place count 122 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 270 place count 111 transition count 167
Iterating global reduction 2 with 11 rules applied. Total rules applied 281 place count 111 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 111 transition count 166
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 282 place count 111 transition count 162
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 290 place count 107 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 294 place count 103 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 298 place count 103 transition count 158
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 330 place count 87 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 336 place count 87 transition count 136
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 339 place count 85 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 343 place count 81 transition count 131
Iterating global reduction 5 with 4 rules applied. Total rules applied 347 place count 81 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 356 place count 81 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 360 place count 81 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 364 place count 77 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 364 place count 77 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 366 place count 76 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 370 place count 73 transition count 114
Applied a total of 370 rules in 42 ms. Remains 73 /262 variables (removed 189) and now considering 114/322 (removed 208) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6847072561696233812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6784004959727147829.kers'
[2026-05-23 07:56:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6847072561696233812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6784004959727147829.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 73 cols 272 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-23 07:56:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6784004959727147829.kers
Total runtime 0 ms.
[2026-05-23 07:56:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:56:05] [INFO ] Invariant cache hit.
[2026-05-23 07:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:56:05] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-23 07:56:05] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-23 07:56:05] [INFO ] Invariant cache hit.
[2026-05-23 07:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 77 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 104/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 181 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7313ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/262 places, 114/322 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7464 ms. Remains : 73/262 places, 114/322 transitions.
[2026-05-23 07:56:13] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:56:13] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:13] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 07:56:13] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:13] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2636300063013697243.gal : 0 ms
[2026-05-23 07:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1707450556032368713.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/CTLFireability2636300063013697243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1707450556032368713.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,12097,0.018539,4576,2,216,5,2059,6,0,398,1914,0


Converting to forward existential form...Done !
original formula: AF((p226==1))
=> equivalent forward existential formula: [FwdG(Init,!((p226==1)))] = FALSE
Hit Full ! (commute/partial/dont) 112/0/2
(forward)formula 0,0,0.053387,6168,1,0,8,10538,20,4,1906,6397,8
FORMULA CO4-PT-11-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 297
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 239 transition count 295
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 222 transition count 278
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 222 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 222 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 217 transition count 271
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 217 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 217 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 216 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 216 transition count 269
Applied a total of 97 rules in 10 ms. Remains 216 /262 variables (removed 46) and now considering 269/322 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6620365807637956139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4726021737035965882.kers'
[2026-05-23 07:56:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6620365807637956139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4726021737035965882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 269 rows 216 cols 603 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-23 07:56:13] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4726021737035965882.kers
Total runtime 1 ms.
[2026-05-23 07:56:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 07:56:13] [INFO ] Invariant cache hit.
[2026-05-23 07:56:13] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-23 07:56:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/485 variables, 216/219 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 221 constraints, problems are : Problem set: 0 solved, 268 unsolved in 17044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/485 variables, 216/221 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 268/489 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 490 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47075ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 47075ms
Starting structural reductions in LTL mode, iteration 1 : 216/262 places, 269/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47272 ms. Remains : 216/262 places, 269/322 transitions.
[2026-05-23 07:57:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:57:00] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:57:00] [INFO ] Input system was already deterministic with 269 transitions.
[2026-05-23 07:57:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:57:00] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3851084112644308438.gal : 1 ms
[2026-05-23 07:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1955231930049788994.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/CTLFireability3851084112644308438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1955231930049788994.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,491812,0.106348,8512,2,1377,5,14932,6,0,1130,18581,0


Converting to forward existential form...Done !
original formula: A(!((EG(EX(((p340==1)||(p294==1)))) + AG(AX((p130==1))))) U (AG(!(((p281!=1)&&((p278==1)||(p199==1))))) * ((p310==1)||(p142!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(((p281!=1)&&((p278==1)||(p199==1))))))) * ((p310==1)||(p142!=1))))))) * !(E(!((...417
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t95, t15...300
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.32793,241200,1,0,955,1.22838e+06,574,689,6638,1.3362e+06,1277
FORMULA CO4-PT-11-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 239 transition count 297
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 239 transition count 297
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 239 transition count 295
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 223 transition count 279
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 223 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 223 transition count 278
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 216 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 216 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 216 transition count 270
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 213 transition count 267
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 213 transition count 267
Applied a total of 102 rules in 17 ms. Remains 213 /262 variables (removed 49) and now considering 267/322 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6225589485871770405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17142877427818310493.kers'
[2026-05-23 07:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6225589485871770405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17142877427818310493.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 213 cols 600 entries
Finished phase 1 with 210 SingleSign rule and 0 generalized
[2026-05-23 07:57:08] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17142877427818310493.kers
Total runtime 1 ms.
[2026-05-23 07:57:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:57:08] [INFO ] Invariant cache hit.
[2026-05-23 07:57:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-23 07:57:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/480 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 219 constraints, problems are : Problem set: 0 solved, 266 unsolved in 17164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/480 variables, 213/219 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 266/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 486 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47191ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 47192ms
Starting structural reductions in LTL mode, iteration 1 : 213/262 places, 267/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47359 ms. Remains : 213/262 places, 267/322 transitions.
[2026-05-23 07:57:55] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:57:55] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:57:55] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-23 07:57:55] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:57:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:57:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9498736461222771263.gal : 1 ms
[2026-05-23 07:57:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4579142943940725230.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/CTLFireability9498736461222771263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4579142943940725230.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,507802,0.107067,8428,2,1517,5,15040,6,0,1117,16845,0


Converting to forward existential form...Done !
original formula: (EX(((!(E((p180==1) U (p329==1))) * (p458==0)) * ((p296==0)&&(p426==0)))) * EF((A((p119==1) U (p458==1)) * AX((p431==1)))))
=> equivalent forward existential formula: [((FwdU((Init * EX(((!(E((p180==1) U (p329==1))) * (p458==0)) * ((p296==0)&&(p426==0))))),TRUE) * !((E(!((p458==...246
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t49, t51, t55,...333
(forward)formula 0,0,5.34465,180236,1,0,776,837032,571,414,6310,1.08484e+06,1035
FORMULA CO4-PT-11-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 266 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 260 vertex of which 251 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 250 transition count 197
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 138 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 231 place count 136 transition count 194
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 231 place count 136 transition count 178
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 263 place count 120 transition count 178
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 274 place count 109 transition count 165
Iterating global reduction 3 with 11 rules applied. Total rules applied 285 place count 109 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 109 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 286 place count 109 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 294 place count 105 transition count 160
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 298 place count 101 transition count 156
Iterating global reduction 4 with 4 rules applied. Total rules applied 302 place count 101 transition count 156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 334 place count 85 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 85 transition count 134
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 343 place count 83 transition count 133
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 347 place count 79 transition count 129
Iterating global reduction 6 with 4 rules applied. Total rules applied 351 place count 79 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 359 place count 79 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 362 place count 79 transition count 118
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 365 place count 76 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 365 place count 76 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 367 place count 75 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 369 place count 74 transition count 116
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 372 place count 74 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 72 transition count 114
Applied a total of 374 rules in 32 ms. Remains 72 /262 variables (removed 190) and now considering 114/322 (removed 208) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8863032852822548494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9841801474525629053.kers'
[2026-05-23 07:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8863032852822548494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9841801474525629053.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 72 cols 272 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-23 07:58:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9841801474525629053.kers
Total runtime 0 ms.
[2026-05-23 07:58:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 07:58:00] [INFO ] Invariant cache hit.
[2026-05-23 07:58:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:58:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-23 07:58:00] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-23 07:58:00] [INFO ] Invariant cache hit.
[2026-05-23 07:58:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 76 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 104/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 180 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7111ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/262 places, 114/322 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7233 ms. Remains : 72/262 places, 114/322 transitions.
[2026-05-23 07:58:08] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:58:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:58:08] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 07:58:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:58:08] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:58:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7840051084849493059.gal : 1 ms
[2026-05-23 07:58:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13637260031101266882.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/CTLFireability7840051084849493059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13637260031101266882.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,12961,0.019657,4568,2,216,5,2047,6,0,394,1895,0


Converting to forward existential form...Done !
original formula: AF((AF(AG((p283==1))) * EG((p473==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(!(E(TRUE U !((p283==1))))))) * EG((p473==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t22, t32, t37, t72, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.182489,12408,1,0,240,47726,259,135,2645,40233,388
FORMULA CO4-PT-11-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 237 transition count 295
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 237 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 237 transition count 293
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 219 transition count 275
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 219 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 219 transition count 273
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 213 transition count 267
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 213 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 211 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 211 transition count 264
Applied a total of 107 rules in 13 ms. Remains 211 /262 variables (removed 51) and now considering 264/322 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4796610929335521215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4226931912773043354.kers'
[2026-05-23 07:58:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4796610929335521215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4226931912773043354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 211 cols 594 entries
Finished phase 1 with 208 SingleSign rule and 0 generalized
[2026-05-23 07:58:08] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4226931912773043354.kers
Total runtime 1 ms.
[2026-05-23 07:58:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 07:58:08] [INFO ] Invariant cache hit.
[2026-05-23 07:58:08] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-23 07:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 264/475 variables, 211/214 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/475 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 216 constraints, problems are : Problem set: 0 solved, 263 unsolved in 16206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 264/475 variables, 211/216 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 263/479 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 480 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46237ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 46238ms
Starting structural reductions in LTL mode, iteration 1 : 211/262 places, 264/322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46409 ms. Remains : 211/262 places, 264/322 transitions.
[2026-05-23 07:58:54] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:58:54] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:58:54] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-23 07:58:54] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:58:54] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18192219567882141248.gal : 1 ms
[2026-05-23 07:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability483823560301699225.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/CTLFireability18192219567882141248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability483823560301699225.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,489310,0.098948,8200,2,1365,5,14884,6,0,1106,15519,0


Converting to forward existential form...Done !
original formula: EF((EX(AG(((p524==0)&&(p482==0)))) + (EX((p114==1)) * ((p277==0)||(p530==0)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(((p524==0)&&(p482==0))))))] != FALSE + [(EY((FwdU(Init,TRUE) * ((p277==0)|...192
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t23, t25, t33, t42, t44, t45, t46, t47, t48, t50, t53, t97...305
(forward)formula 0,1,1.07776,42268,1,0,355,142654,550,231,6075,136972,552
FORMULA CO4-PT-11-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 260 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 260 vertex of which 251 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 250 transition count 206
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 112 rules applied. Total rules applied 217 place count 147 transition count 197
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 225 place count 139 transition count 197
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 225 place count 139 transition count 181
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 257 place count 123 transition count 181
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 267 place count 113 transition count 169
Iterating global reduction 3 with 10 rules applied. Total rules applied 277 place count 113 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 277 place count 113 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 110 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 287 place count 106 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 106 transition count 162
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 323 place count 90 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 329 place count 90 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 332 place count 88 transition count 139
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 336 place count 84 transition count 135
Iterating global reduction 5 with 4 rules applied. Total rules applied 340 place count 84 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 349 place count 84 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 352 place count 84 transition count 123
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 356 place count 81 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 80 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 357 place count 80 transition count 121
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 359 place count 79 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 361 place count 78 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 363 place count 76 transition count 118
Applied a total of 363 rules in 24 ms. Remains 76 /262 variables (removed 186) and now considering 118/322 (removed 204) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8860528333880148021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15853281584309707918.kers'
[2026-05-23 07:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8860528333880148021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15853281584309707918.kers]
Normalized transition count is 117 out of 118 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 76 cols 284 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-23 07:58:55] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15853281584309707918.kers
Total runtime 0 ms.
[2026-05-23 07:58:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 07:58:55] [INFO ] Invariant cache hit.
[2026-05-23 07:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:58:55] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-23 07:58:55] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-23 07:58:55] [INFO ] Invariant cache hit.
[2026-05-23 07:58:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/194 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 80 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 109/188 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/194 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 189 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4833 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8330ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 8330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/262 places, 118/322 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8443 ms. Remains : 76/262 places, 118/322 transitions.
[2026-05-23 07:59:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:59:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:59:04] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-23 07:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:59:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:59:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8038607394671871139.gal : 1 ms
[2026-05-23 07:59:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13729068786058922501.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/CTLFireability8038607394671871139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13729068786058922501.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,18241,0.020179,4676,2,230,5,2276,6,0,414,2285,0


Converting to forward existential form...Done !
original formula: EF(((EG(EF((p426==1))) + EF((p369==1))) + E(((p439==1)&&(p495==1)) U (p352==1))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),E(TRUE U (p426==1)))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * (p369==1))] != FALSE) + ...225
Reverse transition relation is NOT exact ! Due to transitions t9, t19, t33, t38, t77, t114, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,1,0.103831,8632,1,0,157,23055,262,86,2565,18292,251
FORMULA CO4-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 322/322 transitions.
Graph (trivial) has 265 edges and 262 vertex of which 3 / 262 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 260 vertex of which 251 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 250 transition count 199
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 140 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 227 place count 138 transition count 196
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 227 place count 138 transition count 179
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 261 place count 121 transition count 179
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 273 place count 109 transition count 165
Iterating global reduction 3 with 12 rules applied. Total rules applied 285 place count 109 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 109 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 286 place count 109 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 294 place count 105 transition count 160
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 298 place count 101 transition count 156
Iterating global reduction 4 with 4 rules applied. Total rules applied 302 place count 101 transition count 156
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 332 place count 86 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 338 place count 86 transition count 135
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 341 place count 84 transition count 134
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 344 place count 81 transition count 131
Iterating global reduction 6 with 3 rules applied. Total rules applied 347 place count 81 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 356 place count 81 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 360 place count 81 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 364 place count 77 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 364 place count 77 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 366 place count 76 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 368 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 370 place count 73 transition count 114
Applied a total of 370 rules in 24 ms. Remains 73 /262 variables (removed 189) and now considering 114/322 (removed 208) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7475566378244857570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7432036793680114003.kers'
[2026-05-23 07:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7475566378244857570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7432036793680114003.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 73 cols 274 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-23 07:59:04] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-7432036793680114003.kers
Total runtime 13 ms.
[2026-05-23 07:59:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 07:59:04] [INFO ] Invariant cache hit.
[2026-05-23 07:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:59:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-23 07:59:04] [INFO ] Redundant transitions in 8 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 07:59:04] [INFO ] Invariant cache hit.
[2026-05-23 07:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 1/187 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 77 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3995 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 113/185 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 105/180 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 1/187 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 185 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9783ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 9784ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/262 places, 114/322 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9918 ms. Remains : 73/262 places, 114/322 transitions.
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:59:14] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:59:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3037907000872287167.gal : 0 ms
[2026-05-23 07:59:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2376123128191797801.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3037907000872287167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2376123128191797801.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2376123128191797801.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 65
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :65 after 118
Reachability property CO4-PT-11-CTLFireability-2024-14 is true.
FORMULA CO4-PT-11-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,498,0.030567,4708,2,256,12,2208,6,0,399,1916,0
Total reachable state count : 498

Verifying 1 reachability properties.
Reachability property CO4-PT-11-CTLFireability-2024-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-11-CTLFireability-2024-14,1,0.031108,4968,2,74,12,2208,7,0,405,1916,0
RANDOM walk for 28925 steps (3524 resets) in 138 ms. (208 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:59:14] [INFO ] Flatten gal took : 6 ms
Total runtime 478274 ms.

BK_STOP 1779523154507

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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