fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695800858
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
630.184 85356.00 115274.00 2690.50 TTFTFTFTFTFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800858.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 DoubleExponent-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800858
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779675839337

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 02:24:00] [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-25 02:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:24:00] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2026-05-25 02:24:00] [INFO ] Transformed 110 places.
[2026-05-25 02:24:00] [INFO ] Transformed 98 transitions.
[2026-05-25 02:24:00] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 77 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 18 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (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-5798096358870962848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-212467145042860177.kers'
[2026-05-25 02:24:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5798096358870962848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-212467145042860177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:24:00] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-212467145042860177.kers
Total runtime 1 ms.
[2026-05-25 02:24:00] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-25 02:24:00] [INFO ] Invariant cache hit.
[2026-05-25 02:24:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 02:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/204 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 128 constraints, problems are : Problem set: 0 solved, 97 unsolved in 17096 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/204 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 97/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 226 constraints, problems are : Problem set: 0 solved, 97 unsolved in 28479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 45612ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 45622ms
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46020 ms. Remains : 106/110 places, 98/98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2026-05-25 02:24:46] [INFO ] Invariant cache hit.
[2026-05-25 02:24:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 02:24:46] [INFO ] Invariant cache hit.
[2026-05-25 02:24:46] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 106/106 places, 98/98 transitions.
Support contains 77 out of 106 places after structural reductions.
[2026-05-25 02:24:47] [INFO ] Flatten gal took : 29 ms
[2026-05-25 02:24:47] [INFO ] Flatten gal took : 11 ms
[2026-05-25 02:24:47] [INFO ] Input system was already deterministic with 98 transitions.
Reduction of identical properties reduced properties to check from 71 to 67
RANDOM walk for 40000 steps (1350 resets) in 1837 ms. (21 steps per ms) remains 42/67 properties
BEST_FIRST walk for 4001 steps (118 resets) in 143 ms. (27 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (111 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (116 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (108 resets) in 118 ms. (33 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (114 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (110 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (114 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (104 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (111 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (113 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (114 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (113 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (110 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (113 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (111 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (113 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (112 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (119 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (110 resets) in 48 ms. (81 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (110 resets) in 22 ms. (173 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (114 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (114 resets) in 47 ms. (83 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (111 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (115 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (109 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (114 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (111 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (120 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (114 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (114 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (115 resets) in 39 ms. (100 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (107 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (111 resets) in 39 ms. (100 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (118 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (117 resets) in 53 ms. (74 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (102 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (111 resets) in 41 ms. (95 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (108 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (112 resets) in 51 ms. (76 steps per ms) remains 42/42 properties
[2026-05-25 02:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 9/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 32/98 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 96/194 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 7 (OVERLAPS) 10/204 variables, 8/117 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 1/119 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 119 constraints, problems are : Problem set: 15 solved, 27 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 15 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 15/51 variables, 2/2 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 9/11 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 96/193 variables, 97/108 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 24/132 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/133 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/133 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 11/204 variables, 9/142 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 3/145 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/146 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 2/148 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/148 constraints. Problems are: Problem set: 15 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/204 variables, 0/148 constraints. Problems are: Problem set: 15 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 148 constraints, problems are : Problem set: 15 solved, 27 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 27/42 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4363ms problems are : Problem set: 15 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1646 ms.
Support contains 36 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 98/98 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 94
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 102 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 99 transition count 91
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 99 transition count 87
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 95 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 44 place count 84 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 82 transition count 76
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 82 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 79 transition count 73
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 79 transition count 73
Applied a total of 58 rules in 31 ms. Remains 79 /106 variables (removed 27) and now considering 73/98 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 79/106 places, 73/98 transitions.
RANDOM walk for 40000 steps (3127 resets) in 453 ms. (88 steps per ms) remains 9/27 properties
BEST_FIRST walk for 40000 steps (2375 resets) in 302 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2348 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2394 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2389 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2391 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2377 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2411 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2382 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2377 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12968414591550781539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-498838497420812030.kers'
[2026-05-25 02:24:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12968414591550781539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-498838497420812030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 79 cols 234 entries
Finished phase 1 with 60 SingleSign rule and 8 generalized
[2026-05-25 02:24:54] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-498838497420812030.kers
Total runtime 1 ms.
[2026-05-25 02:24:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 43/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 70/139 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 12/151 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/152 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 79/79 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 43/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/69 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 70/139 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 12/151 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/152 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 102 constraints, problems are : Problem set: 0 solved, 9 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 79/79 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2124 ms.
Support contains 12 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 73/73 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 66
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 72 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 71 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 71 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 70 transition count 64
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 32 place count 63 transition count 57
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 63 transition count 53
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 59 transition count 53
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 59 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 58 transition count 52
Applied a total of 45 rules in 19 ms. Remains 58 /79 variables (removed 21) and now considering 52/73 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 58/79 places, 52/73 transitions.
RANDOM walk for 40000 steps (4468 resets) in 124 ms. (320 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (3105 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3081 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3138 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3109 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3078 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3083 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3127 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3141 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4216568175276784228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11533845191175729608.kers'
[2026-05-25 02:24:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4216568175276784228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11533845191175729608.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 56 cols 188 entries
Finished phase 1 with 37 SingleSign rule and 10 generalized
[2026-05-25 02:24:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11533845191175729608.kers
Total runtime 0 ms.
[2026-05-25 02:24:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 36/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10/109 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/110 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/110 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 74 constraints, problems are : Problem set: 0 solved, 8 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 36/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 10/109 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/109 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/109 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/109 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/110 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 83 constraints, problems are : Problem set: 0 solved, 8 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1133 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 52/52 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 51
Applied a total of 2 rules in 4 ms. Remains 57 /58 variables (removed 1) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/58 places, 51/52 transitions.
RANDOM walk for 40000 steps (4512 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3045 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3116 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3079 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3102 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3084 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3107 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3105 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3120 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 512 steps, run visited all 8 properties in 13 ms. (steps per millisecond=39 )
Probabilistic random walk after 512 steps, saw 266 distinct states, run finished after 16 ms. (steps per millisecond=32 ) properties seen :8
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 02:25:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 7 ms
FORMULA DoubleExponent-PT-002-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:00] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 63 out of 106 places (down from 64) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 173 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 105 transition count 78
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 86 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 38 place count 86 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 84 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 73 transition count 65
Applied a total of 64 rules in 9 ms. Remains 73 /106 variables (removed 33) and now considering 65/98 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11023747224553389507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9223355964977922995.kers'
[2026-05-25 02:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11023747224553389507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9223355964977922995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 73 cols 199 entries
Finished phase 1 with 50 SingleSign rule and 12 generalized
[2026-05-25 02:25:00] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9223355964977922995.kers
Total runtime 0 ms.
[2026-05-25 02:25:00] [INFO ] Implicit Places using invariants in 44 ms returned [50, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/106 places, 65/98 transitions.
Graph (complete) has 152 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 69 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 67 transition count 61
Applied a total of 7 rules in 7 ms. Remains 67 /71 variables (removed 4) and now considering 61/65 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5755557237459252103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-132306195994244202.kers'
[2026-05-25 02:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5755557237459252103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-132306195994244202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 67 cols 185 entries
Finished phase 1 with 47 SingleSign rule and 11 generalized
[2026-05-25 02:25:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-132306195994244202.kers
Total runtime 0 ms.
[2026-05-25 02:25:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 02:25:00] [INFO ] Invariant cache hit.
[2026-05-25 02:25:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:25:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/106 places, 61/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 202 ms. Remains : 67/106 places, 61/98 transitions.
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:00] [INFO ] Input system was already deterministic with 61 transitions.
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5109087600612900582.gal : 2 ms
[2026-05-25 02:25:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5861447530312812100.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/CTLFireability5109087600612900582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5861447530312812100.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,2875,0.051993,5916,2,2059,5,8792,6,0,331,7842,0


Converting to forward existential form...Done !
original formula: EF(((EG(((p27<1)&&((p104<1)||(p30<1)))) * ((p27<1) + EG((p105<1)))) + ((!(E((p47>=1) U (p3>=1))) * (p74>=1)) * (EG((p32<1)) * AG(!(E((p82...189
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * EG(((p27<1)&&((p104<1)||(p30<1))))) * (p27<1))] != FALSE + [FwdG((FwdU(Init,TRUE) * EG(((...352
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t9, t12, t19, t26, t29, t31, t32, t34, t36, t37, t38, t39, t43, t46, t49, t51, t5...266
(forward)formula 0,1,0.960652,43056,1,0,810,198670,144,117,2057,165160,815
FORMULA DoubleExponent-PT-002-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 105 transition count 79
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 87 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 85 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 40 place count 85 transition count 71
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 72 place count 69 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 69 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 68 transition count 60
Applied a total of 74 rules in 15 ms. Remains 68 /106 variables (removed 38) and now considering 60/98 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1354137329458402838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15872883161438539354.kers'
[2026-05-25 02:25:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1354137329458402838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15872883161438539354.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 60 rows 67 cols 180 entries
Finished phase 1 with 46 SingleSign rule and 11 generalized
[2026-05-25 02:25:01] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15872883161438539354.kers
Total runtime 0 ms.
[2026-05-25 02:25:01] [INFO ] Implicit Places using invariants in 50 ms returned [45, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/106 places, 60/98 transitions.
Graph (complete) has 142 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 64 transition count 58
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 2 with 4 rules applied. Total rules applied 7 place count 62 transition count 56
Applied a total of 7 rules in 6 ms. Remains 62 /66 variables (removed 4) and now considering 56/60 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10034925109024272472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18203514708277732272.kers'
[2026-05-25 02:25:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10034925109024272472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18203514708277732272.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 56 rows 61 cols 166 entries
Finished phase 1 with 43 SingleSign rule and 10 generalized
[2026-05-25 02:25:01] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18203514708277732272.kers
Total runtime 0 ms.
[2026-05-25 02:25:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:25:02] [INFO ] Invariant cache hit.
[2026-05-25 02:25:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:25:02] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/106 places, 56/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 197 ms. Remains : 62/106 places, 56/98 transitions.
[2026-05-25 02:25:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:02] [INFO ] Input system was already deterministic with 56 transitions.
[2026-05-25 02:25:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5721369685386409101.gal : 1 ms
[2026-05-25 02:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1865601690781275817.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/CTLFireability5721369685386409101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1865601690781275817.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,2418,0.043787,5896,2,1474,5,7921,6,0,307,8110,0


Converting to forward existential form...Done !
original formula: AG((((p80<1) + AG(((p22>=1)&&(p37>=1)))) + (EF((p20>=1)) + ((p94<1) * ((!(A((p33>=1) U (p44>=1))) + (p48<1)) + (p54<1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((E(TRUE U (p20>=1)) + ((p94<1) * ((!(!((E(!((p44>=1)) U (!((p33>=1)) * !((p44>=1)))...259
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t9, t20, t23, t24, t26, t28, t29, t30, t31, t33, t34, t39, t42, t44, t47, t54, t5...256
(forward)formula 0,1,0.7961,36732,1,0,762,169868,151,141,1970,152510,779
FORMULA DoubleExponent-PT-002-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 44 place count 83 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 79 transition count 71
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 72 place count 69 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 68 transition count 60
Applied a total of 73 rules in 10 ms. Remains 68 /106 variables (removed 38) and now considering 60/98 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8506749457745821512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-876147699376519091.kers'
[2026-05-25 02:25:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8506749457745821512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-876147699376519091.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 68 cols 186 entries
Finished phase 1 with 47 SingleSign rule and 10 generalized
[2026-05-25 02:25:02] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-876147699376519091.kers
Total runtime 0 ms.
[2026-05-25 02:25:02] [INFO ] Implicit Places using invariants in 51 ms returned [46, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/106 places, 60/98 transitions.
Graph (complete) has 147 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 64 transition count 58
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 2 with 4 rules applied. Total rules applied 7 place count 62 transition count 56
Applied a total of 7 rules in 14 ms. Remains 62 /66 variables (removed 4) and now considering 56/60 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4486876327750124568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4472556400336602221.kers'
[2026-05-25 02:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4486876327750124568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4472556400336602221.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 56 rows 62 cols 172 entries
Finished phase 1 with 45 SingleSign rule and 8 generalized
[2026-05-25 02:25:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4472556400336602221.kers
Total runtime 1 ms.
[2026-05-25 02:25:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:25:03] [INFO ] Invariant cache hit.
[2026-05-25 02:25:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:25:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 62/106 places, 56/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 200 ms. Remains : 62/106 places, 56/98 transitions.
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:03] [INFO ] Input system was already deterministic with 56 transitions.
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6764639685602365605.gal : 1 ms
[2026-05-25 02:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3547830516409533572.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/CTLFireability6764639685602365605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3547830516409533572.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,2419,0.040836,5708,2,1501,5,7182,6,0,306,6980,0


Converting to forward existential form...Done !
original formula: AG(AF((AF(((p13>=1)&&(p46>=1))) * EG((p20>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(EG(!(((p13>=1)&&(p46>=1))))) * EG((p20>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t7, t14, t21, t23, t24, t26, t28, t29, t30, t31, t33, t35, t38, t40, t42, t44, t5...266
(forward)formula 0,0,0.429562,23432,1,0,613,80563,136,60,1950,71371,605
FORMULA DoubleExponent-PT-002-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (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-12867637791151048435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1348898986569075310.kers'
[2026-05-25 02:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12867637791151048435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1348898986569075310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:25:03] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1348898986569075310.kers
Total runtime 1 ms.
[2026-05-25 02:25:03] [INFO ] Implicit Places using invariants in 48 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9134665828540908870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13826206413181266430.kers'
[2026-05-25 02:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9134665828540908870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13826206413181266430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:25:03] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13826206413181266430.kers
Total runtime 1 ms.
[2026-05-25 02:25:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 02:25:03] [INFO ] Invariant cache hit.
[2026-05-25 02:25:03] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 103/106 places, 97/98 transitions.
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:03] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11577221322044547792.gal : 1 ms
[2026-05-25 02:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15447964594706148710.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/CTLFireability11577221322044547792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15447964594706148710.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,3708,0.099886,8712,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: (EX(EX(AX(EG((p73<1))))) + EF(AG((p1>=1))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(EX(!(EG((p73<1))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((p1>=1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,3.02811,108968,1,0,1209,514535,215,186,2975,422309,1252
FORMULA DoubleExponent-PT-002-CTLFireability-2024-03 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 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 46 place count 82 transition count 70
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 54 place count 78 transition count 70
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 3 with 30 rules applied. Total rules applied 84 place count 63 transition count 55
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 63 transition count 55
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 62 transition count 54
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 61 transition count 53
Applied a total of 89 rules in 14 ms. Remains 61 /106 variables (removed 45) and now considering 53/98 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12910673382130561367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11415254063386993815.kers'
[2026-05-25 02:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12910673382130561367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11415254063386993815.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 53 rows 59 cols 165 entries
Finished phase 1 with 39 SingleSign rule and 11 generalized
[2026-05-25 02:25:06] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11415254063386993815.kers
Total runtime 0 ms.
[2026-05-25 02:25:06] [INFO ] Implicit Places using invariants in 45 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/106 places, 53/98 transitions.
Graph (complete) has 142 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 57 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 55 transition count 49
Applied a total of 7 rules in 3 ms. Remains 55 /59 variables (removed 4) and now considering 49/53 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2000996670592889327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18161105064474141653.kers'
[2026-05-25 02:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2000996670592889327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18161105064474141653.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 49 rows 53 cols 150 entries
Finished phase 1 with 36 SingleSign rule and 10 generalized
[2026-05-25 02:25:07] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18161105064474141653.kers
Total runtime 0 ms.
[2026-05-25 02:25:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 02:25:07] [INFO ] Invariant cache hit.
[2026-05-25 02:25:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:25:07] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/106 places, 49/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 169 ms. Remains : 55/106 places, 49/98 transitions.
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:07] [INFO ] Input system was already deterministic with 49 transitions.
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5357069164621885185.gal : 1 ms
[2026-05-25 02:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9830017646253737360.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/CTLFireability5357069164621885185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9830017646253737360.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,2155,0.037829,5596,2,1485,5,7075,6,0,272,6457,0


Converting to forward existential form...Done !
original formula: EG(EF(((p59>=1)&&(p78>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p59>=1)&&(p78>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t11, t16, t20, t22, t23, t24, t25, t27, t29, t32, t34, t36, t42, t45, t47, t4...256
dead was empty
(forward)formula 0,0,0.390677,22312,1,0,606,84761,121,84,1750,68022,611
FORMULA DoubleExponent-PT-002-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 105 transition count 84
Reduce places removed 13 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 17 rules applied. Total rules applied 30 place count 92 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 88 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 88 transition count 77
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 40 place count 85 transition count 77
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 58 place count 76 transition count 68
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 76 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 75 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 75 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 74 transition count 66
Applied a total of 65 rules in 15 ms. Remains 74 /106 variables (removed 32) and now considering 66/98 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2388016612029083376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13920266243414195951.kers'
[2026-05-25 02:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2388016612029083376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13920266243414195951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 74 cols 206 entries
Finished phase 1 with 55 SingleSign rule and 8 generalized
[2026-05-25 02:25:07] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13920266243414195951.kers
Total runtime 0 ms.
[2026-05-25 02:25:07] [INFO ] Implicit Places using invariants in 39 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 73/106 places, 66/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 73 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 65
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 2 with 2 rules applied. Total rules applied 4 place count 71 transition count 64
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17644127428433323232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17215192191289460040.kers'
[2026-05-25 02:25:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17644127428433323232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17215192191289460040.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 71 cols 198 entries
Finished phase 1 with 51 SingleSign rule and 10 generalized
[2026-05-25 02:25:07] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17215192191289460040.kers
Total runtime 0 ms.
[2026-05-25 02:25:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 02:25:07] [INFO ] Invariant cache hit.
[2026-05-25 02:25:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:25:07] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 71/106 places, 64/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 174 ms. Remains : 71/106 places, 64/98 transitions.
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 5 ms
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:07] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:07] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14107257488760841161.gal : 1 ms
[2026-05-25 02:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1950001926171894719.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/CTLFireability14107257488760841161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1950001926171894719.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,2575,0.031725,5304,2,1624,5,5254,6,0,350,4294,0


Converting to forward existential form...Done !
original formula: (EF((!(E((((p5>=1)||(p32>=1))||(!((p12>=1)&&(p50>=1)))) U (AG(((p24>=1)&&(p42>=1))) * EF(((p59>=1)&&(p78>=1)))))) * AG((((p71<1)||(p96<1)...225
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E((((p5>=1)||(p32>=1))||(!((p12>=1)&&(p50>=1)))) U (!(E(TRUE U !(((p24>=1)&&(p42>=1)))))...405
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t18, t25, t28, t29, t34, t36, t37, t39, t41, t43, t45, t49, t52, t55, t56, t62, t63, ...253
(forward)formula 0,0,0.688088,34716,1,0,786,160094,159,149,2271,123447,826
FORMULA DoubleExponent-PT-002-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 81
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 89 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 88 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 82 transition count 74
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 68 place count 71 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 70 transition count 62
Applied a total of 69 rules in 16 ms. Remains 70 /106 variables (removed 36) and now considering 62/98 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6312826108797007679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-349870780541465545.kers'
[2026-05-25 02:25:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6312826108797007679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-349870780541465545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 70 cols 188 entries
Finished phase 1 with 49 SingleSign rule and 10 generalized
[2026-05-25 02:25:08] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-349870780541465545.kers
Total runtime 1 ms.
[2026-05-25 02:25:08] [INFO ] Implicit Places using invariants in 44 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/106 places, 62/98 transitions.
Graph (complete) has 142 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 66 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 65 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 65 transition count 59
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 2 with 2 rules applied. Total rules applied 7 place count 64 transition count 58
Applied a total of 7 rules in 4 ms. Remains 64 /68 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9177975208336329360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-890312879021104441.kers'
[2026-05-25 02:25:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9177975208336329360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-890312879021104441.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 64 cols 174 entries
Finished phase 1 with 46 SingleSign rule and 9 generalized
[2026-05-25 02:25:08] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-890312879021104441.kers
Total runtime 0 ms.
[2026-05-25 02:25:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 02:25:08] [INFO ] Invariant cache hit.
[2026-05-25 02:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:25:08] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/106 places, 58/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 167 ms. Remains : 64/106 places, 58/98 transitions.
[2026-05-25 02:25:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:08] [INFO ] Input system was already deterministic with 58 transitions.
[2026-05-25 02:25:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14140533004462839061.gal : 0 ms
[2026-05-25 02:25:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1452127543604829619.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/CTLFireability14140533004462839061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1452127543604829619.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,2348,0.045121,5740,2,1587,5,7467,6,0,317,7174,0


Converting to forward existential form...Done !
original formula: A(((AF(EG((p88>=1))) + (p23>=1)) + (p20>=1)) U (EF(!(EF(((p55>=1)&&(p61>=1))))) + AG(((AG((p17>=1)) + (AG((p88>=1)) * AF((p44>=1)))) + (p...165
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !(E(TRUE U ((p55>=1)&&(p61>=1))))) + !(E(TRUE U !(((!(E(TRUE U !((p17>=1)))) + (!(E(T...608
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t12, t18, t25, t26, t29, t30, t32, t33, t34, t35, t37, t39, t41, t43, t46, t48, t...262
(forward)formula 0,1,0.770697,37180,1,0,829,176384,152,177,2015,146968,869
FORMULA DoubleExponent-PT-002-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (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-16419761890961705177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3562593533629801025.kers'
[2026-05-25 02:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16419761890961705177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3562593533629801025.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:25:09] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3562593533629801025.kers
Total runtime 2 ms.
[2026-05-25 02:25:09] [INFO ] Implicit Places using invariants in 63 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-556236396780200294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12594350787275057771.kers'
[2026-05-25 02:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-556236396780200294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12594350787275057771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:25:09] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12594350787275057771.kers
Total runtime 1 ms.
[2026-05-25 02:25:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 02:25:09] [INFO ] Invariant cache hit.
[2026-05-25 02:25:09] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 103/106 places, 97/98 transitions.
[2026-05-25 02:25:09] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:09] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 02:25:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13266032453365363047.gal : 1 ms
[2026-05-25 02:25:09] [INFO ] Time to serialize properties into /tmp/CTLFireability612306451486799241.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/CTLFireability13266032453365363047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability612306451486799241.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,3708,0.1012,8728,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: (EG(EX(TRUE)) + (AF((p20<1)) * AG(A((A(((p8>=1)&&(p97>=1)) U (p100>=1)) + (p66>=1)) U AF(((p3>=1)||(p102>=1)))))))
=> equivalent forward existential formula: ([FwdG((Init * !(EG(EX(TRUE)))),!((p20<1)))] = FALSE * ([FwdG((FwdU(FwdU((Init * !(EG(EX(TRUE)))),TRUE),!(!(EG(!...406
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,3.11927,107936,1,0,1208,504599,223,189,3128,428288,1255
FORMULA DoubleExponent-PT-002-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (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-17734993715538699746.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5298204964613892352.kers'
[2026-05-25 02:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17734993715538699746.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5298204964613892352.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:25:12] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5298204964613892352.kers
Total runtime 1 ms.
[2026-05-25 02:25:12] [INFO ] Implicit Places using invariants in 50 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5894688189880650090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16923391116938812515.kers'
[2026-05-25 02:25:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5894688189880650090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16923391116938812515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 267 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:25:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16923391116938812515.kers
Total runtime 1 ms.
[2026-05-25 02:25:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 02:25:12] [INFO ] Invariant cache hit.
[2026-05-25 02:25:13] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 104/106 places, 97/98 transitions.
[2026-05-25 02:25:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:13] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 02:25:13] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:13] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9705792956210487501.gal : 2 ms
[2026-05-25 02:25:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10743779675987038579.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/CTLFireability9705792956210487501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10743779675987038579.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,3708,0.102529,9032,2,4114,5,19213,6,0,514,16904,0


Converting to forward existential form...Done !
original formula: A(E(!((A(((p24>=1)&&(p42>=1)) U (p21>=1)) * !(AX((p85>=1))))) U EF(((p86>=1) * E(((p69>=1)&&(p77>=1)) U (p91>=1))))) U AF(EG((p94<1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EG((p94<1))))))))) * !(E(!(!(EG(!(EG((p94<1)))))) U (!(E(!((!((E(!((p21>=1)) U (!(((p24>...335
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,3.40942,111252,1,0,1222,521652,227,193,3018,424981,1264
FORMULA DoubleExponent-PT-002-CTLFireability-2024-09 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 : 106/106 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 106 transition count 87
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 95 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 91 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 30 place count 91 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 85 transition count 77
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 64 place count 74 transition count 66
Applied a total of 64 rules in 6 ms. Remains 74 /106 variables (removed 32) and now considering 66/98 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5901359076223426699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13208151664377252577.kers'
[2026-05-25 02:25:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5901359076223426699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13208151664377252577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 74 cols 206 entries
Finished phase 1 with 53 SingleSign rule and 10 generalized
[2026-05-25 02:25:16] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13208151664377252577.kers
Total runtime 0 ms.
[2026-05-25 02:25:16] [INFO ] Implicit Places using invariants in 42 ms returned [48, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 72/106 places, 66/98 transitions.
Graph (complete) has 153 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 70 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 69 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 69 transition count 63
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 2 with 2 rules applied. Total rules applied 7 place count 68 transition count 62
Applied a total of 7 rules in 4 ms. Remains 68 /72 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7591794374938125158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1430044085341755631.kers'
[2026-05-25 02:25:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7591794374938125158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1430044085341755631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 62 rows 68 cols 192 entries
Finished phase 1 with 50 SingleSign rule and 9 generalized
[2026-05-25 02:25:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1430044085341755631.kers
Total runtime 0 ms.
[2026-05-25 02:25:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:25:16] [INFO ] Invariant cache hit.
[2026-05-25 02:25:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:25:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 68/106 places, 62/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 166 ms. Remains : 68/106 places, 62/98 transitions.
[2026-05-25 02:25:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:16] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:16] [INFO ] Input system was already deterministic with 62 transitions.
[2026-05-25 02:25:16] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:16] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16123549082786790626.gal : 1 ms
[2026-05-25 02:25:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6758939123729750880.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/CTLFireability16123549082786790626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6758939123729750880.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,2406,0.053008,5832,2,2167,5,7925,6,0,336,7145,0


Converting to forward existential form...Done !
original formula: (A(AF(!(AF(((p40>=1)&&(p8>=1))))) U ((p10>=1)&&(p28>=1))) + EF(((AF((p85>=1)) * AF(E(((p55>=1)&&(p61>=1)) U (p100>=1)))) * ((p14>=1)&&(p8...163
=> equivalent forward existential formula: ([((Init * !(EG(!(((p10>=1)&&(p28>=1)))))) * !(E(!(((p10>=1)&&(p28>=1))) U (!(!(EG(!(!(!(EG(!(((p40>=1)&&(p8>=1)...331
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t8, t15, t22, t24, t25, t30, t31, t33, t34, t35, t38, t40, t42, t44, t45, t47, t4...266
(forward)formula 0,0,0.986218,44456,1,0,921,212253,168,275,2100,202712,985
FORMULA DoubleExponent-PT-002-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 106 transition count 86
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 94 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 91 transition count 83
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 30 place count 91 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 84 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 66 place count 73 transition count 65
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 73 transition count 65
Applied a total of 68 rules in 5 ms. Remains 73 /106 variables (removed 33) and now considering 65/98 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5519359022958128217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1551873902089371988.kers'
[2026-05-25 02:25:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5519359022958128217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1551873902089371988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 73 cols 207 entries
Finished phase 1 with 51 SingleSign rule and 11 generalized
[2026-05-25 02:25:17] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1551873902089371988.kers
Total runtime 2 ms.
[2026-05-25 02:25:17] [INFO ] Implicit Places using invariants in 53 ms returned [48, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/106 places, 65/98 transitions.
Graph (complete) has 151 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 69 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 69 transition count 63
Applied a total of 3 rules in 2 ms. Remains 69 /71 variables (removed 2) and now considering 63/65 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8768748832728223505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8254016289362217180.kers'
[2026-05-25 02:25:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8768748832728223505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8254016289362217180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 69 cols 195 entries
Finished phase 1 with 52 SingleSign rule and 8 generalized
[2026-05-25 02:25:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8254016289362217180.kers
Total runtime 0 ms.
[2026-05-25 02:25:17] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 02:25:17] [INFO ] Invariant cache hit.
[2026-05-25 02:25:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 02:25:17] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 69/106 places, 63/98 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 177 ms. Remains : 69/106 places, 63/98 transitions.
[2026-05-25 02:25:17] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:17] [INFO ] Input system was already deterministic with 63 transitions.
[2026-05-25 02:25:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15496677230287632081.gal : 1 ms
[2026-05-25 02:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability146473084823296185.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/CTLFireability15496677230287632081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability146473084823296185.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,2252,0.055811,6520,2,1794,5,10847,6,0,341,10361,0


Converting to forward existential form...Done !
original formula: AG(EF((((AG((p65<1)) + (p55<1)) + (p61<1)) * (((EF(((p40<1)||(p8<1))) * (p107>=1)) * (p83>=1)) + (!(A(((p55>=1)&&(p87>=1)) U (p62>=1))) *...209
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((!(E(TRUE U !((p65<1)))) + (p55<1)) + (p61<1)) * (((E(TRUE U ((p40<1)||(p8<1)))...401
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t8, t14, t21, t24, t28, t30, t33, t35, t36, t37, t39, t41, t43, t45, t47, t49, t5...261
(forward)formula 0,1,0.929176,43696,1,0,879,207529,173,209,2220,188836,937
FORMULA DoubleExponent-PT-002-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (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-11415311862431780875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17088225807080509065.kers'
[2026-05-25 02:25:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11415311862431780875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17088225807080509065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:25:18] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17088225807080509065.kers
Total runtime 0 ms.
[2026-05-25 02:25:18] [INFO ] Implicit Places using invariants in 50 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-745383911853392912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7488582324937660550.kers'
[2026-05-25 02:25:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-745383911853392912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7488582324937660550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:25:18] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7488582324937660550.kers
Total runtime 0 ms.
[2026-05-25 02:25:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 02:25:18] [INFO ] Invariant cache hit.
[2026-05-25 02:25:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 103/106 places, 97/98 transitions.
[2026-05-25 02:25:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:19] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:19] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 02:25:19] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:19] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3351052025694729345.gal : 1 ms
[2026-05-25 02:25:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15824997891627077215.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/CTLFireability3351052025694729345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15824997891627077215.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,3708,0.102546,8744,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((p85<1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((p85<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,1,2.09615,80540,1,0,1064,279761,219,105,3252,242803,1097
FORMULA DoubleExponent-PT-002-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 98/98 (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-1620104966641247116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12638145741197809576.kers'
[2026-05-25 02:25:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1620104966641247116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12638145741197809576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:25:21] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12638145741197809576.kers
Total runtime 1 ms.
[2026-05-25 02:25:21] [INFO ] Implicit Places using invariants in 67 ms returned [73, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17778093327434622599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11031148423008371165.kers'
[2026-05-25 02:25:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17778093327434622599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11031148423008371165.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:25:21] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11031148423008371165.kers
Total runtime 0 ms.
[2026-05-25 02:25:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 02:25:21] [INFO ] Invariant cache hit.
[2026-05-25 02:25:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/106 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 103/106 places, 97/98 transitions.
[2026-05-25 02:25:21] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:25:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:25:21] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-25 02:25:21] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:25:21] [INFO ] Flatten gal took : 2 ms
[2026-05-25 02:25:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4071335338674558521.gal : 1 ms
[2026-05-25 02:25:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4335310783026890278.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/CTLFireability4071335338674558521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4335310783026890278.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,3708,0.110074,8716,2,4197,5,18582,6,0,510,16252,0


Converting to forward existential form...Done !
original formula: A(!(((EX(TRUE) + E((p39>=1) U ((AG((p103>=1)) * (p48>=1)) * (p54>=1)))) * (p47>=1))) U (p39>=1))
=> equivalent forward existential formula: [((Init * !(EG(!((p39>=1))))) * !(E(!((p39>=1)) U (!(!(((EX(TRUE) + E((p39>=1) U ((!(E(TRUE U !((p103>=1)))) * (...219
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t12, t17, t23, t30, t36, t46, t53, t57, t62, t65, t68, t69, t74, t75, t81, t82, t85,...269
(forward)formula 0,0,3.06941,117184,1,0,1229,552668,229,201,3103,446680,1291
FORMULA DoubleExponent-PT-002-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-25 02:25:24] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:25:24] [INFO ] Flatten gal took : 3 ms
Total runtime 84166 ms.

BK_STOP 1779675924693

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r098-tall-177955695800858"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;