Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.7K Mar 6 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 6 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 16:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:37 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.9K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 6 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 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 36K 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 DiscoveryGPU-PT-10a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779598441790

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 04:54:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:54:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:54:03] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-24 04:54:03] [INFO ] Transformed 103 places.
[2026-05-24 04:54:03] [INFO ] Transformed 141 transitions.
[2026-05-24 04:54:03] [INFO ] Found NUPN structural information;
[2026-05-24 04:54:03] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 102 transition count 130
Applied a total of 12 rules in 23 ms. Remains 102 /103 variables (removed 1) and now considering 130/141 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11268149211129650538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3730596166101561183.kers'
[2026-05-24 04:54:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11268149211129650538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3730596166101561183.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 130 rows 100 cols 250 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-24 04:54:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3730596166101561183.kers
Total runtime 2 ms.
[2026-05-24 04:54:03] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 04:54:03] [INFO ] Invariant cache hit.
[2026-05-24 04:54:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 04:54:03] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 04:54:03] [INFO ] Invariant cache hit.
[2026-05-24 04:54:03] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/232 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 80/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 184 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/232 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 80/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 129/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 313 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8467ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8482ms
Starting structural reductions in LTL mode, iteration 1 : 102/103 places, 130/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8927 ms. Remains : 102/103 places, 130/141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-24 04:54:12] [INFO ] Invariant cache hit.
[2026-05-24 04:54:12] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 04:54:12] [INFO ] Invariant cache hit.
[2026-05-24 04:54:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 04:54:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 102/102 places, 130/130 transitions.
Support contains 74 out of 102 places after structural reductions.
[2026-05-24 04:54:12] [INFO ] Flatten gal took : 26 ms
[2026-05-24 04:54:12] [INFO ] Flatten gal took : 10 ms
[2026-05-24 04:54:12] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 73 out of 102 places (down from 74) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 73
RANDOM walk for 40000 steps (369 resets) in 1268 ms. (31 steps per ms) remains 1/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
[2026-05-24 04:54:12] [INFO ] Invariant cache hit.
[2026-05-24 04:54:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/17 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/48 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 37/85 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 106/232 variables, and 81 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/102 constraints, ReadFeed: 32/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 04:54:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:54:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:54:13] [INFO ] Input system was already deterministic with 130 transitions.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 78 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 78 transition count 106
Applied a total of 48 rules in 8 ms. Remains 78 /102 variables (removed 24) and now considering 106/130 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11710389733549534587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6598945610794618500.kers'
[2026-05-24 04:54:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11710389733549534587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6598945610794618500.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 106 rows 76 cols 210 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:54:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6598945610794618500.kers
Total runtime 0 ms.
[2026-05-24 04:54:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 04:54:13] [INFO ] Invariant cache hit.
[2026-05-24 04:54:13] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:54:13] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2026-05-24 04:54:13] [INFO ] Invariant cache hit.
[2026-05-24 04:54:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/184 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 71/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 151 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/184 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 71/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 105/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 256 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5367ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5371ms
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 106/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5516 ms. Remains : 78/102 places, 106/130 transitions.
[2026-05-24 04:54:18] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:54:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:54:18] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-24 04:54:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:54:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:54:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2873960815344553195.gal : 2 ms
[2026-05-24 04:54:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2423451528973151123.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/CTLFireability2873960815344553195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2423451528973151123.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.04371e+09,0.963483,35596,2,4837,5,208971,6,0,405,120814,0


Converting to forward existential form...Done !
original formula: E(!(((AF((EX((p66==1)) + EG((p64==1)))) + ((!(EF(((p23==1)&&(p102==1)))) * A(((p44==1)&&(p102==1)) U ((p10==1)&&(p101==1)))) * (!(((p77==...284
=> equivalent forward existential formula: [(FwdU(Init,!(((!(EG(!((EX((p66==1)) + EG((p64==1)))))) + ((!(E(TRUE U ((p23==1)&&(p102==1)))) * !((E(!(((p10==1...470
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t21, t27, t29, t31, t33, t35, t38, t40, t42, t95, t96, t97, t98, t99, t100, t101, t1...276
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:54:48] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:54:48] [INFO ] Applying decomposition
[2026-05-24 04:54:48] [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/graph12824480871564333462.txt' '-o' '/tmp/graph12824480871564333462.bin' '-w' '/tmp/graph12824480871564333462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12824480871564333462.bin' '-l' '-1' '-v' '-w' '/tmp/graph12824480871564333462.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:54:48] [INFO ] Decomposing Gal with order
[2026-05-24 04:54:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:54:48] [INFO ] Removed a total of 65 redundant transitions.
[2026-05-24 04:54:49] [INFO ] Flatten gal took : 90 ms
[2026-05-24 04:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 9 ms.
[2026-05-24 04:54:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12351353254095252727.gal : 3 ms
[2026-05-24 04:54:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11251214799531986335.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/CTLFireability12351353254095252727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11251214799531986335.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,9.04371e+09,0.366451,18628,353,173,22321,9797,203,73444,37,60179,0


Converting to forward existential form...Done !
original formula: E(!(((AF((EX((i7.u20.p66==1)) + EG((i7.u19.p64==1)))) + ((!(EF(((i0.u0.p23==1)&&(i0.u1.p102==1)))) * A(((i5.u13.p44==1)&&(i0.u1.p102==1))...399
=> equivalent forward existential formula: [(FwdU(Init,!(((!(EG(!((EX((i7.u20.p66==1)) + EG((i7.u19.p64==1)))))) + ((!(E(TRUE U ((i0.u0.p23==1)&&(i0.u1.p10...623
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t38, t40, t42, i0.t21, i0.u0.t1, i0.u0.t16, i0.u0.t101, i1.u2.t100, ...364
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,14.2731,434760,1,0,448935,110831,1256,3.10485e+06,207,1.30317e+06,194112
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 93 transition count 111
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 83 transition count 111
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 74 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 74 transition count 102
Applied a total of 39 rules in 29 ms. Remains 74 /102 variables (removed 28) and now considering 102/130 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9905511002224127737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3800439997324281377.kers'
[2026-05-24 04:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9905511002224127737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3800439997324281377.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 102 rows 72 cols 202 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-24 04:55:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3800439997324281377.kers
Total runtime 0 ms.
[2026-05-24 04:55:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-24 04:55:03] [INFO ] Invariant cache hit.
[2026-05-24 04:55:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:55:03] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-24 04:55:03] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-24 04:55:03] [INFO ] Invariant cache hit.
[2026-05-24 04:55:03] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 147 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2890 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/176 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 71/147 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 101/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 248 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5587ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5588ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/102 places, 102/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5850 ms. Remains : 74/102 places, 102/130 transitions.
[2026-05-24 04:55:09] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:55:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:09] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-24 04:55:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:09] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability5595840874247400597.gal : 1 ms
[2026-05-24 04:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability15426450489069569400.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/CTLFireability5595840874247400597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15426450489069569400.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EF(((A((p18==1) U ((p49==1)&&(p101==1))) * EG(((p4==1)&&(p102==1)))) * AG(((p79==1)&&(p101==1))))) + ((p89==1)&&(p101==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p89==1)&&(p101==1)))) * !(E(TRUE U ((!((E(!(((p49==1)&&(p101==1))) U (!((p18==1)) * !((...292
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t30, t32, t33, t35, t37, t39, t91, t92, t93, t94, t95, t96, t97, t98, t99...268
(forward)formula 0,0,1.16232,41908,1,0,146,195899,234,97,2308,199414,215
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 87 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 87 transition count 115
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 80 transition count 108
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 80 transition count 108
Applied a total of 44 rules in 13 ms. Remains 80 /102 variables (removed 22) and now considering 108/130 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9654950493654802413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11872077791542890006.kers'
[2026-05-24 04:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9654950493654802413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11872077791542890006.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 213 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:55:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11872077791542890006.kers
Total runtime 0 ms.
[2026-05-24 04:55:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:55:10] [INFO ] Invariant cache hit.
[2026-05-24 04:55:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:55:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-24 04:55:10] [INFO ] Invariant cache hit.
[2026-05-24 04:55:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/188 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 72/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 154 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/188 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 72/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 107/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 261 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5759ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5760ms
Starting structural reductions in LTL mode, iteration 1 : 80/102 places, 108/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5930 ms. Remains : 80/102 places, 108/130 transitions.
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:55:16] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:55:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8682509742473070973.gal : 1 ms
[2026-05-24 04:55:16] [INFO ] Time to serialize properties into /tmp/CTLFireability6551894384085931529.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/CTLFireability8682509742473070973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6551894384085931529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00089e+10,0.805175,30820,2,3506,5,159355,6,0,414,106132,0


Converting to forward existential form...Done !
original formula: (AG((((p52==0)||(p101==0)) * EG(((AF((p51==1)) + E(((p36==1)&&(p101==1)) U ((p45==1)&&(p101==1)))) + AX((p48==1)))))) + E(((p46!=1) * !((...318
=> equivalent forward existential formula: ([(FwdU((Init * !(E(((p46!=1) * !(((!(((((p68==1)&&(p102==1))||(p38==1))||(p94!=1))) * (EG(((p18==1)&&(p102==1))...631
Reverse transition relation is NOT exact ! Due to transitions t14, t21, t25, t27, t33, t35, t36, t38, t40, t42, t96, t97, t98, t99, t100, t101, t102, t103,...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:55:46] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:55:46] [INFO ] Applying decomposition
[2026-05-24 04:55:46] [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/graph4070207722689206983.txt' '-o' '/tmp/graph4070207722689206983.bin' '-w' '/tmp/graph4070207722689206983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4070207722689206983.bin' '-l' '-1' '-v' '-w' '/tmp/graph4070207722689206983.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:55:46] [INFO ] Decomposing Gal with order
[2026-05-24 04:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:55:46] [INFO ] Removed a total of 66 redundant transitions.
[2026-05-24 04:55:46] [INFO ] Flatten gal took : 22 ms
[2026-05-24 04:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 17 ms.
[2026-05-24 04:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12226229317682503623.gal : 2 ms
[2026-05-24 04:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13911622087439334579.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12226229317682503623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13911622087439334579.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,1.00089e+10,0.283273,16000,194,79,15012,6864,219,58188,36,61973,0


Converting to forward existential form...Done !
original formula: (AG((((i6.u16.p52==0)||(i1.u1.p101==0)) * EG(((AF((i6.u16.p51==1)) + E(((i4.u11.p36==1)&&(i1.u1.p101==1)) U ((i5.u13.p45==1)&&(i1.u1.p101...450
=> equivalent forward existential formula: ([(FwdU((Init * !(E(((i5.u14.p46!=1) * !(((!(((((i7.u22.p68==1)&&(i0.u0.p102==1))||(i4.u12.p38==1))||(i10.u29.p9...842
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t33, t35, t36, t38, t40, t42, i0.t21, i0.u9.t14, i0.u9.t103, i1.u1.t102, i2.u4.t101...368
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
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 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,9.49658,267436,1,0,308240,87494,1468,1.41178e+06,214,954461,154300
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 78 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 78 transition count 106
Applied a total of 48 rules in 18 ms. Remains 78 /102 variables (removed 24) and now considering 106/130 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3340799029110593385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12895179901062659649.kers'
[2026-05-24 04:55:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3340799029110593385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12895179901062659649.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 106 rows 76 cols 210 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:55:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12895179901062659649.kers
Total runtime 0 ms.
[2026-05-24 04:55:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 04:55:56] [INFO ] Invariant cache hit.
[2026-05-24 04:55:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:55:56] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2026-05-24 04:55:56] [INFO ] Invariant cache hit.
[2026-05-24 04:55:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/184 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 71/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 151 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/184 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 71/151 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 105/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 256 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5532ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5533ms
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 106/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5702 ms. Remains : 78/102 places, 106/130 transitions.
[2026-05-24 04:56:01] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:56:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:56:01] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-24 04:56:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:56:01] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6902565860816229018.gal : 2 ms
[2026-05-24 04:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2060083626082936132.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/CTLFireability6902565860816229018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2060083626082936132.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.04371e+09,1.21984,45964,2,7185,5,270457,6,0,405,161510,0


Converting to forward existential form...Done !
original formula: AG(E((((EF((p53==1)) + EG(((p30==1)&&(p101==1)))) + (EF(((p88==1)&&(p102==1))) + EG((p8==1)))) + (E(AX(((p93==1)&&(p102==1))) U EX(((p93=...215
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((((E(TRUE U (p53==1)) + EG(((p30==1)&&(p101==1)))) + (E(TRUE U ((p88==1)&&(p102==1))) + ...299
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t21, t27, t31, t33, t35, t36, t38, t40, t42, t95, t96, t97, t98, t99, t100, t101, t1...276
(forward)formula 0,0,9.87209,282500,1,0,496,1.5923e+06,254,259,2515,1.71397e+06,640
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 94 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 101 edges and 91 vertex of which 73 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 82 edges and 73 vertex of which 40 / 73 are part of one of the 20 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 53 transition count 92
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 47 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 34 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 26 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 26 transition count 40
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 18 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 18 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 10 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 10 transition count 15
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 2 with 1 rules applied. Total rules applied 113 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 7 transition count 12
Applied a total of 116 rules in 39 ms. Remains 7 /102 variables (removed 95) and now considering 12/130 (removed 118) transitions.
[2026-05-24 04:56:11] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12017755486437664525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8639169380276251703.kers'
[2026-05-24 04:56:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12017755486437664525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8639169380276251703.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 04:56:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8639169380276251703.kers
Total runtime 7 ms.
[2026-05-24 04:56:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 04:56:11] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:56:11] [INFO ] Invariant cache hit.
[2026-05-24 04:56:11] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 04:56:11] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 04:56:11] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:56:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 79 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 93 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/102 places, 12/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 286 ms. Remains : 7/102 places, 12/130 transitions.
[2026-05-24 04:56:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:56:12] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:56:12] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-24 04:56:12] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:56:12] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:56:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4435982621794476768.gal : 0 ms
[2026-05-24 04:56:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12556706150605474738.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/CTLFireability4435982621794476768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12556706150605474738.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,330,0.003239,3788,2,21,5,135,6,0,34,129,0


Converting to forward existential form...Done !
original formula: AG(EF((p61==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p61==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...172
(forward)formula 0,0,0.005138,4064,1,0,26,349,41,14,184,395,30
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 80 transition count 108
Applied a total of 44 rules in 11 ms. Remains 80 /102 variables (removed 22) and now considering 108/130 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-431108062686076366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11154676659364436978.kers'
[2026-05-24 04:56:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-431108062686076366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11154676659364436978.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 213 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:56:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11154676659364436978.kers
Total runtime 1 ms.
[2026-05-24 04:56:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 04:56:12] [INFO ] Invariant cache hit.
[2026-05-24 04:56:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:12] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-24 04:56:12] [INFO ] Invariant cache hit.
[2026-05-24 04:56:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/188 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 72/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 154 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 108/188 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 72/154 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 107/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 261 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5635ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5636ms
Starting structural reductions in LTL mode, iteration 1 : 80/102 places, 108/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5832 ms. Remains : 80/102 places, 108/130 transitions.
[2026-05-24 04:56:18] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:56:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:56:18] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-24 04:56:18] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:56:18] [INFO ] Flatten gal took : 19 ms
[2026-05-24 04:56:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7760007514535350474.gal : 0 ms
[2026-05-24 04:56:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11292701198117521918.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/CTLFireability7760007514535350474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11292701198117521918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00089e+10,0.95466,36856,2,4520,5,210835,6,0,414,121685,0


Converting to forward existential form...Done !
original formula: !(E(AX((((p4!=1) * ((p36!=1) + EF((p98==1)))) + EG(AG(((p73==1)&&(p102==1)))))) U !(EF(((p91==1) * EX(((p37==1)&&(p101==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((((p4!=1) * ((p36!=1) + E(TRUE U (p98==1)))) + EG(!(E(TRUE U !(((p73==1)&&(p102==1)))))))))))...219
Reverse transition relation is NOT exact ! Due to transitions t6, t21, t29, t31, t33, t35, t36, t38, t40, t42, t96, t97, t98, t99, t100, t101, t102, t103, ...278
(forward)formula 0,0,25.509,677248,1,0,437,3.44511e+06,254,293,2555,4.46856e+06,525
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 86 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 86 transition count 114
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 79 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 11 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8536717785094737858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4480304241116210228.kers'
[2026-05-24 04:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8536717785094737858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4480304241116210228.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 107 rows 77 cols 211 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-24 04:56:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4480304241116210228.kers
Total runtime 0 ms.
[2026-05-24 04:56:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 04:56:43] [INFO ] Invariant cache hit.
[2026-05-24 04:56:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/102 places, 107/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 78/102 places, 107/130 transitions.
[2026-05-24 04:56:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:56:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:56:43] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-24 04:56:43] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:56:43] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:56:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16913702874598363294.gal : 13 ms
[2026-05-24 04:56:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15517718782039549433.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/CTLFireability16913702874598363294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15517718782039549433.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EG(AX(AX(!(((p57==1)&&(p101==1)))))) U (p71==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EX(!(!(EX(!(!(((p57==1)&&(p101==1))))))))))) * (p71==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t32, t34, t35, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:57:13] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:57:13] [INFO ] Applying decomposition
[2026-05-24 04:57:14] [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/graph10691697233572244291.txt' '-o' '/tmp/graph10691697233572244291.bin' '-w' '/tmp/graph10691697233572244291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10691697233572244291.bin' '-l' '-1' '-v' '-w' '/tmp/graph10691697233572244291.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:57:14] [INFO ] Decomposing Gal with order
[2026-05-24 04:57:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:57:14] [INFO ] Removed a total of 56 redundant transitions.
[2026-05-24 04:57:14] [INFO ] Flatten gal took : 17 ms
[2026-05-24 04:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 2 ms.
[2026-05-24 04:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2606824948898894620.gal : 1 ms
[2026-05-24 04:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14678540148425367967.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/CTLFireability2606824948898894620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14678540148425367967.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,9.19287e+09,0.103704,7176,284,49,7798,732,176,10544,45,1930,0


Converting to forward existential form...Done !
original formula: E(EG(AX(AX(!(((u12.p57==1)&&(i1.u5.p101==1)))))) U (i9.u15.p71==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EX(!(!(EX(!(!(((u12.p57==1)&&(i1.u5.p101==1))))))))))) * (i9.u15.p71==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t34, t37, t39, t41, i0.t28, i0.t24, i0.u0.t102, i0.u11.t98, i0.u20.t95, i1.u1.t101,...352
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,1.93794,84364,1,0,182917,9408,883,255931,240,36842,140309
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 94 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 94 transition count 113
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 85 transition count 113
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 77 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 77 transition count 105
Applied a total of 35 rules in 8 ms. Remains 77 /102 variables (removed 25) and now considering 105/130 (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-1625804333858529145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14495953222081286542.kers'
[2026-05-24 04:57:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1625804333858529145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14495953222081286542.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 4 ms.
// Phase 1: matrix 105 rows 75 cols 207 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-24 04:57:16] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14495953222081286542.kers
Total runtime 5 ms.
[2026-05-24 04:57:16] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-05-24 04:57:16] [INFO ] Invariant cache hit.
[2026-05-24 04:57:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:57:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2026-05-24 04:57:16] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-24 04:57:16] [INFO ] Invariant cache hit.
[2026-05-24 04:57:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 72/151 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 151 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/182 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 72/151 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 104/255 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 255 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2784 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5770ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5772ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/102 places, 105/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6307 ms. Remains : 77/102 places, 105/130 transitions.
[2026-05-24 04:57:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:57:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:22] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-24 04:57:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:22] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9509837501656376673.gal : 0 ms
[2026-05-24 04:57:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12952777955245495196.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/CTLFireability9509837501656376673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12952777955245495196.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E((EF((((EF(((p68==1)&&(p102==1))) + (p14!=1)) + (((p46==1)&&(p101==1))||((p34==1)&&(p102==1)))) + ((((p98==1)&&(p102==1))||((p24==1)&&(p...268
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (((E(TRUE U ((p68==1)&&(p102==1))) + (p14!=1)) + (((p46==1)&&(p101==1))||((p34==1)&&(p102=...338
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t25, t27, t29, t33, t36, t38, t40, t92, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,2.08729,72152,1,0,218,370876,246,130,2562,372863,315
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 93 transition count 112
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 84 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 76 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 76 transition count 104
Applied a total of 35 rules in 24 ms. Remains 76 /102 variables (removed 26) and now considering 104/130 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12456582716671398434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1300375978458804743.kers'
[2026-05-24 04:57:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12456582716671398434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1300375978458804743.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 205 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:57:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1300375978458804743.kers
Total runtime 0 ms.
[2026-05-24 04:57:24] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-24 04:57:24] [INFO ] Invariant cache hit.
[2026-05-24 04:57:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:57:24] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/102 places, 104/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 419 ms. Remains : 75/102 places, 104/130 transitions.
[2026-05-24 04:57:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:24] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:57:24] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 04:57:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:24] [INFO ] Time to serialize gal into /tmp/CTLFireability805911106246194658.gal : 1 ms
[2026-05-24 04:57:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11927758927456208865.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/CTLFireability805911106246194658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11927758927456208865.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85213e+09,0.273075,16952,2,5157,5,86816,6,0,394,44234,0


Converting to forward existential form...Done !
original formula: EF(((AG((p78==1)) * (p42==1)) * (p101==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p101==1)) * (p42==1)) * !(E(TRUE U !((p78==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t38, t40, t89, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,0,2.83796,99760,1,0,146,512328,230,96,2289,477221,218
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 90 vertex of which 70 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Graph (trivial) has 78 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 44 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 9 transition count 14
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 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 6 transition count 11
Applied a total of 113 rules in 6 ms. Remains 6 /102 variables (removed 96) and now considering 11/130 (removed 119) transitions.
[2026-05-24 04:57:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1171546276047299467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18379020768185864092.kers'
[2026-05-24 04:57:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1171546276047299467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18379020768185864092.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 13 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 04:57:27] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18379020768185864092.kers
Total runtime 0 ms.
[2026-05-24 04:57:27] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 04:57:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 04:57:27] [INFO ] Invariant cache hit.
[2026-05-24 04:57:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 04:57:27] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 04:57:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-24 04:57:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 94 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/102 places, 11/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 6/102 places, 11/130 transitions.
[2026-05-24 04:57:28] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:57:28] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:57:28] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-24 04:57:28] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:57:28] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12831621260537611753.gal : 0 ms
[2026-05-24 04:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16869927438077954476.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/CTLFireability12831621260537611753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16869927438077954476.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,275,0.002246,3792,2,19,5,125,6,0,30,121,0


Converting to forward existential form...Done !
original formula: EG(EF((p84==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p84==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,1,0.00689,4092,1,0,65,977,46,57,172,1715,77
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 76 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 76 transition count 104
Applied a total of 52 rules in 3 ms. Remains 76 /102 variables (removed 26) and now considering 104/130 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10236683067429072881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11891728391153892524.kers'
[2026-05-24 04:57:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10236683067429072881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11891728391153892524.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:57:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11891728391153892524.kers
Total runtime 0 ms.
[2026-05-24 04:57:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 04:57:28] [INFO ] Invariant cache hit.
[2026-05-24 04:57:28] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:57:28] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-24 04:57:28] [INFO ] Invariant cache hit.
[2026-05-24 04:57:28] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2500 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5321ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5324ms
Starting structural reductions in LTL mode, iteration 1 : 76/102 places, 104/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5469 ms. Remains : 76/102 places, 104/130 transitions.
[2026-05-24 04:57:33] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:57:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:33] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 04:57:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:33] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2200753591185834436.gal : 1 ms
[2026-05-24 04:57:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16286029243632311442.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/CTLFireability2200753591185834436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16286029243632311442.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(E(E(EX(!(((p57==1)&&(p101==1)))) U AX((((p28==1)&&(p102==1))||((p76==1)&&(p101==1))))) U ((p35==1)&&(p101==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),E(EX(!(((p57==1)&&(p101==1)))) U !(EX(!((((p28==1)&&(p102==1))||((p76==1)&&(p101==1)))))))) * ((...185
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,18.2496,525548,1,0,404,2.96345e+06,232,302,2471,3.84205e+06,480
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 96 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 96 transition count 119
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 91 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 86 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 86 transition count 114
Applied a total of 21 rules in 9 ms. Remains 86 /102 variables (removed 16) and now considering 114/130 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1896190854084369729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13073426894820549602.kers'
[2026-05-24 04:57:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1896190854084369729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13073426894820549602.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 5 ms.
// Phase 1: matrix 114 rows 84 cols 222 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 04:57:51] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13073426894820549602.kers
Total runtime 10 ms.
[2026-05-24 04:57:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:57:51] [INFO ] Invariant cache hit.
[2026-05-24 04:57:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-24 04:57:52] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-24 04:57:52] [INFO ] Redundant transitions in 2 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-24 04:57:52] [INFO ] Invariant cache hit.
[2026-05-24 04:57:52] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/200 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 75/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/200 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 75/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 276 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6434ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6448ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/102 places, 114/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6633 ms. Remains : 86/102 places, 114/130 transitions.
[2026-05-24 04:57:58] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:57:58] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:57:58] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-24 04:57:58] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:57:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:57:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10928671494046022810.gal : 1 ms
[2026-05-24 04:57:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5014192517691724703.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/CTLFireability10928671494046022810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5014192517691724703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(AG(((A((p74!=1) U A((p24==1) U (p43==1))) + ((p96==1)&&(p101==1))) + ((p67==1)&&(p101==1)))) U ((EF((!(AG(((p60==1)&&(p101==1)))) * ((E...510
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U (!(!(E(TRUE U !(((p60==1)&&(p101==1)))))) * ((E(((p45==1)&&(p101==1)) U ((p55==1)&&(...1703
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t29, t31, t33, t42, t93, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, ...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.86195,106476,1,0,693,605371,289,463,2802,751409,943
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 76 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 76 transition count 104
Applied a total of 52 rules in 6 ms. Remains 76 /102 variables (removed 26) and now considering 104/130 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17972391629600694829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11452214122663893186.kers'
[2026-05-24 04:58:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17972391629600694829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11452214122663893186.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:58:01] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11452214122663893186.kers
Total runtime 0 ms.
[2026-05-24 04:58:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:58:01] [INFO ] Invariant cache hit.
[2026-05-24 04:58:01] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:58:01] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-24 04:58:01] [INFO ] Invariant cache hit.
[2026-05-24 04:58:01] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/180 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 71/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5234ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5234ms
Starting structural reductions in LTL mode, iteration 1 : 76/102 places, 104/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5370 ms. Remains : 76/102 places, 104/130 transitions.
[2026-05-24 04:58:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:58:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:58:06] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 04:58:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:58:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:58:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2092392869489435701.gal : 1 ms
[2026-05-24 04:58:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2401107317907265142.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/CTLFireability2092392869489435701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2401107317907265142.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.61686e+09,0.714792,29536,2,3271,5,151470,6,0,395,95498,0


Converting to forward existential form...Done !
original formula: E(!(AX(((p18==1) * AX(!(((p65==1)&&(p101==1))))))) U (((p64==1)&&(p102==1))&&((p56==1)&&(p101==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((p18==1) * !(EX(!(!(((p65==1)&&(p101==1)))))))))))) * (((p64==1)&&(p102==1))&&((p56==1)&&(...176
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,10.6174,316124,1,0,381,1.63861e+06,230,287,2370,2.05618e+06,498
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 84 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 84 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 79 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 79 transition count 107
Applied a total of 46 rules in 16 ms. Remains 79 /102 variables (removed 23) and now considering 107/130 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10457891727909857206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12234810628480283179.kers'
[2026-05-24 04:58:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10457891727909857206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12234810628480283179.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 107 rows 77 cols 212 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-24 04:58:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12234810628480283179.kers
Total runtime 0 ms.
[2026-05-24 04:58:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 04:58:17] [INFO ] Invariant cache hit.
[2026-05-24 04:58:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:58:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-24 04:58:17] [INFO ] Invariant cache hit.
[2026-05-24 04:58:17] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/186 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 71/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 152 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2551 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/186 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 71/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 106/258 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 258 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5352ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5352ms
Starting structural reductions in LTL mode, iteration 1 : 79/102 places, 107/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5584 ms. Remains : 79/102 places, 107/130 transitions.
[2026-05-24 04:58:23] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:58:23] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:58:23] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-24 04:58:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:58:23] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:58:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14564872558431815022.gal : 1 ms
[2026-05-24 04:58:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2055035194625506343.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/CTLFireability14564872558431815022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2055035194625506343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((E(((A((p13==1) U (p13==1)) + !(((p34==1)&&(p102==1)))) * (AF((p73==1)) + E(((p73==1)&&(p102==1)) U (p96==1)))) U EX(E(((p9==1)&&(p101...200
=> equivalent forward existential formula: [(FwdU(EY(FwdU((FwdU(Init,TRUE) * (p63==1)),((!((E(!((p13==1)) U (!((p13==1)) * !((p13==1)))) + EG(!((p13==1))))...305
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t19, t22, t26, t30, t32, t36, t37, t39, t43, t96, t97, t98, t99, t100, t101, t102, t1...276
Detected timeout of ITS tools.
[2026-05-24 04:58:53] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:58:53] [INFO ] Applying decomposition
[2026-05-24 04:58:53] [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/graph2557563173983525731.txt' '-o' '/tmp/graph2557563173983525731.bin' '-w' '/tmp/graph2557563173983525731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2557563173983525731.bin' '-l' '-1' '-v' '-w' '/tmp/graph2557563173983525731.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:58:53] [INFO ] Decomposing Gal with order
[2026-05-24 04:58:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:58:53] [INFO ] Removed a total of 65 redundant transitions.
[2026-05-24 04:58:53] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:58:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 3 ms.
[2026-05-24 04:58:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8122235972170632380.gal : 1 ms
[2026-05-24 04:58:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8504323385433612199.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/CTLFireability8122235972170632380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8504323385433612199.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,9.78175e+09,5.88844,196212,857,202,261888,174012,208,1.19338e+06,42,878793,0


Converting to forward existential form...Done !
original formula: EF((E(((A((i10.u0.p13==1) U (i10.u0.p13==1)) + !(((i3.u9.p34==1)&&(i10.u30.p102==1)))) * (AF((i10.u0.p73==1)) + E(((i10.u0.p73==1)&&(i10....289
=> equivalent forward existential formula: [(FwdU(EY(FwdU((FwdU(Init,TRUE) * (i10.u0.p63==1)),((!((E(!((i10.u0.p13==1)) U (!((i10.u0.p13==1)) * !((i10.u0.p...408
Reverse transition relation is NOT exact ! Due to transitions t26, t30, t32, t36, t37, t39, t43, i0.u1.t101, i1.u4.t100, i2.u7.t103, i3.u10.t99, i4.u13.t10...374
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,24.7644,641232,1,0,473613,174012,1221,5.5914e+06,231,2.01409e+06,311906
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 130/130 transitions.
Graph (complete) has 283 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 90 vertex of which 71 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Graph (trivial) has 80 edges and 71 vertex of which 40 / 71 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 91
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 45 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 101 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 9 transition count 14
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 2 with 1 rules applied. Total rules applied 111 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 6 transition count 11
Applied a total of 114 rules in 13 ms. Remains 6 /102 variables (removed 96) and now considering 11/130 (removed 119) transitions.
[2026-05-24 04:59:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6041306041857164422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6871627535580490960.kers'
[2026-05-24 04:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6041306041857164422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6871627535580490960.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 04:59:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6871627535580490960.kers
Total runtime 1 ms.
[2026-05-24 04:59:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 04:59:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:59:18] [INFO ] Invariant cache hit.
[2026-05-24 04:59:18] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 04:59:18] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 04:59:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 04:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 49 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/102 places, 11/130 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 177 ms. Remains : 6/102 places, 11/130 transitions.
[2026-05-24 04:59:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:59:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:59:18] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 108 steps (2 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 04:59:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:59:18] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:59:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9609720823858337699.gal : 0 ms
[2026-05-24 04:59:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12696706991943605791.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/ReachabilityCardinality9609720823858337699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12696706991943605791.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 : 102/102 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 87 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 87 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 81 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 81 transition count 109
Applied a total of 42 rules in 8 ms. Remains 81 /102 variables (removed 21) and now considering 109/130 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9510432823951514350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16124175182643408351.kers'
[2026-05-24 04:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9510432823951514350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16124175182643408351.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 109 rows 79 cols 216 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-24 04:59:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16124175182643408351.kers
Total runtime 1 ms.
[2026-05-24 04:59:18] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 04:59:18] [INFO ] Invariant cache hit.
[2026-05-24 04:59:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-24 04:59:18] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2026-05-24 04:59:18] [INFO ] Invariant cache hit.
[2026-05-24 04:59:18] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 73/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 156 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 109/190 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 73/156 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 108/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 264 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2831 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5785ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5786ms
Starting structural reductions in LTL mode, iteration 1 : 81/102 places, 109/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5923 ms. Remains : 81/102 places, 109/130 transitions.
[2026-05-24 04:59:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:59:24] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:59:24] [INFO ] Input system was already deterministic with 109 transitions.
[2026-05-24 04:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14117310525178797045.gal : 0 ms
[2026-05-24 04:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11561330158710691029.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/CTLFireability14117310525178797045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11561330158710691029.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11083e+10,0.883617,34888,2,6568,5,196580,6,0,420,116714,0


Converting to forward existential form...Done !
original formula: E(((p52==1)&&(p101==1)) U (E(EF(((p8==1)&&(p102==1))) U ((p80==1)&&(p101==1))) * AF((AX((((p23==1)&&(p102==1))||((p78==1)&&(p102==1)))) +...211
=> equivalent forward existential formula: [((FwdU(Init,((p52==1)&&(p101==1))) * E(E(TRUE U ((p8==1)&&(p102==1))) U ((p80==1)&&(p101==1)))) * !(EG(!((!(EX(...275
Reverse transition relation is NOT exact ! Due to transitions t17, t22, t26, t28, t32, t34, t36, t41, t43, t88, t92, t94, t98, t99, t100, t101, t102, t103,...285
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 54/54/55
(forward)formula 0,1,9.94211,302520,1,0,347,1.65891e+06,265,218,2745,1.99619e+06,431
FORMULA DiscoveryGPU-PT-10a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 04:59:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:59:34] [INFO ] Flatten gal took : 2 ms
Total runtime 331298 ms.

BK_STOP 1779598774356

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DiscoveryGPU-PT-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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