About the Execution of ITS-Tools for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9838.584 | 3600000.00 | 3769349.00 | 7985.30 | ?F???T?TF??T?F?? | 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.r082-smll-177946993700370.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 DES-PT-10b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 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 79K 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 DES-PT-10b-CTLFireability-2024-00
FORMULA_NAME DES-PT-10b-CTLFireability-2024-01
FORMULA_NAME DES-PT-10b-CTLFireability-2024-02
FORMULA_NAME DES-PT-10b-CTLFireability-2024-03
FORMULA_NAME DES-PT-10b-CTLFireability-2024-04
FORMULA_NAME DES-PT-10b-CTLFireability-2024-05
FORMULA_NAME DES-PT-10b-CTLFireability-2024-06
FORMULA_NAME DES-PT-10b-CTLFireability-2024-07
FORMULA_NAME DES-PT-10b-CTLFireability-2024-08
FORMULA_NAME DES-PT-10b-CTLFireability-2024-09
FORMULA_NAME DES-PT-10b-CTLFireability-2024-10
FORMULA_NAME DES-PT-10b-CTLFireability-2024-11
FORMULA_NAME DES-PT-10b-CTLFireability-2024-12
FORMULA_NAME DES-PT-10b-CTLFireability-2024-13
FORMULA_NAME DES-PT-10b-CTLFireability-2024-14
FORMULA_NAME DES-PT-10b-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779672937474
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 01:35:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:35:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:35:40] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2026-05-25 01:35:40] [INFO ] Transformed 320 places.
[2026-05-25 01:35:40] [INFO ] Transformed 271 transitions.
[2026-05-25 01:35:40] [INFO ] Found NUPN structural information;
[2026-05-25 01:35:40] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 152 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 310 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 310 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 306 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 306 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 306 transition count 258
Applied a total of 27 rules in 164 ms. Remains 306 /320 variables (removed 14) and now considering 258/271 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4214264376817929659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6163217421891969360.kers'
[2026-05-25 01:35:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4214264376817929659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6163217421891969360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 306 cols 793 entries
Finished phase 1 with 171 SingleSign rule and 73 generalized
[2026-05-25 01:35:40] [INFO ] Computed 62 invariants in 4 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6163217421891969360.kers
Total runtime 6 ms.
[2026-05-25 01:35:41] [INFO ] Implicit Places using invariants in 626 ms returned []
[2026-05-25 01:35:41] [INFO ] Invariant cache hit.
[2026-05-25 01:35:41] [INFO ] Implicit Places using invariants and state equation in 531 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 305/320 places, 258/271 transitions.
Applied a total of 0 rules in 10 ms. Remains 305 /305 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1437 ms. Remains : 305/320 places, 258/271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Applied a total of 0 rules in 8 ms. Remains 305 /305 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14134606238675858024.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10140943265894691536.kers'
[2026-05-25 01:35:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14134606238675858024.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10140943265894691536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 305 cols 791 entries
Finished phase 1 with 180 SingleSign rule and 64 generalized
[2026-05-25 01:35:41] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10140943265894691536.kers
Total runtime 2 ms.
[2026-05-25 01:35:42] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-25 01:35:42] [INFO ] Invariant cache hit.
[2026-05-25 01:35:42] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-25 01:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/563 variables, 305/366 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/563 variables, and 419 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/563 variables, and 136 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in LTL mode , in 1 iterations and 61037 ms. Remains : 305/305 places, 258/258 transitions.
Support contains 152 out of 305 places after structural reductions.
[2026-05-25 01:36:43] [INFO ] Flatten gal took : 116 ms
[2026-05-25 01:36:43] [INFO ] Flatten gal took : 56 ms
[2026-05-25 01:36:43] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 150 out of 305 places (down from 152) after GAL structural reductions.
RANDOM walk for 40000 steps (342 resets) in 2090 ms. (19 steps per ms) remains 14/96 properties
BEST_FIRST walk for 40004 steps (58 resets) in 394 ms. (101 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (55 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 157 ms. (253 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (43 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 145 ms. (274 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (41 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (42 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (43 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (55 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (41 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (43 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (56 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
[2026-05-25 01:36:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 115/138 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 57/195 variables, 15/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 89/284 variables, 25/59 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/288 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 244/532 variables, 288/349 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 2/351 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 21/553 variables, 12/363 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 6/369 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 12/381 constraints. Problems are: Problem set: 1 solved, 13 unsolved
SMT process timed out in 5157ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 300 transition count 236
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 283 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 37 place count 283 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 275 transition count 228
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 68 place count 260 transition count 213
Iterating global reduction 2 with 15 rules applied. Total rules applied 83 place count 260 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 260 transition count 211
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 95 place count 250 transition count 201
Iterating global reduction 3 with 10 rules applied. Total rules applied 105 place count 250 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 10 rules applied. Total rules applied 115 place count 250 transition count 191
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 117 place count 249 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 117 place count 249 transition count 188
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 121 place count 247 transition count 188
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 261 place count 177 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 265 place count 175 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 174 transition count 119
Applied a total of 266 rules in 161 ms. Remains 174 /305 variables (removed 131) and now considering 119/258 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 174/305 places, 119/258 transitions.
RANDOM walk for 40000 steps (1225 resets) in 1155 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (260 resets) in 361 ms. (110 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (262 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (236 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (239 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (245 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (254 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (243 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (250 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (255 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (256 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (259 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (253 resets) in 90 ms. (439 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (295 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 549648 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 12
Probabilistic random walk after 549648 steps, saw 76574 distinct states, run finished after 3008 ms. (steps per millisecond=182 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9797045275184879936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2684225060411006191.kers'
[2026-05-25 01:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9797045275184879936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2684225060411006191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 174 cols 559 entries
Finished phase 1 with 41 SingleSign rule and 72 generalized
[2026-05-25 01:36:54] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2684225060411006191.kers
Total runtime 2 ms.
[2026-05-25 01:36:54] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp91 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/73 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 41/114 variables, 16/40 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 50/164 variables, 24/64 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 119/283 variables, 164/228 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 8/236 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 10/293 variables, 10/247 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/293 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 247 constraints, problems are : Problem set: 1 solved, 11 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 174/174 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 36/53 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 61/114 variables, 23/38 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 50/164 variables, 24/64 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 119/283 variables, 164/231 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 8/239 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 10/249 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/250 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 3/253 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 10/293 variables, 10/263 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/293 variables, 0/263 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/293 variables, 0/263 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 263 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5660 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 174/174 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 10/12 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7654ms problems are : Problem set: 2 solved, 10 unsolved
Parikh walk visited 0 properties in 8784 ms.
Support contains 15 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 119/119 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 172 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 172 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 171 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 167 transition count 112
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 167 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 166 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 166 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 165 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 164 transition count 110
Applied a total of 19 rules in 43 ms. Remains 164 /174 variables (removed 10) and now considering 110/119 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 164/174 places, 110/119 transitions.
RANDOM walk for 40000 steps (1517 resets) in 325 ms. (122 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (325 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (322 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (294 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (299 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (272 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (278 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (332 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (306 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (302 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (293 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 573583 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 10
Probabilistic random walk after 573583 steps, saw 81914 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3869125758433508374.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5390096444790276970.kers'
[2026-05-25 01:37:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869125758433508374.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5390096444790276970.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 110 rows 158 cols 491 entries
Finished phase 1 with 49 SingleSign rule and 55 generalized
[2026-05-25 01:37:14] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5390096444790276970.kers
Total runtime 1 ms.
[2026-05-25 01:37:14] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/78 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 58/136 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/143 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2/145 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 98/244 variables, 146/203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 9/253 variables, 6/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 12/265 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/265 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 9/274 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/274 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/274 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 231 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/78 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 58/136 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/143 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 2/145 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/146 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 98/244 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 9/253 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/253 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/253 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 12/265 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/265 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/265 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/265 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 9/274 variables, 9/244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/274 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 0/274 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 244 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7478 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9157ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 7158 ms.
Support contains 15 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-25 01:37:30] [INFO ] Invariant cache hit.
[2026-05-25 01:37:30] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-25 01:37:30] [INFO ] Invariant cache hit.
[2026-05-25 01:37:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 01:37:31] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2026-05-25 01:37:31] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-25 01:37:31] [INFO ] Invariant cache hit.
[2026-05-25 01:37:31] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 2/163 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/273 variables, 163/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 0/274 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 234 constraints, problems are : Problem set: 0 solved, 107 unsolved in 12403 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 164/164 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 2/163 variables, 26/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 110/273 variables, 163/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 107/340 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
SMT process timed out in 42440ms, After SMT, problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 42441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42956 ms. Remains : 164/164 places, 110/110 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 110
Applied a total of 1 rules in 12 ms. Remains 164 /164 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Running SMT prover for 10 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7242923997150853560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-663141034238583697.kers'
[2026-05-25 01:38:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7242923997150853560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-663141034238583697.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 110 rows 158 cols 492 entries
Finished phase 1 with 49 SingleSign rule and 55 generalized
[2026-05-25 01:38:13] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-663141034238583697.kers
Total runtime 1 ms.
[2026-05-25 01:38:13] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2026-05-25 01:38:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2026-05-25 01:38:14] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
TRAPS : Iteration 0
[2026-05-25 01:38:14] [INFO ] After 193ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-25 01:38:14] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2026-05-25 01:38:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-25 01:38:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2026-05-25 01:38:14] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2026-05-25 01:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2026-05-25 01:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
TRAPS : Iteration 1
[2026-05-25 01:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
TRAPS : Iteration 2
[2026-05-25 01:38:15] [INFO ] After 1313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2026-05-25 01:38:15] [INFO ] After 1722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 2154 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-25 01:38:15] [INFO ] Flatten gal took : 47 ms
[2026-05-25 01:38:15] [INFO ] Flatten gal took : 36 ms
[2026-05-25 01:38:16] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 147 out of 305 places (down from 148) after GAL structural reductions.
Computed a total of 104 stabilizing places and 97 stable transitions
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 287 transition count 240
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 287 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 287 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 281 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 281 transition count 232
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 281 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 280 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 280 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 280 transition count 225
Applied a total of 58 rules in 50 ms. Remains 280 /305 variables (removed 25) and now considering 225/258 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11117231589265466708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6796191070632527292.kers'
[2026-05-25 01:38:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11117231589265466708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6796191070632527292.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 280 cols 709 entries
Finished phase 1 with 156 SingleSign rule and 63 generalized
[2026-05-25 01:38:16] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6796191070632527292.kers
Total runtime 2 ms.
[2026-05-25 01:38:16] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-25 01:38:16] [INFO ] Invariant cache hit.
[2026-05-25 01:38:16] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2026-05-25 01:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/505 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 387 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 13/120 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 14/134 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 225/505 variables, 280/418 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 224/642 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 642 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 280/305 places, 225/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60837 ms. Remains : 280/305 places, 225/258 transitions.
[2026-05-25 01:39:16] [INFO ] Flatten gal took : 24 ms
[2026-05-25 01:39:16] [INFO ] Flatten gal took : 24 ms
[2026-05-25 01:39:16] [INFO ] Input system was already deterministic with 225 transitions.
[2026-05-25 01:39:17] [INFO ] Flatten gal took : 22 ms
[2026-05-25 01:39:17] [INFO ] Flatten gal took : 18 ms
[2026-05-25 01:39:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3112366789171341151.gal : 9 ms
[2026-05-25 01:39:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3267166905303025197.ctl : 13 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/CTLFireability3112366789171341151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3267166905303025197.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.
Detected timeout of ITS tools.
[2026-05-25 01:39:47] [INFO ] Flatten gal took : 14 ms
[2026-05-25 01:39:47] [INFO ] Applying decomposition
[2026-05-25 01:39:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3242958909157107031.txt' '-o' '/tmp/graph3242958909157107031.bin' '-w' '/tmp/graph3242958909157107031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3242958909157107031.bin' '-l' '-1' '-v' '-w' '/tmp/graph3242958909157107031.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:39:47] [INFO ] Decomposing Gal with order
[2026-05-25 01:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:39:47] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-25 01:39:47] [INFO ] Flatten gal took : 96 ms
[2026-05-25 01:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 16 ms.
[2026-05-25 01:39:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14080764551684689284.gal : 11 ms
[2026-05-25 01:39:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1813908460610188724.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/CTLFireability14080764551684689284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1813908460610188724.ctl'
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 -...263
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.26355e+19,5.20101,122480,6326,419,282608,4042,745,291834,164,13741,0
Converting to forward existential form...Done !
original formula: A(EX(!((((AF(((i0.i1.u12.p42==1)&&(i0.i1.u12.p70==1))) + !(((i9.i0.u54.p224==1)&&(i9.i2.u67.p257==1)))) + E((i5.u32.p157==1) U (i9.i1.u66...858
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(EG((i8.i1.u68.p250==1))) + !((E(TRUE U (((i6.i0.u37.p11==1)&&(i6.i0.u37.p171==1))||(i6.i1...2349
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t185, t186, t218, u34.t79, i0.t119, i0.i1.t117, i0.i1.u11.t122, i1.i0.u13.t115,...817
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 286 transition count 239
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 286 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 286 transition count 238
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 275 transition count 227
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 275 transition count 227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 70 place count 275 transition count 218
Applied a total of 70 rules in 25 ms. Remains 275 /305 variables (removed 30) and now considering 218/258 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8226530844888317792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8342539972502707317.kers'
[2026-05-25 01:40:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8226530844888317792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8342539972502707317.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 275 cols 689 entries
Finished phase 1 with 151 SingleSign rule and 63 generalized
[2026-05-25 01:40:17] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8342539972502707317.kers
Total runtime 2 ms.
[2026-05-25 01:40:17] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-25 01:40:17] [INFO ] Invariant cache hit.
[2026-05-25 01:40:18] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 01:40:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/493 variables, 275/336 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 7/363 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 388 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 52/113 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 218/493 variables, 275/395 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 217/612 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 618 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 275/305 places, 218/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 275/305 places, 218/258 transitions.
[2026-05-25 01:41:18] [INFO ] Flatten gal took : 21 ms
[2026-05-25 01:41:18] [INFO ] Flatten gal took : 20 ms
[2026-05-25 01:41:18] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-25 01:41:18] [INFO ] Flatten gal took : 19 ms
[2026-05-25 01:41:18] [INFO ] Flatten gal took : 20 ms
[2026-05-25 01:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12355458644265175877.gal : 5 ms
[2026-05-25 01:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9262944271341441907.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/CTLFireability12355458644265175877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9262944271341441907.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.
Detected timeout of ITS tools.
[2026-05-25 01:41:48] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:41:48] [INFO ] Applying decomposition
[2026-05-25 01:41:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13373299542894037072.txt' '-o' '/tmp/graph13373299542894037072.bin' '-w' '/tmp/graph13373299542894037072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13373299542894037072.bin' '-l' '-1' '-v' '-w' '/tmp/graph13373299542894037072.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:41:48] [INFO ] Decomposing Gal with order
[2026-05-25 01:41:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:41:48] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-25 01:41:48] [INFO ] Flatten gal took : 24 ms
[2026-05-25 01:41:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-25 01:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12960037347860761179.gal : 6 ms
[2026-05-25 01:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15426141170706924736.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/CTLFireability12960037347860761179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15426141170706924736.ctl'
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 -...264
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,2.78731e+19,3.04533,76740,7318,568,184534,4105,679,161729,179,13362,0
Converting to forward existential form...Done !
original formula: AG(EX(((EF((i8.i2.u44.p216==1)) + (i2.u9.p82==1)) + (((i5.u25.p142==1)&&(i5.u27.p150==1))&&((i2.u8.p44==1)&&(i2.u8.p70==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((E(TRUE U (i8.i2.u44.p216==1)) + (i2.u9.p82==1)) + (((i5.u25.p142==1)&&(i5.u27.p150==1...205
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t60, t161, t178, t179, t211, i0.u29.t79, i1.t122, i1.u6.t127, i1.u6.t128, i1.u7.t124...800
(forward)formula 0,0,14.4599,358872,1,0,986638,9195,3606,929054,1326,39921,1562780
FORMULA DES-PT-10b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 289 transition count 242
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 289 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 289 transition count 240
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 281 transition count 232
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 281 transition count 232
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 57 place count 281 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 280 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 280 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 280 transition count 223
Applied a total of 60 rules in 27 ms. Remains 280 /305 variables (removed 25) and now considering 223/258 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7623721533637825745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8701344188157895003.kers'
[2026-05-25 01:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7623721533637825745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8701344188157895003.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 280 cols 703 entries
Finished phase 1 with 156 SingleSign rule and 63 generalized
[2026-05-25 01:42:03] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8701344188157895003.kers
Total runtime 2 ms.
[2026-05-25 01:42:03] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-25 01:42:03] [INFO ] Invariant cache hit.
[2026-05-25 01:42:04] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 01:42:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 222 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/503 variables, 280/341 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 11/372 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 14/387 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/503 variables, and 394 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 35/54 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 223/503 variables, 280/409 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 222/631 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 640 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 280/305 places, 223/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61017 ms. Remains : 280/305 places, 223/258 transitions.
[2026-05-25 01:43:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 01:43:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:43:04] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-25 01:43:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:43:04] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12831971129081015182.gal : 2 ms
[2026-05-25 01:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3940381316091004719.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/CTLFireability12831971129081015182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3940381316091004719.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.
Detected timeout of ITS tools.
[2026-05-25 01:43:34] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:43:34] [INFO ] Applying decomposition
[2026-05-25 01:43:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3781961248207373427.txt' '-o' '/tmp/graph3781961248207373427.bin' '-w' '/tmp/graph3781961248207373427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3781961248207373427.bin' '-l' '-1' '-v' '-w' '/tmp/graph3781961248207373427.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:43:34] [INFO ] Decomposing Gal with order
[2026-05-25 01:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:43:34] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-25 01:43:34] [INFO ] Flatten gal took : 19 ms
[2026-05-25 01:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-25 01:43:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5751245057020588961.gal : 6 ms
[2026-05-25 01:43:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3505655314436168352.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/CTLFireability5751245057020588961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3505655314436168352.ctl'
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 -...262
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.27323e+19,7.43979,128352,4314,638,222809,5039,747,366647,180,14203,0
Converting to forward existential form...Done !
original formula: E((AX(((EX((i9.i0.u45.p195==1)) + AG(((i5.i1.u18.p110==1)&&(i5.i1.u26.p140==1)))) + ((A((i11.i1.u66.p285==1) U (i7.u68.p288==1)) * (i4.i0...381
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(!(((EX((i9.i0.u45.p195==1)) + !(E(TRUE U !(((i5.i1.u18.p110==1)&&(i5.i1.u26.p140==1)))))) + ((...524
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t60, t164, t183, t184, t217, u33.t78, i0.u31.t81, i2.t119, i2.u9.t155, i2.u9.t156, i...943
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 285 transition count 238
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 285 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 285 transition count 236
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 275 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 275 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 274 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 274 transition count 216
Applied a total of 73 rules in 21 ms. Remains 274 /305 variables (removed 31) and now considering 216/258 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4559403315973429000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9379636482496793353.kers'
[2026-05-25 01:44:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4559403315973429000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9379636482496793353.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 274 cols 685 entries
Finished phase 1 with 150 SingleSign rule and 63 generalized
[2026-05-25 01:44:04] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9379636482496793353.kers
Total runtime 2 ms.
[2026-05-25 01:44:04] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-25 01:44:04] [INFO ] Invariant cache hit.
[2026-05-25 01:44:05] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 01:44:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 379 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/390 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/605 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60048ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 274/305 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 274/305 places, 216/258 transitions.
[2026-05-25 01:45:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:45:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:45:05] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-25 01:45:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 01:45:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 01:45:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16893885176427851503.gal : 2 ms
[2026-05-25 01:45:05] [INFO ] Time to serialize properties into /tmp/CTLFireability713322047388627400.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/CTLFireability16893885176427851503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability713322047388627400.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.
Detected timeout of ITS tools.
[2026-05-25 01:45:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:45:35] [INFO ] Applying decomposition
[2026-05-25 01:45:35] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5733628131067297521.txt' '-o' '/tmp/graph5733628131067297521.bin' '-w' '/tmp/graph5733628131067297521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5733628131067297521.bin' '-l' '-1' '-v' '-w' '/tmp/graph5733628131067297521.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:45:35] [INFO ] Decomposing Gal with order
[2026-05-25 01:45:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:45:35] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 01:45:35] [INFO ] Flatten gal took : 25 ms
[2026-05-25 01:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2026-05-25 01:45:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7589038140662804838.gal : 4 ms
[2026-05-25 01:45:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10911849595517456433.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/CTLFireability7589038140662804838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10911849595517456433.ctl'
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 -...263
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,2.4388e+19,16.8949,230128,22497,473,545758,3738,703,460086,161,14029,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 247
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 294 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 289 transition count 240
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 289 transition count 240
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 39 place count 289 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 288 transition count 234
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 288 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 288 transition count 233
Applied a total of 42 rules in 18 ms. Remains 288 /305 variables (removed 17) and now considering 233/258 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8880912061819215244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-57712232983203590.kers'
[2026-05-25 01:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8880912061819215244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-57712232983203590.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 288 cols 727 entries
Finished phase 1 with 163 SingleSign rule and 64 generalized
[2026-05-25 01:46:05] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-57712232983203590.kers
Total runtime 4 ms.
[2026-05-25 01:46:06] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-25 01:46:06] [INFO ] Invariant cache hit.
[2026-05-25 01:46:06] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-25 01:46:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 233/521 variables, 288/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 383 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 233/521 variables, 288/413 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 232/645 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 647 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 288/305 places, 233/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60813 ms. Remains : 288/305 places, 233/258 transitions.
[2026-05-25 01:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:47:06] [INFO ] Input system was already deterministic with 233 transitions.
[2026-05-25 01:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:47:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7465483497951110962.gal : 3 ms
[2026-05-25 01:47:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12395292985759602906.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/CTLFireability7465483497951110962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12395292985759602906.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.
Detected timeout of ITS tools.
[2026-05-25 01:47:36] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:47:36] [INFO ] Applying decomposition
[2026-05-25 01:47:36] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10056962124830823519.txt' '-o' '/tmp/graph10056962124830823519.bin' '-w' '/tmp/graph10056962124830823519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10056962124830823519.bin' '-l' '-1' '-v' '-w' '/tmp/graph10056962124830823519.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:47:36] [INFO ] Decomposing Gal with order
[2026-05-25 01:47:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:47:36] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 01:47:36] [INFO ] Flatten gal took : 15 ms
[2026-05-25 01:47:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2026-05-25 01:47:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16963544225939136407.gal : 3 ms
[2026-05-25 01:47:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5682135788986310412.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/CTLFireability16963544225939136407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5682135788986310412.ctl'
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 -...263
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.35318e+20,10.3627,167148,6953,481,330883,4365,757,464494,179,11291,0
Converting to forward existential form...Done !
original formula: E(((EG((AF(((i7.u33.p151==1)||((i11.i3.u42.p184==1)&&(i11.i3.u78.p304==1)))) * (AF(((u37.p11==1)&&(u37.p171==1))) + (i11.i1.u72.p288==1))...1026
=> equivalent forward existential formula: [((FwdU(Init,((EG((!(EG(!(((i7.u33.p151==1)||((i11.i3.u42.p184==1)&&(i11.i3.u78.p304==1)))))) * (!(EG(!(((u37.p1...1680
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t59, t131, t192, t193, u37.t77, i0.u36.t80, i2.t136, i2.u8.t133, i2.u9.t135, i3.t127...912
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 299 transition count 236
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 281 transition count 236
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 281 transition count 226
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 271 transition count 226
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 73 place count 255 transition count 210
Iterating global reduction 2 with 16 rules applied. Total rules applied 89 place count 255 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 255 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 255 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 254 transition count 207
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 245 transition count 198
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 120 place count 245 transition count 189
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 122 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 122 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 242 transition count 186
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 262 place count 174 transition count 118
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 263 place count 174 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 265 place count 172 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 171 transition count 116
Applied a total of 266 rules in 65 ms. Remains 171 /305 variables (removed 134) and now considering 116/258 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-771350404825572830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7011503139477632198.kers'
[2026-05-25 01:48:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-771350404825572830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7011503139477632198.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 116 rows 166 cols 491 entries
Finished phase 1 with 57 SingleSign rule and 56 generalized
[2026-05-25 01:48:07] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7011503139477632198.kers
Total runtime 1 ms.
[2026-05-25 01:48:07] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-25 01:48:07] [INFO ] Invariant cache hit.
[2026-05-25 01:48:07] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2026-05-25 01:48:07] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-25 01:48:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/170 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 116/286 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 1/287 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/287 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 18 (OVERLAPS) 0/287 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/287 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 20 (OVERLAPS) 0/287 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 239 constraints, problems are : Problem set: 0 solved, 113 unsolved in 23671 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/170 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 116/286 variables, 170/238 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 113/351 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/287 variables, and 352 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 170/171 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53704ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 53705ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/305 places, 116/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54248 ms. Remains : 171/305 places, 116/258 transitions.
[2026-05-25 01:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:49:01] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 127 steps (2 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 01:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:49:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:49:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15872656196470197526.gal : 2 ms
[2026-05-25 01:49:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13405599568246477339.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15872656196470197526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13405599568246477339.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 288 transition count 241
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 288 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 288 transition count 240
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 279 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 279 transition count 231
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 60 place count 279 transition count 224
Applied a total of 60 rules in 21 ms. Remains 279 /305 variables (removed 26) and now considering 224/258 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8714747812335724015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13994629856658745177.kers'
[2026-05-25 01:49:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8714747812335724015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13994629856658745177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 279 cols 705 entries
Finished phase 1 with 156 SingleSign rule and 62 generalized
[2026-05-25 01:49:01] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13994629856658745177.kers
Total runtime 6 ms.
[2026-05-25 01:49:01] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-25 01:49:01] [INFO ] Invariant cache hit.
[2026-05-25 01:49:02] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 01:49:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/503 variables, 279/356 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 14/370 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 223 unsolved
SMT process timed out in 30066ms, After SMT, problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 30067ms
Starting structural reductions in LTL mode, iteration 1 : 279/305 places, 224/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30937 ms. Remains : 279/305 places, 224/258 transitions.
[2026-05-25 01:49:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:49:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:49:32] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-25 01:49:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:49:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:49:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14297284557471654260.gal : 3 ms
[2026-05-25 01:49:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7002141196825061662.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/CTLFireability14297284557471654260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7002141196825061662.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.
Detected timeout of ITS tools.
[2026-05-25 01:50:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:50:02] [INFO ] Applying decomposition
[2026-05-25 01:50:02] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7912304996500632373.txt' '-o' '/tmp/graph7912304996500632373.bin' '-w' '/tmp/graph7912304996500632373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7912304996500632373.bin' '-l' '-1' '-v' '-w' '/tmp/graph7912304996500632373.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:50:02] [INFO ] Decomposing Gal with order
[2026-05-25 01:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:50:02] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-25 01:50:02] [INFO ] Flatten gal took : 29 ms
[2026-05-25 01:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2026-05-25 01:50:02] [INFO ] Time to serialize gal into /tmp/CTLFireability727703513764729889.gal : 3 ms
[2026-05-25 01:50:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2126363731674147580.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/CTLFireability727703513764729889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2126363731674147580.ctl'
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 -...261
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.52104e+19,4.24188,87756,3857,412,202720,2739,731,165570,165,9264,0
Converting to forward existential form...Done !
original formula: ((EX(EG((((i6.u33.p13==1)&&(i6.u33.p171==1))&&((i8.i4.u53.p237==0)||(i8.i0.u40.p194==1))))) + !(E(EF(AX((i0.i0.u0.p49==1))) U (AF((i10.i2...1029
=> equivalent forward existential formula: ([(((FwdU((Init * !((EX(EG((((i6.u33.p13==1)&&(i6.u33.p171==1))&&((i8.i4.u53.p237==0)||(i8.i0.u40.p194==1))))) +...1810
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t62, t126, t165, t184, t185, t217, i0.i1.u30.t79, i1.u8.t128, i1.u8.t129, i1.u13.t11...841
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 285 transition count 238
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 285 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 285 transition count 236
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 274 transition count 225
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 274 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 274 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 273 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 273 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 273 transition count 214
Applied a total of 76 rules in 19 ms. Remains 273 /305 variables (removed 32) and now considering 214/258 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7624353550398348246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3593409668076465541.kers'
[2026-05-25 01:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7624353550398348246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3593409668076465541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 273 cols 679 entries
Finished phase 1 with 150 SingleSign rule and 62 generalized
[2026-05-25 01:50:32] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3593409668076465541.kers
Total runtime 2 ms.
[2026-05-25 01:50:32] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-25 01:50:32] [INFO ] Invariant cache hit.
[2026-05-25 01:50:33] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 01:50:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 214/487 variables, 273/335 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 17/364 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 368 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 214/487 variables, 273/381 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 213/594 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 602 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 273/305 places, 214/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 273/305 places, 214/258 transitions.
[2026-05-25 01:51:33] [INFO ] Flatten gal took : 9 ms
[2026-05-25 01:51:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:51:33] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 01:51:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:51:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:51:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10771191120934335457.gal : 2 ms
[2026-05-25 01:51:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6708220117569099357.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/CTLFireability10771191120934335457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6708220117569099357.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.
Detected timeout of ITS tools.
[2026-05-25 01:52:03] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:52:03] [INFO ] Applying decomposition
[2026-05-25 01:52:03] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11088501021898156324.txt' '-o' '/tmp/graph11088501021898156324.bin' '-w' '/tmp/graph11088501021898156324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11088501021898156324.bin' '-l' '-1' '-v' '-w' '/tmp/graph11088501021898156324.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:52:03] [INFO ] Decomposing Gal with order
[2026-05-25 01:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:52:03] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-25 01:52:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 01:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2026-05-25 01:52:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13020717008313103432.gal : 3 ms
[2026-05-25 01:52:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16848325518149181589.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/CTLFireability13020717008313103432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16848325518149181589.ctl'
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 -...264
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,2.22275e+19,3.8518,103208,3978,597,249157,4227,687,200160,184,12730,0
Converting to forward existential form...Done !
original formula: EF(((AX(((i10.i3.u58.p250==0) + AX(((i7.i0.u34.p182==0)||(i8.i1.u38.p191==0))))) * EX(!(E(((u32.p7==1)&&(u32.p171==1)) U ((i3.u8.p42==1)&...222
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * ((i4.i0.u20.p117==1)&&(i4.i1.u24.p138==1))) * !(EX(!(((i10.i3.u58.p250==0) + !(EX(!(((i...286
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t58, t87, t158, t175, t176, t208, u32.t76, u74.t17, u74.t139, i0.i1.u30.t79, i1...799
(forward)formula 0,1,9.44619,199256,1,0,446207,14652,3706,628997,1409,61628,684082
FORMULA DES-PT-10b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 299 transition count 235
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 280 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 280 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 272 transition count 227
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 71 place count 256 transition count 211
Iterating global reduction 2 with 16 rules applied. Total rules applied 87 place count 256 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 256 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 256 transition count 208
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 255 transition count 208
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 101 place count 245 transition count 198
Iterating global reduction 3 with 10 rules applied. Total rules applied 111 place count 245 transition count 198
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 10 rules applied. Total rules applied 121 place count 245 transition count 188
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 123 place count 244 transition count 187
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 244 transition count 184
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 241 transition count 184
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 269 place count 171 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 169 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 168 transition count 112
Applied a total of 272 rules in 52 ms. Remains 168 /305 variables (removed 137) and now considering 112/258 (removed 146) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-747625978585994245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9641279934726048630.kers'
[2026-05-25 01:52:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-747625978585994245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9641279934726048630.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 112 rows 143 cols 388 entries
Finished phase 1 with 88 SingleSign rule and 22 generalized
[2026-05-25 01:52:12] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9641279934726048630.kers
Total runtime 2 ms.
[2026-05-25 01:52:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-25 01:52:13] [INFO ] Invariant cache hit.
[2026-05-25 01:52:13] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2026-05-25 01:52:13] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-25 01:52:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/165 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/167 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 112/279 variables, 167/225 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/280 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 0/280 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 231 constraints, problems are : Problem set: 0 solved, 108 unsolved in 17987 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/165 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 2/167 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 112/279 variables, 167/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 108/338 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 339 constraints, problems are : Problem set: 0 solved, 108 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48006ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 48006ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/305 places, 112/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48532 ms. Remains : 168/305 places, 112/258 transitions.
[2026-05-25 01:53:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:53:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:53:01] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-25 01:53:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:53:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:53:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16464838145965365524.gal : 1 ms
[2026-05-25 01:53:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10605895187676713430.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/CTLFireability16464838145965365524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10605895187676713430.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.
Detected timeout of ITS tools.
[2026-05-25 01:53:31] [INFO ] Flatten gal took : 3 ms
[2026-05-25 01:53:31] [INFO ] Applying decomposition
[2026-05-25 01:53:31] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15963510728024093283.txt' '-o' '/tmp/graph15963510728024093283.bin' '-w' '/tmp/graph15963510728024093283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15963510728024093283.bin' '-l' '-1' '-v' '-w' '/tmp/graph15963510728024093283.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:53:31] [INFO ] Decomposing Gal with order
[2026-05-25 01:53:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:53:31] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-25 01:53:31] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:53:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-25 01:53:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4263434944252378302.gal : 1 ms
[2026-05-25 01:53:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4914053887288248764.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/CTLFireability4263434944252378302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4914053887288248764.ctl'
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 -...262
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,2.5586e+13,0.525609,18300,2125,616,39344,1565,331,29833,155,6171,0
Converting to forward existential form...Done !
original formula: AF(AG(((i1.u8.p123==1)&&(i1.u13.p160==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i1.u8.p123==1)&&(i1.u13.p160==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t72, t93, t96, t97, t100, u14.t35, u15.t82, u50.t1, u50.t102, i0.t10, i0.u2.t16, i0.u2.t2...384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,4.1006,127628,1,0,317112,8095,2133,316432,1434,31835,435673
FORMULA DES-PT-10b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 285 transition count 238
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 285 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 285 transition count 236
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 275 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 275 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 274 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 274 transition count 216
Applied a total of 73 rules in 15 ms. Remains 274 /305 variables (removed 31) and now considering 216/258 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2526483426412726973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15554745227401540041.kers'
[2026-05-25 01:53:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2526483426412726973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15554745227401540041.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 274 cols 685 entries
Finished phase 1 with 150 SingleSign rule and 63 generalized
[2026-05-25 01:53:35] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15554745227401540041.kers
Total runtime 2 ms.
[2026-05-25 01:53:35] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-25 01:53:35] [INFO ] Invariant cache hit.
[2026-05-25 01:53:36] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 01:53:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 379 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 216/490 variables, 274/390 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 215/605 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60040ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 274/305 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60873 ms. Remains : 274/305 places, 216/258 transitions.
[2026-05-25 01:54:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:54:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:54:36] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-25 01:54:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:54:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:54:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13924773105885894057.gal : 1 ms
[2026-05-25 01:54:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9353091935999772411.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/CTLFireability13924773105885894057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9353091935999772411.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.
Detected timeout of ITS tools.
[2026-05-25 01:55:06] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:55:06] [INFO ] Applying decomposition
[2026-05-25 01:55:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5237044195304208866.txt' '-o' '/tmp/graph5237044195304208866.bin' '-w' '/tmp/graph5237044195304208866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5237044195304208866.bin' '-l' '-1' '-v' '-w' '/tmp/graph5237044195304208866.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:55:06] [INFO ] Decomposing Gal with order
[2026-05-25 01:55:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:55:06] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 01:55:06] [INFO ] Flatten gal took : 12 ms
[2026-05-25 01:55:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-25 01:55:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8660757003098842438.gal : 3 ms
[2026-05-25 01:55:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1385265330897177424.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/CTLFireability8660757003098842438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1385265330897177424.ctl'
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 -...262
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,2.4388e+19,3.70893,92760,10200,590,235002,3653,667,189291,174,12602,0
Converting to forward existential form...Done !
original formula: !(A(((((i3.i2.u27.p137==1) * !(A((i12.u78.p314==1) U (i2.u10.p84==1)))) * EX(EF(((i8.i1.u44.p198==1)&&(i8.i2.u50.p223==1))))) + EF(EX(EX(...427
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(((!((E(!((i1.u5.p55==1)) U (!(((i12.u77.p317==1)&&(i12.u77.p319==1))) * !((i1.u5.p55==1)))) +...1226
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t159, t176, t177, t209, u34.t76, i0.u32.t79, i1.t120, i1.u6.t125, i1.u6.t126, i1.u7....821
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 286 transition count 239
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 286 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 286 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 276 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 276 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 276 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 275 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 275 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 275 transition count 217
Applied a total of 71 rules in 18 ms. Remains 275 /305 variables (removed 30) and now considering 217/258 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16309148207371224751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14445883082722228398.kers'
[2026-05-25 01:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16309148207371224751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14445883082722228398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 275 cols 687 entries
Finished phase 1 with 152 SingleSign rule and 62 generalized
[2026-05-25 01:55:36] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14445883082722228398.kers
Total runtime 3 ms.
[2026-05-25 01:55:37] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-25 01:55:37] [INFO ] Invariant cache hit.
[2026-05-25 01:55:37] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 01:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 217/492 variables, 275/360 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 9/369 constraints. Problems are: Problem set: 0 solved, 216 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Starting structural reductions in LTL mode, iteration 1 : 275/305 places, 217/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30804 ms. Remains : 275/305 places, 217/258 transitions.
[2026-05-25 01:56:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:56:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:56:07] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-25 01:56:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:56:07] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:56:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7913904467723585281.gal : 2 ms
[2026-05-25 01:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2090175176430774249.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/CTLFireability7913904467723585281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2090175176430774249.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.
Detected timeout of ITS tools.
[2026-05-25 01:56:37] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:56:37] [INFO ] Applying decomposition
[2026-05-25 01:56:37] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7710765930755243572.txt' '-o' '/tmp/graph7710765930755243572.bin' '-w' '/tmp/graph7710765930755243572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7710765930755243572.bin' '-l' '-1' '-v' '-w' '/tmp/graph7710765930755243572.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:56:37] [INFO ] Decomposing Gal with order
[2026-05-25 01:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:56:37] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-25 01:56:37] [INFO ] Flatten gal took : 19 ms
[2026-05-25 01:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-25 01:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10126966153421762387.gal : 5 ms
[2026-05-25 01:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6451852185755295996.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/CTLFireability10126966153421762387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6451852185755295996.ctl'
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 -...263
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.30408e+19,19.6161,220212,6635,634,324304,4568,718,1.39022e+06,178,11747,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 299 transition count 235
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 280 transition count 235
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 280 transition count 226
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 271 transition count 226
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 71 place count 257 transition count 212
Iterating global reduction 2 with 14 rules applied. Total rules applied 85 place count 257 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 257 transition count 210
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 96 place count 248 transition count 201
Iterating global reduction 3 with 9 rules applied. Total rules applied 105 place count 248 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 113 place count 248 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 113 place count 248 transition count 190
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 119 place count 245 transition count 190
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 263 place count 173 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 173 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 171 transition count 115
Applied a total of 266 rules in 72 ms. Remains 171 /305 variables (removed 134) and now considering 115/258 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3168601450431033389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-978358119660305736.kers'
[2026-05-25 01:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3168601450431033389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-978358119660305736.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 115 rows 143 cols 398 entries
Finished phase 1 with 88 SingleSign rule and 24 generalized
[2026-05-25 01:57:08] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-978358119660305736.kers
Total runtime 3 ms.
[2026-05-25 01:57:08] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 01:57:08] [INFO ] Invariant cache hit.
[2026-05-25 01:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 01:57:08] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2026-05-25 01:57:08] [INFO ] Redundant transitions in 4 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-25 01:57:08] [INFO ] Invariant cache hit.
[2026-05-25 01:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 115/285 variables, 170/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/286 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 231 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8497 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 2/170 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 115/285 variables, 170/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 112/342 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 5/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/286 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 348 constraints, problems are : Problem set: 0 solved, 112 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38527ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 38528ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/305 places, 115/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39406 ms. Remains : 171/305 places, 115/258 transitions.
[2026-05-25 01:57:47] [INFO ] Flatten gal took : 7 ms
[2026-05-25 01:57:47] [INFO ] Flatten gal took : 8 ms
[2026-05-25 01:57:47] [INFO ] Input system was already deterministic with 115 transitions.
RANDOM walk for 262 steps (7 resets) in 6 ms. (37 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 01:57:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:57:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:57:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15979983743730397081.gal : 1 ms
[2026-05-25 01:57:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17537028966613636369.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15979983743730397081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17537028966613636369.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 299 transition count 236
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 281 transition count 236
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 281 transition count 226
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 271 transition count 226
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 73 place count 255 transition count 210
Iterating global reduction 2 with 16 rules applied. Total rules applied 89 place count 255 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 255 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 255 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 254 transition count 207
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 103 place count 244 transition count 197
Iterating global reduction 3 with 10 rules applied. Total rules applied 113 place count 244 transition count 197
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 3 with 10 rules applied. Total rules applied 123 place count 244 transition count 187
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 125 place count 243 transition count 186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 125 place count 243 transition count 183
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 131 place count 240 transition count 183
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 261 place count 175 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 173 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 172 transition count 116
Applied a total of 264 rules in 41 ms. Remains 172 /305 variables (removed 133) and now considering 116/258 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18218743517565323617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14388433839842419154.kers'
[2026-05-25 01:57:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18218743517565323617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14388433839842419154.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 116 rows 161 cols 432 entries
Finished phase 1 with 71 SingleSign rule and 43 generalized
[2026-05-25 01:57:47] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14388433839842419154.kers
Total runtime 1 ms.
[2026-05-25 01:57:47] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-25 01:57:47] [INFO ] Invariant cache hit.
[2026-05-25 01:57:47] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2026-05-25 01:57:48] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-25 01:57:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 3/171 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 116/287 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/288 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 15 (OVERLAPS) 0/288 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 235 constraints, problems are : Problem set: 0 solved, 111 unsolved in 17518 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 116/287 variables, 171/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 111/345 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/288 variables, and 348 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 171/172 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47538ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 47539ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/305 places, 116/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48144 ms. Remains : 172/305 places, 116/258 transitions.
[2026-05-25 01:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:58:35] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-25 01:58:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 01:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11179423921933936243.gal : 1 ms
[2026-05-25 01:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3119541705195125789.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/CTLFireability11179423921933936243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3119541705195125789.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.
Detected timeout of ITS tools.
[2026-05-25 01:59:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 01:59:05] [INFO ] Applying decomposition
[2026-05-25 01:59:05] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17930005096519306155.txt' '-o' '/tmp/graph17930005096519306155.bin' '-w' '/tmp/graph17930005096519306155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17930005096519306155.bin' '-l' '-1' '-v' '-w' '/tmp/graph17930005096519306155.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:59:05] [INFO ] Decomposing Gal with order
[2026-05-25 01:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:59:05] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-25 01:59:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 01:59:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 1 ms.
[2026-05-25 01:59:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2110178292692225165.gal : 3 ms
[2026-05-25 01:59:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10318420095859533635.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/CTLFireability2110178292692225165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10318420095859533635.ctl'
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 -...263
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,2.32052e+13,1.12312,30520,3224,485,72188,1449,375,64831,153,5850,0
Converting to forward existential form...Done !
original formula: EG(((i5.i0.u20.p189==0) * AF((i2.u10.p127==1))))
=> equivalent forward existential formula: [FwdG(Init,((i5.i0.u20.p189==0) * !(EG(!((i2.u10.p127==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t75, t88, t97, t101, t104, u15.t37, u53.t1, u53.t106, i0.t12, i0.u2.t18, i0.u2.t22, i0.u2...423
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Graph (complete) has 593 edges and 305 vertex of which 300 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 299 transition count 235
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 280 transition count 235
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 280 transition count 226
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 271 transition count 226
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 73 place count 255 transition count 210
Iterating global reduction 2 with 16 rules applied. Total rules applied 89 place count 255 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 255 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 255 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 254 transition count 207
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 245 transition count 198
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 3 with 9 rules applied. Total rules applied 120 place count 245 transition count 189
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 122 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 122 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 242 transition count 186
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 260 place count 175 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 173 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 263 place count 172 transition count 117
Applied a total of 263 rules in 45 ms. Remains 172 /305 variables (removed 133) and now considering 117/258 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13253900419825892026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16157057364182090718.kers'
[2026-05-25 01:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13253900419825892026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16157057364182090718.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 117 rows 163 cols 441 entries
Finished phase 1 with 72 SingleSign rule and 42 generalized
[2026-05-25 01:59:35] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16157057364182090718.kers
Total runtime 5 ms.
[2026-05-25 01:59:36] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-25 01:59:36] [INFO ] Invariant cache hit.
[2026-05-25 01:59:36] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2026-05-25 01:59:36] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2026-05-25 01:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 3/171 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 117/288 variables, 171/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (OVERLAPS) 0/289 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 235 constraints, problems are : Problem set: 0 solved, 112 unsolved in 23416 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 117/288 variables, 171/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 112/346 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 1/289 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 348 constraints, problems are : Problem set: 0 solved, 112 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53440ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 53441ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/305 places, 117/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54184 ms. Remains : 172/305 places, 117/258 transitions.
[2026-05-25 02:00:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:00:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:00:29] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-25 02:00:29] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:00:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 02:00:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9069268367780915478.gal : 1 ms
[2026-05-25 02:00:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6400228853729107002.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/CTLFireability9069268367780915478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6400228853729107002.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.
Detected timeout of ITS tools.
[2026-05-25 02:01:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:01:00] [INFO ] Applying decomposition
[2026-05-25 02:01:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12850286182307732335.txt' '-o' '/tmp/graph12850286182307732335.bin' '-w' '/tmp/graph12850286182307732335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12850286182307732335.bin' '-l' '-1' '-v' '-w' '/tmp/graph12850286182307732335.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:01:00] [INFO ] Decomposing Gal with order
[2026-05-25 02:01:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:01:00] [INFO ] Removed a total of 9 redundant transitions.
[2026-05-25 02:01:00] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2026-05-25 02:01:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11533303919508447322.gal : 2 ms
[2026-05-25 02:01:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5738081957776001141.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/CTLFireability11533303919508447322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5738081957776001141.ctl'
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 -...263
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.17805e+13,0.985299,27068,3088,656,61119,1929,365,59851,154,6905,0
Converting to forward existential form...Done !
original formula: !(E((i9.i1.u18.p189!=1) U ((i3.u12.p142==1)&&(i3.u12.p156==1))))
=> equivalent forward existential formula: [(FwdU(Init,(i9.i1.u18.p189!=1)) * ((i3.u12.p142==1)&&(i3.u12.p156==1)))] = FALSE
(forward)formula 0,0,1.04093,27068,1,0,61119,1929,690,59851,310,6905,15245
FORMULA DES-PT-10b-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 285 transition count 238
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 285 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 285 transition count 236
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 275 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 275 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 275 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 274 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 274 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 274 transition count 216
Applied a total of 73 rules in 19 ms. Remains 274 /305 variables (removed 31) and now considering 216/258 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14215633103495673356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17731773059447834105.kers'
[2026-05-25 02:01:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14215633103495673356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17731773059447834105.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 274 cols 685 entries
Finished phase 1 with 151 SingleSign rule and 62 generalized
[2026-05-25 02:01:01] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17731773059447834105.kers
Total runtime 3 ms.
[2026-05-25 02:01:01] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-25 02:01:01] [INFO ] Invariant cache hit.
[2026-05-25 02:01:01] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 02:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/490 variables, 274/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 13/376 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 30060ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 30061ms
Starting structural reductions in LTL mode, iteration 1 : 274/305 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30923 ms. Remains : 274/305 places, 216/258 transitions.
[2026-05-25 02:01:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:01:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:01:32] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-25 02:01:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 02:01:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 02:01:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4002128875286988459.gal : 2 ms
[2026-05-25 02:01:32] [INFO ] Time to serialize properties into /tmp/CTLFireability12902932732439079575.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/CTLFireability4002128875286988459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12902932732439079575.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.
Detected timeout of ITS tools.
[2026-05-25 02:02:02] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:02:02] [INFO ] Applying decomposition
[2026-05-25 02:02:02] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17683784095427453703.txt' '-o' '/tmp/graph17683784095427453703.bin' '-w' '/tmp/graph17683784095427453703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17683784095427453703.bin' '-l' '-1' '-v' '-w' '/tmp/graph17683784095427453703.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:02:02] [INFO ] Decomposing Gal with order
[2026-05-25 02:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:02:02] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-25 02:02:02] [INFO ] Flatten gal took : 12 ms
[2026-05-25 02:02:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2026-05-25 02:02:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6847864120515618595.gal : 3 ms
[2026-05-25 02:02:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18403948764170093536.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/CTLFireability6847864120515618595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18403948764170093536.ctl'
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 -...263
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,2.75131e+19,3.65924,83696,3909,562,169408,5435,683,185344,194,16865,0
Converting to forward existential form...Done !
original formula: EX(((EF(((i6.u0.p38==0)||(i2.u8.p70==0))) * EF((((((i1.u5.p55==1)||((i10.u43.p202==1)&&(i10.u51.p229==1))) * AG((i3.u26.p134==1))) + AF((...369
=> equivalent forward existential formula: [FwdG(((EY(Init) * (E(TRUE U ((i6.u0.p38==0)||(i2.u8.p70==0))) * E(TRUE U (((((i1.u5.p55==1)||((i10.u43.p202==1)...509
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t87, t91, t119, t159, t177, t178, t210, i0.u74.t17, i0.u74.t140, i1.u7.t121, i1...783
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 286 transition count 239
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 286 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 286 transition count 237
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 277 transition count 228
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 277 transition count 228
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 277 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 276 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 276 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 276 transition count 219
Applied a total of 68 rules in 20 ms. Remains 276 /305 variables (removed 29) and now considering 219/258 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10506541260047652338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3154760043301815137.kers'
[2026-05-25 02:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10506541260047652338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3154760043301815137.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 276 cols 693 entries
Finished phase 1 with 152 SingleSign rule and 63 generalized
[2026-05-25 02:02:32] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3154760043301815137.kers
Total runtime 3 ms.
[2026-05-25 02:02:32] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-25 02:02:32] [INFO ] Invariant cache hit.
[2026-05-25 02:02:33] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 02:02:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/495 variables, 276/351 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 11/375 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 377 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 17/118 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/495 variables, 276/394 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 218/612 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 617 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 276/305 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61002 ms. Remains : 276/305 places, 219/258 transitions.
[2026-05-25 02:03:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:03:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:03:33] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-25 02:03:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:03:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17952056790379021993.gal : 2 ms
[2026-05-25 02:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18082338667088290543.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/CTLFireability17952056790379021993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18082338667088290543.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.
Detected timeout of ITS tools.
[2026-05-25 02:04:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 02:04:03] [INFO ] Applying decomposition
[2026-05-25 02:04:03] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph353722230537831933.txt' '-o' '/tmp/graph353722230537831933.bin' '-w' '/tmp/graph353722230537831933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph353722230537831933.bin' '-l' '-1' '-v' '-w' '/tmp/graph353722230537831933.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:04:03] [INFO ] Decomposing Gal with order
[2026-05-25 02:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:04:03] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 02:04:03] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:04:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 02:04:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14371250150446808929.gal : 3 ms
[2026-05-25 02:04:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4318895420173606788.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/CTLFireability14371250150446808929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4318895420173606788.ctl'
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 -...263
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.23674e+19,4.29456,99404,10411,428,241845,2269,671,254414,161,9369,0
Converting to forward existential form...Done !
original formula: (AF(EX(E(EF((i7.i0.i2.u61.p254==1)) U ((i5.u26.p143==1)&&(i4.u25.p145==1))))) + ((EG(((i4.u16.p112==1)&&(i9.u57.p271==1))) * EF((i5.u27.p...402
=> equivalent forward existential formula: (([((Init * !(!(EG(!(EX(E(E(TRUE U (i7.i0.i2.u61.p254==1)) U ((i5.u26.p143==1)&&(i4.u25.p145==1))))))))) * !(EG(...1384
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t161, t179, t180, t212, i0.u30.t79, i1.t122, i1.u6.t127, i1.u6.t128, i1.u7.t124, i1....794
Detected timeout of ITS tools.
[2026-05-25 02:04:33] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:04:33] [INFO ] Flatten gal took : 9 ms
[2026-05-25 02:04:33] [INFO ] Applying decomposition
[2026-05-25 02:04:33] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1295211245584940474.txt' '-o' '/tmp/graph1295211245584940474.bin' '-w' '/tmp/graph1295211245584940474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1295211245584940474.bin' '-l' '-1' '-v' '-w' '/tmp/graph1295211245584940474.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:04:33] [INFO ] Decomposing Gal with order
[2026-05-25 02:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:04:33] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-25 02:04:33] [INFO ] Flatten gal took : 21 ms
[2026-05-25 02:04:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2026-05-25 02:04:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16450005278552303440.gal : 5 ms
[2026-05-25 02:04:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11282452778210051974.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16450005278552303440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11282452778210051974.ctl'
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 -...264
No direction supplied, using forward translation only.
Parsed 10 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.9508e+20,15.9362,292748,10244,534,717410,5400,742,572553,186,17353,0
Converting to forward existential form...Done !
original formula: A(EX(!((((AF(((i3.u15.p42==1)&&(i3.u15.p70==1))) + !(((i8.i4.u59.p224==1)&&(i8.i4.u73.p257==1)))) + E((i7.u37.p157==1) U (i8.i6.u72.p253=...845
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(EG((i9.i3.u69.p250==1))) + !((E(TRUE U (((u42.p11==1)&&(u42.p171==1))||(i10.i0.u41.p167==...2326
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t145, t215, u42.t79, i0.u40.t82, i2.t151, i2.u9.t147, i2.u9.t149, i3.t137, i3.t135, ...957
Detected timeout of ITS tools.
[2026-05-25 02:34:11] [INFO ] Applying decomposition
[2026-05-25 02:34:11] [INFO ] Flatten gal took : 6 ms
[2026-05-25 02:34:11] [INFO ] Decomposing Gal with order
[2026-05-25 02:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:34:11] [INFO ] Removed a total of 55 redundant transitions.
[2026-05-25 02:34:11] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 9 ms.
[2026-05-25 02:34:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10378776820139010109.gal : 4 ms
[2026-05-25 02:34:11] [INFO ] Time to serialize properties into /tmp/CTLFireability550432414645565143.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10378776820139010109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability550432414645565143.ctl'
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 -...262
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DES-PT-10b"
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 DES-PT-10b, 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 r082-smll-177946993700370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;