About the Execution of ITS-Tools for DLCround-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 423.808 | 261137.00 | 320572.00 | 10283.90 | FFFFTTTFFTTTTTFF | 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-177955695700618.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 DLCround-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700618
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.4K Mar 6 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 6 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 6 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 6 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 6 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 6 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:26 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 660K 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 DLCround-PT-10a-CTLFireability-2024-00
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-01
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-02
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-03
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-04
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-05
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-06
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-07
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-08
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-09
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-10
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-11
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-12
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-13
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-14
FORMULA_NAME DLCround-PT-10a-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779640746629
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 16:39:07] [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-24 16:39:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 16:39:08] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2026-05-24 16:39:08] [INFO ] Transformed 337 places.
[2026-05-24 16:39:08] [INFO ] Transformed 2605 transitions.
[2026-05-24 16:39:08] [INFO ] Found NUPN structural information;
[2026-05-24 16:39:08] [INFO ] Parsed PT model containing 337 places and 2605 transitions and 10130 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
Support contains 129 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 2358/2358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 328 transition count 2230
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 328 transition count 2230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 328 transition count 2227
Drop transitions (Redundant composition of simpler transitions.) removed 788 transitions
Redundant transition composition rules discarded 788 transitions
Iterating global reduction 1 with 788 rules applied. Total rules applied 809 place count 328 transition count 1439
Applied a total of 809 rules in 118 ms. Remains 328 /337 variables (removed 9) and now considering 1439/2358 (removed 919) transitions.
[2026-05-24 16:39:08] [INFO ] Flow matrix only has 206 transitions (discarded 1233 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4552171103679098975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6182399646872736410.kers'
[2026-05-24 16:39:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4552171103679098975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6182399646872736410.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 198 columns.
Culled 198 columns in 0 ms.
// Phase 1: matrix 205 rows 130 cols 424 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 16:39:08] [INFO ] Computed 213 invariants in 1 ms
Computed 213 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6182399646872736410.kers
Total runtime 2 ms.
[2026-05-24 16:39:09] [INFO ] Implicit Places using invariants in 1083 ms returned [130, 131, 132, 137, 138, 140, 142, 143, 144, 145, 146, 148, 149, 151, 152, 153, 154, 155, 156, 158, 160, 161, 162, 164, 165, 167, 170, 171, 172, 173, 178, 179, 180, 181, 182, 183, 187, 188, 189, 190, 191, 192, 194, 195, 196, 198, 199, 200, 201, 202, 203, 205, 207, 208, 213, 214, 216, 218, 219, 220, 222, 224, 225, 226, 227, 228, 229, 230, 232, 234, 235, 238, 239, 240, 241, 242, 246, 247, 249, 250, 252, 253, 254, 257, 260, 261, 262, 263, 264, 265, 266, 267, 270, 271, 273, 277, 279, 280, 281, 284, 285, 286, 289, 290, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 304, 305, 307, 309, 311, 312, 313, 315, 317, 319, 320, 325, 326]
Discarding 128 places :
Ensure Unique test removed 707 transitions
Reduce isomorphic transitions removed 707 transitions.
Implicit Place search using SMT only with invariants took 1126 ms to find 128 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/337 places, 732/2358 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 454 transitions
Redundant transition composition rules discarded 454 transitions
Iterating global reduction 0 with 454 rules applied. Total rules applied 454 place count 200 transition count 278
Applied a total of 454 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 278/732 (removed 454) transitions.
[2026-05-24 16:39:09] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9154634104514777221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9237103952380097060.kers'
[2026-05-24 16:39:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9154634104514777221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9237103952380097060.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 70 columns.
Culled 70 columns in 0 ms.
// Phase 1: matrix 205 rows 130 cols 424 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 16:39:09] [INFO ] Computed 85 invariants in 0 ms
Computed 85 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9237103952380097060.kers
Total runtime 1 ms.
[2026-05-24 16:39:09] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 16:39:09] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
[2026-05-24 16:39:09] [INFO ] Invariant cache hit.
[2026-05-24 16:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:39:09] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 200/337 places, 278/2358 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1590 ms. Remains : 200/337 places, 278/2358 transitions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2026-05-24 16:39:09] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
[2026-05-24 16:39:09] [INFO ] Invariant cache hit.
[2026-05-24 16:39:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 16:39:09] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
[2026-05-24 16:39:09] [INFO ] Invariant cache hit.
[2026-05-24 16:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:39:09] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2026-05-24 16:39:10] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
[2026-05-24 16:39:10] [INFO ] Invariant cache hit.
[2026-05-24 16:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 70/200 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 205/405 variables, 200/285 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 286 constraints, problems are : Problem set: 0 solved, 277 unsolved in 18292 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 70/200 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 205/405 variables, 200/285 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 277/562 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 1/406 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 563 constraints, problems are : Problem set: 0 solved, 277 unsolved in 19598 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37967ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 37987ms
Finished structural reductions in LTL mode , in 1 iterations and 38174 ms. Remains : 200/200 places, 278/278 transitions.
Support contains 129 out of 200 places after structural reductions.
[2026-05-24 16:39:48] [INFO ] Flatten gal took : 45 ms
[2026-05-24 16:39:48] [INFO ] Flatten gal took : 29 ms
[2026-05-24 16:39:48] [INFO ] Input system was already deterministic with 278 transitions.
Support contains 128 out of 200 places (down from 129) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1245 ms. (32 steps per ms) remains 3/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 2/3 properties
[2026-05-24 16:39:48] [INFO ] Flow matrix only has 206 transitions (discarded 72 similar events)
[2026-05-24 16:39:48] [INFO ] Invariant cache hit.
[2026-05-24 16:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp44 is UNSAT
After SMT solving in domain Real declared 44/406 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 7/85 constraints, State Equation: 0/200 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA DLCround-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 16:39:49] [INFO ] Flatten gal took : 11 ms
[2026-05-24 16:39:49] [INFO ] Flatten gal took : 11 ms
[2026-05-24 16:39:49] [INFO ] Input system was already deterministic with 278 transitions.
Computed a total of 71 stabilizing places and 1 stable transitions
Graph (complete) has 362 edges and 200 vertex of which 130 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 135 transition count 278
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 85 place count 115 transition count 238
Iterating global reduction 1 with 20 rules applied. Total rules applied 105 place count 115 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 115 transition count 237
Applied a total of 106 rules in 6 ms. Remains 115 /200 variables (removed 85) and now considering 237/278 (removed 41) transitions.
[2026-05-24 16:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3303066798715149532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11317186945581357254.kers'
[2026-05-24 16:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3303066798715149532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11317186945581357254.kers]
Normalized transition count is 184 out of 185 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 184 rows 110 cols 382 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-24 16:39:49] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11317186945581357254.kers
Total runtime 0 ms.
[2026-05-24 16:39:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 16:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2026-05-24 16:39:49] [INFO ] Invariant cache hit.
[2026-05-24 16:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:39:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-24 16:39:49] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
[2026-05-24 16:39:49] [INFO ] Invariant cache hit.
[2026-05-24 16:39:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 5/115 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/299 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 136 constraints, problems are : Problem set: 0 solved, 236 unsolved in 11331 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 5/115 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 184/299 variables, 115/135 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 236/371 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 1/300 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 372 constraints, problems are : Problem set: 0 solved, 236 unsolved in 9853 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21200ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 21202ms
Starting structural reductions in LTL mode, iteration 1 : 115/200 places, 237/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21312 ms. Remains : 115/200 places, 237/278 transitions.
[2026-05-24 16:40:10] [INFO ] Flatten gal took : 12 ms
[2026-05-24 16:40:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:10] [INFO ] Input system was already deterministic with 237 transitions.
[2026-05-24 16:40:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5595349218760003319.gal : 10 ms
[2026-05-24 16:40:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14130723122943418744.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5595349218760003319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14130723122943418744.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,6.44245e+12,0.033913,4828,2,324,5,1302,6,0,631,934,0
Converting to forward existential form...Done !
original formula: EG(AF(((EG(((p97==0)||(p323==0))) * AG((((p18==0)||(p159==0))||((p103==0)||(p297==0))))) * (EX(((p7==0)||(p195==0))) + EF(((p48==0)||(p15...166
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((EG(((p97==0)||(p323==0))) * !(E(TRUE U !((((p18==0)||(p159==0))||((p103==0)||(p297==0)))))))...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.100705,7268,1,0,9,17047,25,1,2779,3181,14
FORMULA DLCround-PT-10a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Graph (trivial) has 247 edges and 200 vertex of which 105 / 200 are part of one of the 14 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Graph (complete) has 151 edges and 109 vertex of which 44 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 0 output 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 3 place count 44 transition count 66
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 43 transition count 62
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13 place count 39 transition count 61
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 24 place count 28 transition count 47
Iterating global reduction 3 with 11 rules applied. Total rules applied 35 place count 28 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 28 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 27 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 42 place count 27 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 43 place count 27 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 44 place count 26 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 45 place count 26 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 46 place count 26 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 47 place count 26 transition count 38
Applied a total of 47 rules in 25 ms. Remains 26 /200 variables (removed 174) and now considering 38/278 (removed 240) transitions.
[2026-05-24 16:40:10] [INFO ] Flow matrix only has 24 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10169122250223511560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10903084265672883059.kers'
[2026-05-24 16:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10169122250223511560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10903084265672883059.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 23 rows 20 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 16:40:10] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10903084265672883059.kers
Total runtime 0 ms.
[2026-05-24 16:40:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 16:40:10] [INFO ] Flow matrix only has 24 transitions (discarded 14 similar events)
[2026-05-24 16:40:10] [INFO ] Invariant cache hit.
[2026-05-24 16:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:40:10] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-24 16:40:10] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-24 16:40:10] [INFO ] Flow matrix only has 24 transitions (discarded 14 similar events)
[2026-05-24 16:40:10] [INFO ] Invariant cache hit.
[2026-05-24 16:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 5/26 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 23/49 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 39 constraints, problems are : Problem set: 0 solved, 37 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 5/26 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 23/49 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 1/50 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/50 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 76 constraints, problems are : Problem set: 0 solved, 37 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/200 places, 38/278 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1308 ms. Remains : 26/200 places, 38/278 transitions.
[2026-05-24 16:40:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:40:11] [INFO ] Input system was already deterministic with 38 transitions.
[2026-05-24 16:40:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:40:11] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:40:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3333229575641617362.gal : 1 ms
[2026-05-24 16:40:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9898947993802439526.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/CTLFireability3333229575641617362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9898947993802439526.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,649,0.004469,3940,2,66,5,223,6,0,112,146,0
Converting to forward existential form...Done !
original formula: AG(((!(E(((((p127==1)&&(p215==1))||((p106==1)&&(p202==1)))&&(!((p21==1)&&(p224==1)))) U (p136!=1))) + EG(((p32==0)||(p144==0)))) + AG(((p...176
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((!(E(((((p127==1)&&(p215==1))||((p106==1)&&(p202==1)))&&(!((p21==1)&&(p224==1)))) U ...240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 24/5/14
(forward)formula 0,0,0.012258,4448,1,0,16,1414,29,6,605,1206,14
FORMULA DLCround-PT-10a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 131 transition count 278
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 90 place count 110 transition count 236
Iterating global reduction 1 with 21 rules applied. Total rules applied 111 place count 110 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 110 transition count 235
Applied a total of 112 rules in 9 ms. Remains 110 /200 variables (removed 90) and now considering 235/278 (removed 43) transitions.
[2026-05-24 16:40:11] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5836149682065944430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6284255870469113509.kers'
[2026-05-24 16:40:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5836149682065944430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6284255870469113509.kers]
Normalized transition count is 183 out of 184 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 183 rows 109 cols 380 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-24 16:40:11] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6284255870469113509.kers
Total runtime 0 ms.
[2026-05-24 16:40:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 16:40:12] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:40:12] [INFO ] Invariant cache hit.
[2026-05-24 16:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:40:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 16:40:12] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:40:12] [INFO ] Invariant cache hit.
[2026-05-24 16:40:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/294 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 127 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10493 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 234/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 361 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9341 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19854ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 19855ms
Starting structural reductions in LTL mode, iteration 1 : 110/200 places, 235/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19980 ms. Remains : 110/200 places, 235/278 transitions.
[2026-05-24 16:40:31] [INFO ] Flatten gal took : 10 ms
[2026-05-24 16:40:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:31] [INFO ] Input system was already deterministic with 235 transitions.
[2026-05-24 16:40:31] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:40:31] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2270828608789062409.gal : 4 ms
[2026-05-24 16:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1112016940180988644.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/CTLFireability2270828608789062409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1112016940180988644.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,5.36871e+12,0.025009,4872,2,313,5,1263,6,0,622,915,0
Converting to forward existential form...Done !
original formula: EF(AX(AX(AG(((p33==0)||(p230==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !(((p33==0)||(p230==0))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.071046,6764,1,0,6,13903,15,0,2586,1550,5
FORMULA DLCround-PT-10a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 133 transition count 278
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 86 place count 114 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 105 place count 114 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 114 transition count 239
Applied a total of 106 rules in 14 ms. Remains 114 /200 variables (removed 86) and now considering 239/278 (removed 39) transitions.
[2026-05-24 16:40:32] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14370437902685088315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-572641521278468316.kers'
[2026-05-24 16:40:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14370437902685088315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-572641521278468316.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 185 rows 111 cols 384 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-24 16:40:32] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-572641521278468316.kers
Total runtime 1 ms.
[2026-05-24 16:40:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 16:40:32] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:40:32] [INFO ] Invariant cache hit.
[2026-05-24 16:40:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:40:32] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-24 16:40:32] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:40:32] [INFO ] Invariant cache hit.
[2026-05-24 16:40:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/114 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/299 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 133 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10845 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/114 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/299 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 238/370 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 1/300 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 371 constraints, problems are : Problem set: 0 solved, 238 unsolved in 9676 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20532ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 20532ms
Starting structural reductions in LTL mode, iteration 1 : 114/200 places, 239/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20694 ms. Remains : 114/200 places, 239/278 transitions.
[2026-05-24 16:40:52] [INFO ] Flatten gal took : 12 ms
[2026-05-24 16:40:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:40:52] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-24 16:40:52] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:40:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:40:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14547970100126308534.gal : 1 ms
[2026-05-24 16:40:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1737111850072095864.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/CTLFireability14547970100126308534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1737111850072095864.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,7.24776e+12,0.025015,4892,2,323,5,1305,6,0,634,939,0
Converting to forward existential form...Done !
original formula: EG(AX(EF((((p96==1)&&(p292==1)) * (EX(((p18==1)&&(p183==1))) + ((p84==1)&&(p184==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U (((p96==1)&&(p292==1)) * (EX(((p18==1)&&(p183==1))) + ((p84==1)&&(p184==1)))))))))] !...162
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.100081,7460,1,0,12,17335,20,3,2955,4034,14
FORMULA DLCround-PT-10a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Graph (trivial) has 267 edges and 200 vertex of which 121 / 200 are part of one of the 15 SCC in 1 ms
Free SCC test removed 106 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Graph (complete) has 119 edges and 94 vertex of which 25 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.0 ms
Discarding 69 places :
Also discarding 0 output 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 3 place count 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 34
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 18 place count 10 transition count 19
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 10 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 9 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 9 transition count 15
Applied a total of 38 rules in 5 ms. Remains 9 /200 variables (removed 191) and now considering 15/278 (removed 263) transitions.
[2026-05-24 16:40:52] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10597015610929987612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7777947350698830616.kers'
[2026-05-24 16:40:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10597015610929987612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7777947350698830616.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 16:40:52] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7777947350698830616.kers
Total runtime 0 ms.
[2026-05-24 16:40:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 16:40:52] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2026-05-24 16:40:52] [INFO ] Invariant cache hit.
[2026-05-24 16:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:40:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2026-05-24 16:40:52] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-24 16:40:52] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2026-05-24 16:40:52] [INFO ] Invariant cache hit.
[2026-05-24 16:40:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/19 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/19 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/200 places, 15/278 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 338 ms. Remains : 9/200 places, 15/278 transitions.
[2026-05-24 16:40:53] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:40:53] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:40:53] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-24 16:40:53] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:40:53] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:40:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4971973339992107636.gal : 0 ms
[2026-05-24 16:40:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16109602573349887464.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/CTLFireability4971973339992107636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16109602573349887464.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,7,0.003381,3800,2,18,5,70,6,0,42,43,0
Converting to forward existential form...Done !
original formula: AG(EF(((p137==1)&&(p219==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p137==1)&&(p219==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005515,4068,1,0,6,156,14,0,179,85,5
FORMULA DLCround-PT-10a-CTLFireability-2024-05 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 : 200/200 places, 278/278 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 139 transition count 278
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 78 place count 122 transition count 244
Iterating global reduction 1 with 17 rules applied. Total rules applied 95 place count 122 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 122 transition count 243
Applied a total of 96 rules in 3 ms. Remains 122 /200 variables (removed 78) and now considering 243/278 (removed 35) transitions.
[2026-05-24 16:40:53] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16007658774856847787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6690453284260988300.kers'
[2026-05-24 16:40:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16007658774856847787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6690453284260988300.kers]
Normalized transition count is 187 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 187 rows 113 cols 388 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-24 16:40:53] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6690453284260988300.kers
Total runtime 1 ms.
[2026-05-24 16:40:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 16:40:53] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
[2026-05-24 16:40:53] [INFO ] Invariant cache hit.
[2026-05-24 16:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:40:53] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 16:40:53] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
[2026-05-24 16:40:53] [INFO ] Invariant cache hit.
[2026-05-24 16:40:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 9/122 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 187/309 variables, 122/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 147 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11711 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 9/122 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 187/309 variables, 122/146 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 242/388 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/310 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 389 constraints, problems are : Problem set: 0 solved, 242 unsolved in 10421 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 122/122 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22150ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 22150ms
Starting structural reductions in LTL mode, iteration 1 : 122/200 places, 243/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22263 ms. Remains : 122/200 places, 243/278 transitions.
[2026-05-24 16:41:15] [INFO ] Flatten gal took : 10 ms
[2026-05-24 16:41:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:41:15] [INFO ] Input system was already deterministic with 243 transitions.
[2026-05-24 16:41:15] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:41:15] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:41:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6262533947634530918.gal : 1 ms
[2026-05-24 16:41:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10423040328732191781.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/CTLFireability6262533947634530918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10423040328732191781.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,9.17294e+12,0.026545,4920,2,341,5,1370,6,0,650,976,0
Converting to forward existential form...Done !
original formula: E(AG((E(EG(((p82==1)&&(p283==1))) U EF(((p11==1)&&(p221==1)))) + !(((!((p88==1)&&(p277==1)))||((p126==1)&&(p319==1)))))) U ((AG(!((((p97=...280
=> equivalent forward existential formula: (([(FwdU(Init,!(E(TRUE U !((E(EG(((p82==1)&&(p283==1))) U E(TRUE U ((p11==1)&&(p221==1)))) + !(((!((p88==1)&&(p2...688
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.110617,8020,1,0,13,19605,31,5,3096,5108,20
FORMULA DLCround-PT-10a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 137 transition count 278
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 80 place count 120 transition count 244
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 120 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 120 transition count 243
Applied a total of 98 rules in 3 ms. Remains 120 /200 variables (removed 80) and now considering 243/278 (removed 35) transitions.
[2026-05-24 16:41:15] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12025940182926482130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8886227670482709828.kers'
[2026-05-24 16:41:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12025940182926482130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8886227670482709828.kers]
Normalized transition count is 187 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 187 rows 113 cols 388 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-24 16:41:15] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8886227670482709828.kers
Total runtime 0 ms.
[2026-05-24 16:41:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 16:41:15] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
[2026-05-24 16:41:15] [INFO ] Invariant cache hit.
[2026-05-24 16:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:41:15] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 16:41:15] [INFO ] Flow matrix only has 188 transitions (discarded 55 similar events)
[2026-05-24 16:41:15] [INFO ] Invariant cache hit.
[2026-05-24 16:41:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 7/120 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 187/307 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11403 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 7/120 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 187/307 variables, 120/142 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 242/384 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/308 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 385 constraints, problems are : Problem set: 0 solved, 242 unsolved in 10231 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21648ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 21648ms
Starting structural reductions in LTL mode, iteration 1 : 120/200 places, 243/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21749 ms. Remains : 120/200 places, 243/278 transitions.
[2026-05-24 16:41:37] [INFO ] Flatten gal took : 10 ms
[2026-05-24 16:41:37] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:41:37] [INFO ] Input system was already deterministic with 243 transitions.
[2026-05-24 16:41:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:41:37] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:41:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8475849193336934147.gal : 1 ms
[2026-05-24 16:41:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11363246630918123427.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/CTLFireability8475849193336934147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11363246630918123427.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,8.59963e+12,0.025772,4916,2,337,5,1357,6,0,648,971,0
Converting to forward existential form...Done !
original formula: EF((A((((!((p114==1)&&(p315==1)))||((p66==1)&&(p260==1)))||((p136==1)&&(p332==1))) U EX(((p61==1)&&(p257==1)))) * AX((((((p132!=1)||(p226...210
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!(EX(((p61==1)&&(p257==1)))) U (!((((!((p114==1)&&(p315==1)))||((p66==1)&&(p260==1)))|...347
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.076556,7040,1,0,6,17443,11,0,2544,2690,4
FORMULA DLCround-PT-10a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 131 transition count 278
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 90 place count 110 transition count 236
Iterating global reduction 1 with 21 rules applied. Total rules applied 111 place count 110 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 110 transition count 235
Applied a total of 112 rules in 2 ms. Remains 110 /200 variables (removed 90) and now considering 235/278 (removed 43) transitions.
[2026-05-24 16:41:37] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2729987595132287066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4563413512746956051.kers'
[2026-05-24 16:41:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2729987595132287066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4563413512746956051.kers]
Normalized transition count is 183 out of 184 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 183 rows 109 cols 380 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-24 16:41:37] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4563413512746956051.kers
Total runtime 0 ms.
[2026-05-24 16:41:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 16:41:37] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:41:37] [INFO ] Invariant cache hit.
[2026-05-24 16:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:41:37] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 16:41:37] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:41:37] [INFO ] Invariant cache hit.
[2026-05-24 16:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/294 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 127 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10772 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/293 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 234/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 361 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9314 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20109ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 20110ms
Starting structural reductions in LTL mode, iteration 1 : 110/200 places, 235/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20216 ms. Remains : 110/200 places, 235/278 transitions.
[2026-05-24 16:41:57] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:41:57] [INFO ] Flatten gal took : 9 ms
[2026-05-24 16:41:57] [INFO ] Input system was already deterministic with 235 transitions.
[2026-05-24 16:41:57] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:41:57] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2252803963848350547.gal : 1 ms
[2026-05-24 16:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4478734361894265789.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/CTLFireability2252803963848350547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4478734361894265789.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,5.36871e+12,0.026316,4876,2,313,5,1263,6,0,622,915,0
Converting to forward existential form...Done !
original formula: AG(EX(EX(((p88==1)&&(p285==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX(((p88==1)&&(p285==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.073837,6856,1,0,9,15540,10,2,2396,2729,5
FORMULA DLCround-PT-10a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 134 transition count 278
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 87 place count 113 transition count 236
Iterating global reduction 1 with 21 rules applied. Total rules applied 108 place count 113 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 113 transition count 235
Applied a total of 109 rules in 2 ms. Remains 113 /200 variables (removed 87) and now considering 235/278 (removed 43) transitions.
[2026-05-24 16:41:57] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16751971702030342254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11669440525097084776.kers'
[2026-05-24 16:41:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16751971702030342254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11669440525097084776.kers]
Normalized transition count is 183 out of 184 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 183 rows 109 cols 380 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-24 16:41:57] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11669440525097084776.kers
Total runtime 0 ms.
[2026-05-24 16:41:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 16:41:57] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:41:57] [INFO ] Invariant cache hit.
[2026-05-24 16:41:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:41:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 16:41:58] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
[2026-05-24 16:41:58] [INFO ] Invariant cache hit.
[2026-05-24 16:41:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/113 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/296 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/297 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 133 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10594 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/113 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 183/296 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 234/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/297 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 367 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9684 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20296ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 20296ms
Starting structural reductions in LTL mode, iteration 1 : 113/200 places, 235/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20399 ms. Remains : 113/200 places, 235/278 transitions.
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 12 ms
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:42:18] [INFO ] Input system was already deterministic with 235 transitions.
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 16:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16110452120504864346.gal : 2 ms
[2026-05-24 16:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability67636680852357237.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/CTLFireability16110452120504864346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability67636680852357237.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.36871e+12,0.025534,4876,2,319,5,1281,6,0,625,924,0
Converting to forward existential form...Done !
original formula: AG((EX((((p43==0)||(p246==0))||((p37==0)||(p145==0)))) + (((p126==1)&&(p325==1))&&((p21==1)&&(p184==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((((p126==1)&&(p325==1))&&((p21==1)&&(p184==1))))) * !(EX((((p43==0)||(p246==0))||((p37==0...181
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.073865,6796,1,0,6,15708,10,0,2426,2435,4
FORMULA DLCround-PT-10a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Graph (trivial) has 274 edges and 200 vertex of which 128 / 200 are part of one of the 15 SCC in 1 ms
Free SCC test removed 113 places
Ensure Unique test removed 259 transitions
Reduce isomorphic transitions removed 259 transitions.
Graph (complete) has 103 edges and 87 vertex of which 18 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.0 ms
Discarding 69 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 5 transition count 6
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 5 transition count 6
Applied a total of 28 rules in 3 ms. Remains 5 /200 variables (removed 195) and now considering 6/278 (removed 272) transitions.
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1819027064501380442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2007303724765735204.kers'
[2026-05-24 16:42:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1819027064501380442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2007303724765735204.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 16:42:18] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2007303724765735204.kers
Total runtime 0 ms.
[2026-05-24 16:42:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 16:42:18] [INFO ] Invariant cache hit.
[2026-05-24 16:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:42:18] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 16:42:18] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 16:42:18] [INFO ] Invariant cache hit.
[2026-05-24 16:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/200 places, 6/278 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 168 ms. Remains : 5/200 places, 6/278 transitions.
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 1 ms
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:42:18] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:42:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 16:42:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6094079269286659153.gal : 0 ms
[2026-05-24 16:42:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11333269235076819886.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/CTLFireability6094079269286659153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11333269235076819886.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3,0.001611,3748,2,10,5,30,6,0,20,16,0
Converting to forward existential form...Done !
original formula: AG(EF(((p25==0)||(p177==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p25==0)||(p177==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002615,4036,1,0,6,52,14,0,86,33,5
FORMULA DLCround-PT-10a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 139 transition count 278
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 80 place count 120 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 120 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 120 transition count 239
Applied a total of 100 rules in 2 ms. Remains 120 /200 variables (removed 80) and now considering 239/278 (removed 39) transitions.
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16581064358684911578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3136570927164411609.kers'
[2026-05-24 16:42:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16581064358684911578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3136570927164411609.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 185 rows 111 cols 384 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-24 16:42:18] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3136570927164411609.kers
Total runtime 0 ms.
[2026-05-24 16:42:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:42:18] [INFO ] Invariant cache hit.
[2026-05-24 16:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:42:18] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-24 16:42:18] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:42:18] [INFO ] Invariant cache hit.
[2026-05-24 16:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 9/120 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/305 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 145 constraints, problems are : Problem set: 0 solved, 238 unsolved in 11041 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 9/120 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/305 variables, 120/144 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 238/382 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 383 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10258 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 120/120 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21315ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 21315ms
Starting structural reductions in LTL mode, iteration 1 : 120/200 places, 239/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21416 ms. Remains : 120/200 places, 239/278 transitions.
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 7 ms
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:42:40] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:42:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2763159018073373735.gal : 1 ms
[2026-05-24 16:42:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15796785147993887161.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/CTLFireability2763159018073373735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15796785147993887161.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,7.24776e+12,0.025906,4900,2,335,5,1341,6,0,640,957,0
Converting to forward existential form...Done !
original formula: E(EG((!(((p18==1)&&(p175==1))) + AX(((p7==1)&&(p220==1))))) U AX(((AF((((p97==1)&&(p252==1))||((p46==1)&&(p150==1)))) + EX(((p76==1)&&(p1...278
=> equivalent forward existential formula: [(FwdU(Init,EG((!(((p18==1)&&(p175==1))) + !(EX(!(((p7==1)&&(p220==1)))))))) * !(EX(!(((!(EG(!((((p97==1)&&(p252...354
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.247195,14588,1,0,147,50148,41,97,3061,62419,152
FORMULA DLCround-PT-10a-CTLFireability-2024-11 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 : 200/200 places, 278/278 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 139 transition count 278
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 80 place count 120 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 120 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 120 transition count 239
Applied a total of 100 rules in 8 ms. Remains 120 /200 variables (removed 80) and now considering 239/278 (removed 39) transitions.
[2026-05-24 16:42:40] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3100949807413625685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13854330803496733158.kers'
[2026-05-24 16:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3100949807413625685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13854330803496733158.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 185 rows 111 cols 384 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-24 16:42:40] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13854330803496733158.kers
Total runtime 2 ms.
[2026-05-24 16:42:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 16:42:40] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:42:40] [INFO ] Invariant cache hit.
[2026-05-24 16:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:42:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 120/200 places, 239/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 120/200 places, 239/278 transitions.
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:42:40] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:42:40] [INFO ] Flatten gal took : 2 ms
[2026-05-24 16:42:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7592751384325476914.gal : 1 ms
[2026-05-24 16:42:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14025251731316769046.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/CTLFireability7592751384325476914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14025251731316769046.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,6.79477e+12,0.032242,4900,2,335,5,1339,6,0,640,955,0
Converting to forward existential form...Done !
original formula: AX(E(EF((((p14==1)&&(p206==1))&&((p101==1)&&(p297==1)))) U (!((((A(((p117==1)&&(p284==1)) U ((p7==1)&&(p220==1))) + ((p59==1)&&(p168==1))...266
=> equivalent forward existential formula: [(EY(Init) * !(E(E(TRUE U (((p14==1)&&(p206==1))&&((p101==1)&&(p297==1)))) U (!((((!((E(!(((p7==1)&&(p220==1))) ...388
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 232/0/7
(forward)formula 0,1,0.119842,8148,1,0,20,19586,34,7,3058,6463,19
FORMULA DLCround-PT-10a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 136 transition count 278
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 83 place count 117 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 102 place count 117 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 103 place count 117 transition count 239
Applied a total of 103 rules in 2 ms. Remains 117 /200 variables (removed 83) and now considering 239/278 (removed 39) transitions.
[2026-05-24 16:42:40] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17753180850323711642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16115117823107287892.kers'
[2026-05-24 16:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17753180850323711642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16115117823107287892.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 185 rows 111 cols 384 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-24 16:42:40] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16115117823107287892.kers
Total runtime 2 ms.
[2026-05-24 16:42:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 16:42:40] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:42:40] [INFO ] Invariant cache hit.
[2026-05-24 16:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:42:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-24 16:42:40] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
[2026-05-24 16:42:40] [INFO ] Invariant cache hit.
[2026-05-24 16:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 6/117 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/302 variables, 117/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 139 constraints, problems are : Problem set: 0 solved, 238 unsolved in 11408 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 6/117 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 185/302 variables, 117/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 238/376 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 377 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10073 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21494ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 21494ms
Starting structural reductions in LTL mode, iteration 1 : 117/200 places, 239/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21595 ms. Remains : 117/200 places, 239/278 transitions.
[2026-05-24 16:43:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:43:02] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:43:02] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-24 16:43:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:02] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11842903005989955851.gal : 1 ms
[2026-05-24 16:43:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10682409889941577035.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/CTLFireability11842903005989955851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10682409889941577035.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,6.79477e+12,0.031459,4900,2,329,5,1321,6,0,637,946,0
Converting to forward existential form...Done !
original formula: E(((!(((p57==1)&&(p253==1))) * !(AF(EG(((p129==1)&&(p333==1)))))) * EX(((EF(((p128==1)&&(p218==1))) + ((p53==1)&&(p252==1))) + ((p136!=1)...239
=> equivalent forward existential formula: [(EY((EY(EY(FwdU(Init,((!(((p57==1)&&(p253==1))) * !(!(EG(!(EG(((p129==1)&&(p333==1)))))))) * EX(((E(TRUE U ((p1...297
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.245273,13736,1,0,140,43056,44,89,3011,59940,144
FORMULA DLCround-PT-10a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 278/278 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 151 transition count 278
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 137 transition count 250
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 137 transition count 250
Applied a total of 77 rules in 4 ms. Remains 137 /200 variables (removed 63) and now considering 250/278 (removed 28) transitions.
[2026-05-24 16:43:02] [INFO ] Flow matrix only has 192 transitions (discarded 58 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12303041196185811624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2210861034471794422.kers'
[2026-05-24 16:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12303041196185811624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2210861034471794422.kers]
Normalized transition count is 191 out of 192 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 191 rows 116 cols 396 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-24 16:43:02] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2210861034471794422.kers
Total runtime 2 ms.
[2026-05-24 16:43:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 16:43:02] [INFO ] Flow matrix only has 192 transitions (discarded 58 similar events)
[2026-05-24 16:43:02] [INFO ] Invariant cache hit.
[2026-05-24 16:43:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 16:43:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-24 16:43:02] [INFO ] Flow matrix only has 192 transitions (discarded 58 similar events)
[2026-05-24 16:43:02] [INFO ] Invariant cache hit.
[2026-05-24 16:43:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 21/137 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 191/328 variables, 137/173 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 1/329 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 174 constraints, problems are : Problem set: 0 solved, 249 unsolved in 12839 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 21/137 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 191/328 variables, 137/173 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 249/422 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 1/329 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 423 constraints, problems are : Problem set: 0 solved, 249 unsolved in 11927 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24777ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 24777ms
Starting structural reductions in LTL mode, iteration 1 : 137/200 places, 250/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24902 ms. Remains : 137/200 places, 250/278 transitions.
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:27] [INFO ] Input system was already deterministic with 250 transitions.
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-24 16:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2403170283787793151.gal : 1 ms
[2026-05-24 16:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability18128921490934689794.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/CTLFireability2403170283787793151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18128921490934689794.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,1.27402e+13,0.02915,4976,2,374,5,1488,6,0,678,1042,0
Converting to forward existential form...Done !
original formula: (EF((AX(AG(A(((p54==1)&&(p254==1)) U ((p51==1)&&(p253==1))))) + ((((((AF((((p71==1)&&(p172==1))||((p85==1)&&(p281==1)))) + (((p43==1)&&(p...649
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EX(!(!(E(TRUE U !(!((E(!(((p51==1)&&(p253==1))) U (!(((p54==1)&&(p254==1))) * !(((p51==1...849
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 246/0/4
(forward)formula 0,0,0.141059,8864,1,0,16,25030,46,6,3271,7024,25
FORMULA DLCround-PT-10a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 16:43:27] [INFO ] Flatten gal took : 4 ms
Total runtime 259780 ms.
BK_STOP 1779641007766
--------------------
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="DLCround-PT-10a"
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 DLCround-PT-10a, 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-177955695700618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10a.tgz
mv DLCround-PT-10a 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 '
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 ;