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.r050-smll-177946901000002.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 Champagne-PT-H04T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.3K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 61K 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 Champagne-PT-H04T0R-CTLFireability-2024-00
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-01
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-02
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-03
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-04
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-05
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-06
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-07
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-08
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-09
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-10
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-11
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-12
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-13
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-14
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779479459119

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 19:51:01] [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-22 19:51:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:51:02] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2026-05-22 19:51:02] [INFO ] Transformed 219 places.
[2026-05-22 19:51:02] [INFO ] Transformed 274 transitions.
[2026-05-22 19:51:02] [INFO ] Found NUPN structural information;
[2026-05-22 19:51:02] [INFO ] Parsed PT model containing 219 places and 274 transitions and 666 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 98 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 274/274 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 187 transition count 242
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 187 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 186 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 186 transition count 241
Applied a total of 66 rules in 74 ms. Remains 186 /219 variables (removed 33) and now considering 241/274 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6177519558165489189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1895528888287157572.kers'
[2026-05-22 19:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6177519558165489189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1895528888287157572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 241 rows 186 cols 600 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-22 19:51:02] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1895528888287157572.kers
Total runtime 3 ms.
[2026-05-22 19:51:02] [INFO ] Implicit Places using invariants in 521 ms returned []
[2026-05-22 19:51:02] [INFO ] Invariant cache hit.
[2026-05-22 19:51:03] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-22 19:51:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/427 variables, 186/206 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 206 constraints, problems are : Problem set: 0 solved, 240 unsolved in 27579 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/427 variables, 186/206 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 240/446 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 12/458 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 458 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57776ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 57804ms
Starting structural reductions in LTL mode, iteration 1 : 186/219 places, 241/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58900 ms. Remains : 186/219 places, 241/274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Applied a total of 0 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2026-05-22 19:52:01] [INFO ] Invariant cache hit.
[2026-05-22 19:52:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-22 19:52:01] [INFO ] Invariant cache hit.
[2026-05-22 19:52:01] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 186/186 places, 241/241 transitions.
Support contains 98 out of 186 places after structural reductions.
[2026-05-22 19:52:01] [INFO ] Flatten gal took : 94 ms
[2026-05-22 19:52:01] [INFO ] Flatten gal took : 38 ms
[2026-05-22 19:52:02] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 97 out of 186 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (278 resets) in 2515 ms. (15 steps per ms) remains 1/89 properties
BEST_FIRST walk for 40003 steps (31 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
[2026-05-22 19:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp60 is UNSAT
After SMT solving in domain Real declared 54/427 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 3/11 constraints, State Equation: 0/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms 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-22 19:52:03] [INFO ] Flatten gal took : 16 ms
[2026-05-22 19:52:03] [INFO ] Flatten gal took : 22 ms
[2026-05-22 19:52:03] [INFO ] Input system was already deterministic with 241 transitions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Graph (trivial) has 181 edges and 186 vertex of which 40 / 186 are part of one of the 6 SCC in 3 ms
Free SCC test removed 34 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 151 transition count 147
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 98 transition count 132
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 91 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 129 place count 91 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 89 transition count 130
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 156 place count 66 transition count 107
Iterating global reduction 3 with 23 rules applied. Total rules applied 179 place count 66 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 179 place count 66 transition count 102
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 189 place count 61 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 59 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 59 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 59 transition count 95
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 229 place count 42 transition count 78
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 234 place count 37 transition count 61
Iterating global reduction 4 with 5 rules applied. Total rules applied 239 place count 37 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 244 place count 37 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 35 transition count 54
Applied a total of 246 rules in 60 ms. Remains 35 /186 variables (removed 151) and now considering 54/241 (removed 187) transitions.
[2026-05-22 19:52:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11323623719123946857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9470625863404724123.kers'
[2026-05-22 19:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11323623719123946857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9470625863404724123.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 38 rows 33 cols 102 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 19:52:03] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9470625863404724123.kers
Total runtime 1 ms.
[2026-05-22 19:52:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 19:52:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2026-05-22 19:52:03] [INFO ] Invariant cache hit.
[2026-05-22 19:52:03] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-22 19:52:03] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-22 19:52:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2026-05-22 19:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/73 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 46 constraints, problems are : Problem set: 0 solved, 30 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/73 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 76 constraints, problems are : Problem set: 0 solved, 30 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1595ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/186 places, 54/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1778 ms. Remains : 35/186 places, 54/241 transitions.
[2026-05-22 19:52:05] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:52:05] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:52:05] [INFO ] Input system was already deterministic with 54 transitions.
[2026-05-22 19:52:05] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:52:05] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5669905934964391689.gal : 1 ms
[2026-05-22 19:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6304657302339292091.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/CTLFireability5669905934964391689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6304657302339292091.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,209952,0.033053,4108,2,60,5,969,6,0,191,845,0


Converting to forward existential form...Done !
original formula: (EG(AG((p72==0))) * EG(((p5==1) + EG((p174==0)))))
=> equivalent forward existential formula: [FwdG((Init * EG(!(E(TRUE U !((p72==0)))))),((p5==1) + EG((p174==0))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 52/0/2
(forward)formula 0,0,0.10831,6328,1,0,48,12279,35,31,996,15960,37
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 147 transition count 202
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 147 transition count 202
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 100 place count 125 transition count 179
Iterating global reduction 0 with 22 rules applied. Total rules applied 122 place count 125 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 124 place count 125 transition count 177
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 135 place count 114 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 146 place count 114 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 151 place count 114 transition count 152
Applied a total of 151 rules in 37 ms. Remains 114 /186 variables (removed 72) and now considering 152/241 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8375064873432889778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6854692831943614582.kers'
[2026-05-22 19:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8375064873432889778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6854692831943614582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 114 cols 392 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-22 19:52:05] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6854692831943614582.kers
Total runtime 1 ms.
[2026-05-22 19:52:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-22 19:52:05] [INFO ] Invariant cache hit.
[2026-05-22 19:52:05] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2026-05-22 19:52:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/266 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 125 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8943 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/266 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 151/276 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 283 constraints, problems are : Problem set: 0 solved, 151 unsolved in 23282 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32255ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 32256ms
Starting structural reductions in LTL mode, iteration 1 : 114/186 places, 152/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32510 ms. Remains : 114/186 places, 152/241 transitions.
[2026-05-22 19:52:37] [INFO ] Flatten gal took : 16 ms
[2026-05-22 19:52:37] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:52:37] [INFO ] Input system was already deterministic with 152 transitions.
[2026-05-22 19:52:37] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:52:37] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:52:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16429188262659036922.gal : 6 ms
[2026-05-22 19:52:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1389815448524724837.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/CTLFireability16429188262659036922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1389815448524724837.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,5.24017e+10,0.073389,5484,2,609,5,6642,6,0,610,5654,0


Converting to forward existential form...Done !
original formula: AG(((EX(((p90==0) + EG((p172==1)))) * (EF((p137==1)) + (p27==0))) * (A((p121==1) U !(((p99==1)&&(p147==1)))) + EF((p69==0)))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX(((p90==0) + EG((p172==1))))))] = FALSE * [((FwdU(Init,TRUE) * !((p27==0))) * !(E(TRUE...408
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t34, t38, t45, t48, t55, t56, t60, t65, t69, t71, t76, t81, t92, t102, t11...258
(forward)formula 0,0,1.51085,34824,1,0,314,174902,346,162,3631,158349,414
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 149 transition count 204
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 149 transition count 204
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 96 place count 127 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 118 place count 127 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 127 transition count 179
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 134 place count 114 transition count 155
Iterating global reduction 1 with 13 rules applied. Total rules applied 147 place count 114 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 114 transition count 149
Applied a total of 153 rules in 16 ms. Remains 114 /186 variables (removed 72) and now considering 149/241 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3158036986229491116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8633266181135949903.kers'
[2026-05-22 19:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3158036986229491116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8633266181135949903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 114 cols 384 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-22 19:52:39] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8633266181135949903.kers
Total runtime 2 ms.
[2026-05-22 19:52:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-22 19:52:39] [INFO ] Invariant cache hit.
[2026-05-22 19:52:39] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-22 19:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/263 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 126 constraints, problems are : Problem set: 0 solved, 148 unsolved in 10059 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 149/263 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 148/274 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 279 constraints, problems are : Problem set: 0 solved, 148 unsolved in 18499 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28588ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 28590ms
Starting structural reductions in LTL mode, iteration 1 : 114/186 places, 149/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28890 ms. Remains : 114/186 places, 149/241 transitions.
[2026-05-22 19:53:08] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:53:08] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:53:08] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-22 19:53:08] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:53:08] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:53:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2813884745812462587.gal : 5 ms
[2026-05-22 19:53:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10414103393518777392.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/CTLFireability2813884745812462587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10414103393518777392.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,5.16272e+10,0.060173,5540,2,660,5,6971,6,0,607,6258,0


Converting to forward existential form...Done !
original formula: (EG(((AX(((p51==1) + AF((p79==1)))) * AG(((AG((p101==1)) + (p77==0)) + (p91==0)))) + AX(EX((p207==1))))) * EF((p54==1)))
=> equivalent forward existential formula: [(FwdU((Init * EG(((!(EX(!(((p51==1) + !(EG(!((p79==1)))))))) * !(E(TRUE U !(((!(E(TRUE U !((p101==1)))) + (p77=...232
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t64, t67, t72, t77, t81, t86, t91,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.24811,113044,1,0,927,659501,339,486,3795,742327,1105
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-02 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 : 186/186 places, 241/241 transitions.
Graph (trivial) has 174 edges and 186 vertex of which 40 / 186 are part of one of the 6 SCC in 2 ms
Free SCC test removed 34 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 151 transition count 150
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 119 place count 101 transition count 132
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 92 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 128 place count 92 transition count 128
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 136 place count 88 transition count 128
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 158 place count 66 transition count 106
Iterating global reduction 3 with 22 rules applied. Total rules applied 180 place count 66 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 180 place count 66 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 186 place count 63 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 61 transition count 98
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 61 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 192 place count 61 transition count 96
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 228 place count 43 transition count 78
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 232 place count 39 transition count 63
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 39 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 240 place count 39 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 37 transition count 57
Applied a total of 242 rules in 44 ms. Remains 37 /186 variables (removed 149) and now considering 57/241 (removed 184) transitions.
[2026-05-22 19:53:12] [INFO ] Flow matrix only has 41 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1427240075634803811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1690458726813299612.kers'
[2026-05-22 19:53:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1427240075634803811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1690458726813299612.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 40 rows 33 cols 108 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-22 19:53:12] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1690458726813299612.kers
Total runtime 1 ms.
[2026-05-22 19:53:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 19:53:12] [INFO ] Flow matrix only has 41 transitions (discarded 16 similar events)
[2026-05-22 19:53:12] [INFO ] Invariant cache hit.
[2026-05-22 19:53:12] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2026-05-22 19:53:12] [INFO ] Redundant transitions in 2 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-22 19:53:12] [INFO ] Flow matrix only has 41 transitions (discarded 16 similar events)
[2026-05-22 19:53:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 40/77 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/78 variables, and 48 constraints, problems are : Problem set: 0 solved, 33 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 3/37 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 40/77 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 33/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/78 variables, and 81 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2002ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2003ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/186 places, 57/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2204 ms. Remains : 37/186 places, 57/241 transitions.
[2026-05-22 19:53:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:53:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:53:14] [INFO ] Input system was already deterministic with 57 transitions.
[2026-05-22 19:53:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:53:14] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:53:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1023392265375768697.gal : 2 ms
[2026-05-22 19:53:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13012469297568696390.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/CTLFireability1023392265375768697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13012469297568696390.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,259200,0.018823,4180,2,64,5,802,6,0,201,524,0


Converting to forward existential form...Done !
original formula: E(!(((p158==1)&&(p205==1))) U (EG((p171==1)) * EG(EF(((p94==1)||(p160!=1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(((p158==1)&&(p205==1)))) * EG((p171==1))),E(TRUE U ((p94==1)||(p160!=1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 49/0/8
(forward)formula 0,1,0.063075,5096,1,0,11,4687,33,6,1043,3424,15
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 150 transition count 205
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 150 transition count 205
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 94 place count 128 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 116 place count 128 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 120 place count 128 transition count 178
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 130 place count 118 transition count 160
Iterating global reduction 1 with 10 rules applied. Total rules applied 140 place count 118 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 144 place count 118 transition count 156
Applied a total of 144 rules in 20 ms. Remains 118 /186 variables (removed 68) and now considering 156/241 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5977753134061163245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7892226359546528515.kers'
[2026-05-22 19:53:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5977753134061163245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7892226359546528515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 118 cols 402 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-22 19:53:14] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7892226359546528515.kers
Total runtime 1 ms.
[2026-05-22 19:53:15] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 19:53:15] [INFO ] Invariant cache hit.
[2026-05-22 19:53:15] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-05-22 19:53:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/274 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 0/274 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 129 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9224 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/274 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 155/284 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 287 constraints, problems are : Problem set: 0 solved, 155 unsolved in 22586 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 31834ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 31838ms
Starting structural reductions in LTL mode, iteration 1 : 118/186 places, 156/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32214 ms. Remains : 118/186 places, 156/241 transitions.
[2026-05-22 19:53:47] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:53:47] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:53:47] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-22 19:53:47] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:53:47] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:53:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11865677963500809432.gal : 2 ms
[2026-05-22 19:53:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17574096191680797252.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/CTLFireability11865677963500809432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17574096191680797252.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,7.47195e+10,0.059646,5608,2,663,5,7205,6,0,630,6447,0


Converting to forward existential form...Done !
original formula: (E(!((EF((p33==1)) + !((!(((p40==1)&&(p109==1))) + AX((p46==1)))))) U (p15==1)) * EX(EF(((p20==1)&&(p88==1)))))
=> equivalent forward existential formula: [(FwdU(EY((Init * E(!((E(TRUE U (p33==1)) + !((!(((p40==1)&&(p109==1))) + !(EX(!((p46==1)))))))) U (p15==1)))),T...193
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t32, t36, t41, t42, t46, t52, t56, t58, t63, t67, t73, t78, t88, t103, t11...258
(forward)formula 0,0,1.98661,56952,1,0,393,295654,342,229,3697,343242,484
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 149 transition count 204
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 149 transition count 204
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 96 place count 127 transition count 181
Iterating global reduction 0 with 22 rules applied. Total rules applied 118 place count 127 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 127 transition count 178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 132 place count 116 transition count 158
Iterating global reduction 1 with 11 rules applied. Total rules applied 143 place count 116 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 147 place count 116 transition count 154
Applied a total of 147 rules in 7 ms. Remains 116 /186 variables (removed 70) and now considering 154/241 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6205658949322218541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8694177742667218376.kers'
[2026-05-22 19:53:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6205658949322218541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8694177742667218376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 116 cols 396 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-22 19:53:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8694177742667218376.kers
Total runtime 1 ms.
[2026-05-22 19:53:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 19:53:49] [INFO ] Invariant cache hit.
[2026-05-22 19:53:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-22 19:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/270 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 127 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8538 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/270 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 153/280 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 153 unsolved in 17683 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26233ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 26235ms
Starting structural reductions in LTL mode, iteration 1 : 116/186 places, 154/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26449 ms. Remains : 116/186 places, 154/241 transitions.
[2026-05-22 19:54:15] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:54:15] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:54:15] [INFO ] Input system was already deterministic with 154 transitions.
[2026-05-22 19:54:15] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:54:15] [INFO ] Flatten gal took : 26 ms
[2026-05-22 19:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1285548194595823170.gal : 3 ms
[2026-05-22 19:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8597649023521170152.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/CTLFireability1285548194595823170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8597649023521170152.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,6.20832e+10,0.086014,5356,2,592,5,6245,6,0,620,5014,0


Converting to forward existential form...Done !
original formula: E((p11!=1) U EX((!((((EF(((p137==1)&&(p166==1))) + EX((p194==1))) * !(((p77==1)&&(p126==1)))) * (p16==1))) * !(((!(E((p118==1) U (p48==1)...216
=> equivalent forward existential formula: [(FwdU((((EY(FwdU(Init,(p11!=1))) * !((((E(TRUE U ((p137==1)&&(p166==1))) + EX((p194==1))) * !(((p77==1)&&(p126=...269
Reverse transition relation is NOT exact ! Due to transitions t3, t23, t24, t28, t34, t38, t43, t44, t48, t55, t59, t64, t68, t78, t88, t103, t111, Inters...248
Hit Full ! (commute/partial/dont) 152/0/2
Hit Full ! (commute/partial/dont) 148/0/6
(forward)formula 0,1,1.54697,37736,1,0,297,195438,351,174,4076,175984,417
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Graph (trivial) has 160 edges and 186 vertex of which 27 / 186 are part of one of the 4 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 162 transition count 161
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 68 rules applied. Total rules applied 121 place count 110 transition count 145
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 133 place count 102 transition count 141
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 138 place count 98 transition count 140
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 138 place count 98 transition count 135
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 148 place count 93 transition count 135
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 171 place count 70 transition count 112
Iterating global reduction 4 with 23 rules applied. Total rules applied 194 place count 70 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 70 transition count 111
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 195 place count 70 transition count 109
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 199 place count 68 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 66 transition count 104
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 66 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 66 transition count 102
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 241 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 243 place count 46 transition count 78
Iterating global reduction 6 with 2 rules applied. Total rules applied 245 place count 46 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 247 place count 46 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 44 transition count 74
Applied a total of 249 rules in 50 ms. Remains 44 /186 variables (removed 142) and now considering 74/241 (removed 167) transitions.
[2026-05-22 19:54:17] [INFO ] Flow matrix only has 61 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11071515747925769853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2346904809384110005.kers'
[2026-05-22 19:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11071515747925769853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2346904809384110005.kers]
Normalized transition count is 60 out of 61 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 60 rows 42 cols 162 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 19:54:17] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2346904809384110005.kers
Total runtime 1 ms.
[2026-05-22 19:54:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-22 19:54:17] [INFO ] Flow matrix only has 61 transitions (discarded 13 similar events)
[2026-05-22 19:54:17] [INFO ] Invariant cache hit.
[2026-05-22 19:54:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2026-05-22 19:54:17] [INFO ] Redundant transitions in 2 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-22 19:54:17] [INFO ] Flow matrix only has 61 transitions (discarded 13 similar events)
[2026-05-22 19:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 6/44 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 60/104 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/105 variables, and 57 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2509 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 60/104 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 53/109 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/105 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5391ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5393ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/186 places, 74/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5619 ms. Remains : 44/186 places, 74/241 transitions.
[2026-05-22 19:54:22] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:54:22] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:54:22] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-22 19:54:22] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:54:22] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14210677985909808833.gal : 1 ms
[2026-05-22 19:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11756610989110107509.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/CTLFireability14210677985909808833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11756610989110107509.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.18973e+06,0.027004,4328,2,123,5,1252,6,0,247,859,0


Converting to forward existential form...Done !
original formula: (AG((((p39==1) + E(AG((p124==1)) U (p162!=1))) + AF(((AF((p119==1)) * (p59==1)) * E((p135==1) U ((p58==1)&&(p107==1))))))) + EF(AG(((p135...192
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(E(TRUE U !(E(TRUE U !(((p135==0) + EG(((p137==0)||(p150==0)))))))))),TRUE) * !(((p39==1) +...286
Reverse transition relation is NOT exact ! Due to transitions t6, t14, t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,1,0.820288,20924,1,0,524,99572,195,266,1580,119421,625
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 147 transition count 202
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 147 transition count 202
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 100 place count 125 transition count 179
Iterating global reduction 0 with 22 rules applied. Total rules applied 122 place count 125 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 125 place count 125 transition count 176
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 135 place count 115 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 145 place count 115 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 149 place count 115 transition count 153
Applied a total of 149 rules in 9 ms. Remains 115 /186 variables (removed 71) and now considering 153/241 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9344468700200787623.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13879050056609428671.kers'
[2026-05-22 19:54:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9344468700200787623.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13879050056609428671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 115 cols 394 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-22 19:54:23] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13879050056609428671.kers
Total runtime 2 ms.
[2026-05-22 19:54:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 19:54:23] [INFO ] Invariant cache hit.
[2026-05-22 19:54:24] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2026-05-22 19:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/268 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/268 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 127 constraints, problems are : Problem set: 0 solved, 152 unsolved in 11303 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/268 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 152/279 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 286 constraints, problems are : Problem set: 0 solved, 152 unsolved in 21373 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32693ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 32694ms
Starting structural reductions in LTL mode, iteration 1 : 115/186 places, 153/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32985 ms. Remains : 115/186 places, 153/241 transitions.
[2026-05-22 19:54:56] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:54:56] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:54:56] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-22 19:54:56] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:54:56] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:54:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8071276668031820005.gal : 3 ms
[2026-05-22 19:54:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8409034930108031297.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/CTLFireability8071276668031820005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8409034930108031297.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((((EF((p98==0)) + AX((p49==1))) + ((p132==1)||(p118==0))) + (((p150==0)||(p114==1))||(((p62==1)&&(p125==1))||((p69==1)&&(p195==1))))))
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((((p150==0)||(p114==1))||(((p62==1)&&(p125==1))||((p69==1)&&(p195==1)))))) * !(((p13...224
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t32, t36, t43, t47, t53, t56, t57, t60, t67, t71, t76, t81, t87, t93, t100...269
(forward)formula 0,1,0.741161,17056,1,0,237,64505,329,129,3563,58368,317
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Graph (trivial) has 156 edges and 186 vertex of which 32 / 186 are part of one of the 5 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 162
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 59 rules applied. Total rules applied 107 place count 111 transition count 150
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 119 place count 105 transition count 144
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 129 place count 99 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 97 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 97 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 96 transition count 139
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 152 place count 77 transition count 120
Iterating global reduction 5 with 19 rules applied. Total rules applied 171 place count 77 transition count 120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 171 place count 77 transition count 117
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 177 place count 74 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 73 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 73 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 180 place count 73 transition count 114
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 216 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 219 place count 52 transition count 87
Iterating global reduction 6 with 3 rules applied. Total rules applied 222 place count 52 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 225 place count 52 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 50 transition count 82
Applied a total of 227 rules in 48 ms. Remains 50 /186 variables (removed 136) and now considering 82/241 (removed 159) transitions.
[2026-05-22 19:54:57] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8834611652908420105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9247684401580489962.kers'
[2026-05-22 19:54:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8834611652908420105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9247684401580489962.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 49 cols 211 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:54:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9247684401580489962.kers
Total runtime 2 ms.
[2026-05-22 19:54:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-22 19:54:57] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2026-05-22 19:54:57] [INFO ] Invariant cache hit.
[2026-05-22 19:54:57] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-22 19:54:57] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-22 19:54:57] [INFO ] Flow matrix only has 76 transitions (discarded 6 similar events)
[2026-05-22 19:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 75/125 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 61 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 75/125 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 120 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2311 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4545ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4545ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/186 places, 82/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4759 ms. Remains : 50/186 places, 82/241 transitions.
[2026-05-22 19:55:02] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:55:02] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:55:02] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-22 19:55:02] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:55:02] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11201680639925434954.gal : 2 ms
[2026-05-22 19:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4275941623600985671.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/CTLFireability11201680639925434954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4275941623600985671.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.11245e+06,0.039426,4508,2,259,5,2733,6,0,279,2006,0


Converting to forward existential form...Done !
original formula: (EF(((p4==0)&&(((p37==1)||(p136==1))||((p68==0)&&(p38==1))))) + !(A(A(EG(A(((p77==1)&&(p110==1)) U (p19==1))) U (EF((p164==1)) + !(((p99=...236
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p4==0)&&(((p37==1)||(p136==1))||((p68==0)&&(p38==1)))))] != FALSE + ([((((FwdU((FwdU(Init...809
(forward)formula 0,1,0.043171,4772,1,0,7,2733,8,1,294,2006,1
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Graph (trivial) has 178 edges and 186 vertex of which 40 / 186 are part of one of the 6 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 151 transition count 148
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 70 rules applied. Total rules applied 123 place count 99 transition count 130
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 90 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 132 place count 90 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 86 transition count 126
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 164 place count 62 transition count 102
Iterating global reduction 3 with 24 rules applied. Total rules applied 188 place count 62 transition count 102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 188 place count 62 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 196 place count 58 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 198 place count 56 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 200 place count 56 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 56 transition count 91
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 236 place count 39 transition count 74
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 241 place count 34 transition count 57
Iterating global reduction 4 with 5 rules applied. Total rules applied 246 place count 34 transition count 57
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 251 place count 34 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 32 transition count 50
Applied a total of 253 rules in 31 ms. Remains 32 /186 variables (removed 154) and now considering 50/241 (removed 191) transitions.
[2026-05-22 19:55:02] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15322366827743301725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9585177059213490302.kers'
[2026-05-22 19:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15322366827743301725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9585177059213490302.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 31 rows 29 cols 80 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 19:55:02] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9585177059213490302.kers
Total runtime 1 ms.
[2026-05-22 19:55:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 19:55:02] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2026-05-22 19:55:02] [INFO ] Invariant cache hit.
[2026-05-22 19:55:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-22 19:55:02] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-22 19:55:02] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2026-05-22 19:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 4/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/63 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 43 constraints, problems are : Problem set: 0 solved, 28 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 4/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 31/63 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 71 constraints, problems are : Problem set: 0 solved, 28 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1815ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1815ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/186 places, 50/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2005 ms. Remains : 32/186 places, 50/241 transitions.
[2026-05-22 19:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:55:04] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:55:04] [INFO ] Input system was already deterministic with 50 transitions.
[2026-05-22 19:55:04] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:55:04] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9632051625462634056.gal : 1 ms
[2026-05-22 19:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability18310890784203455990.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/CTLFireability9632051625462634056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18310890784203455990.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,93312,0.014887,4116,2,54,5,464,6,0,174,278,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(A((p21==1) U (p118==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!((E(!((p118==1)) U (!((p21==1)) * !((p118==1)))) + EG(!((p118==1)))...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 45/0/5
Hit Full ! (commute/partial/dont) 45/0/5
(forward)formula 0,0,0.047892,4604,1,0,12,3552,28,5,875,2899,13
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 148 transition count 203
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 148 transition count 203
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 100 place count 124 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 124 place count 124 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 128 place count 124 transition count 174
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 140 place count 112 transition count 154
Iterating global reduction 1 with 12 rules applied. Total rules applied 152 place count 112 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 157 place count 112 transition count 149
Applied a total of 157 rules in 16 ms. Remains 112 /186 variables (removed 74) and now considering 149/241 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8241135222431035679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10920069200831514835.kers'
[2026-05-22 19:55:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8241135222431035679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10920069200831514835.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 112 cols 388 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-22 19:55:04] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10920069200831514835.kers
Total runtime 1 ms.
[2026-05-22 19:55:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 19:55:04] [INFO ] Invariant cache hit.
[2026-05-22 19:55:04] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-22 19:55:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/261 variables, 112/123 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 0/261 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 123 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9102 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/261 variables, 112/123 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 148/271 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/261 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 276 constraints, problems are : Problem set: 0 solved, 148 unsolved in 14536 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23659ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 23660ms
Starting structural reductions in LTL mode, iteration 1 : 112/186 places, 149/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23953 ms. Remains : 112/186 places, 149/241 transitions.
[2026-05-22 19:55:28] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:55:28] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:55:28] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-22 19:55:28] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:55:28] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:55:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10802732185924208108.gal : 2 ms
[2026-05-22 19:55:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3570172516540379565.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/CTLFireability10802732185924208108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3570172516540379565.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,4.08204e+10,0.104863,5704,2,667,5,7696,6,0,599,7346,0


Converting to forward existential form...Done !
original formula: AF(!(E((EF((p170!=1)) + (EX((p86==1)) * !(A((p142==1) U (p128==1))))) U (EX(((p137==1)&&(p216==1))) + (p215==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((E(TRUE U (p170!=1)) + (EX((p86==1)) * !(!((E(!((p128==1)) U (!((p142==1)) * !((p128==1)))) + E...231
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t26, t28, t33, t36, t43, t44, t48, t50, t56, t60, t65, t69, t74, t77, t82, t92,...268
(forward)formula 0,0,5.9947,170420,1,0,1079,829522,338,598,3654,1.2793e+06,1158
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 146 transition count 201
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 146 transition count 201
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 121 transition count 175
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 121 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 133 place count 121 transition count 172
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 146 place count 108 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 159 place count 108 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 166 place count 108 transition count 138
Applied a total of 166 rules in 8 ms. Remains 108 /186 variables (removed 78) and now considering 138/241 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12698087937828044455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16470515935129895225.kers'
[2026-05-22 19:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12698087937828044455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16470515935129895225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 108 cols 350 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-22 19:55:34] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16470515935129895225.kers
Total runtime 1 ms.
[2026-05-22 19:55:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-22 19:55:34] [INFO ] Invariant cache hit.
[2026-05-22 19:55:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-22 19:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/246 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 119 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7826 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/246 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 137/256 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 260 constraints, problems are : Problem set: 0 solved, 137 unsolved in 15838 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23683ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 23683ms
Starting structural reductions in LTL mode, iteration 1 : 108/186 places, 138/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23928 ms. Remains : 108/186 places, 138/241 transitions.
[2026-05-22 19:55:58] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:55:58] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:55:58] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-22 19:55:58] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:55:58] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:55:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9352631072359374874.gal : 2 ms
[2026-05-22 19:55:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9604543450799149612.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/CTLFireability9352631072359374874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9604543450799149612.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.85503e+10,0.048546,5264,2,549,5,5810,6,0,572,4707,0


Converting to forward existential form...Done !
original formula: A(((AG(!(EG((p13==1)))) * AX(FALSE)) * !(AX((p69!=1)))) U EF((AG((p102==1)) * (p216==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(E(TRUE U !((p102==1)))) * (p216==1))))))) * !(E(!(E(TRUE U (!(E(TRUE U !((p102==1))...325
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t32, t36, t41, t42, t46, t52, t55, t62, t66, t76, t87, t97, t105, t107, I...253
(forward)formula 0,0,1.8958,58064,1,0,409,306434,308,200,3409,315834,544
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 148 transition count 203
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 148 transition count 203
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 99 place count 125 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 122 place count 125 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 126 place count 125 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 136 place count 115 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 146 place count 115 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 150 place count 115 transition count 154
Applied a total of 150 rules in 7 ms. Remains 115 /186 variables (removed 71) and now considering 154/241 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17071452683263197017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8286231313632280892.kers'
[2026-05-22 19:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17071452683263197017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8286231313632280892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 115 cols 402 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-22 19:56:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8286231313632280892.kers
Total runtime 3 ms.
[2026-05-22 19:56:00] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 19:56:00] [INFO ] Invariant cache hit.
[2026-05-22 19:56:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-22 19:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/269 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 0/269 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 126 constraints, problems are : Problem set: 0 solved, 153 unsolved in 9192 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/269 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 153/279 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 284 constraints, problems are : Problem set: 0 solved, 153 unsolved in 19717 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 28923ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 28924ms
Starting structural reductions in LTL mode, iteration 1 : 115/186 places, 154/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29185 ms. Remains : 115/186 places, 154/241 transitions.
[2026-05-22 19:56:29] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:56:29] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:56:29] [INFO ] Input system was already deterministic with 154 transitions.
[2026-05-22 19:56:29] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:56:29] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9462051108585821919.gal : 2 ms
[2026-05-22 19:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15987769604179956835.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/CTLFireability9462051108585821919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15987769604179956835.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,5.4795e+10,0.065317,5772,2,647,5,8010,6,0,616,7585,0


Converting to forward existential form...Done !
original formula: (AX(A((E(E((p106==1) U (p20==1)) U AF((p148==1))) + AX(((p94==1)||(p19==1)))) U E(EF((p197==1)) U A((p192==1) U ((p20==1)&&(p107==1))))))...247
=> equivalent forward existential formula: (([((FwdU(EY(Init),!(E(E(TRUE U (p197==1)) U !((E(!(((p20==1)&&(p107==1))) U (!((p192==1)) * !(((p20==1)&&(p107=...726
Reverse transition relation is NOT exact ! Due to transitions t3, t24, t25, t29, t35, t39, t42, t47, t48, t52, t58, t62, t66, t69, t73, t80, t85, t95, t105...263
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.8918,407168,1,0,2645,2.33665e+06,381,1533,3905,3.11131e+06,2761
FORMULA Champagne-PT-H04T0R-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 : 186/186 places, 241/241 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 146 transition count 201
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 146 transition count 201
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 106 place count 120 transition count 174
Iterating global reduction 0 with 26 rules applied. Total rules applied 132 place count 120 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 136 place count 120 transition count 170
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 149 place count 107 transition count 143
Iterating global reduction 1 with 13 rules applied. Total rules applied 162 place count 107 transition count 143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 169 place count 107 transition count 136
Applied a total of 169 rules in 5 ms. Remains 107 /186 variables (removed 79) and now considering 136/241 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-738485537041147934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12800682192510826937.kers'
[2026-05-22 19:56:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-738485537041147934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12800682192510826937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 107 cols 346 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-22 19:56:47] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12800682192510826937.kers
Total runtime 1 ms.
[2026-05-22 19:56:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 19:56:47] [INFO ] Invariant cache hit.
[2026-05-22 19:56:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-22 19:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/243 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 0/243 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 118 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7891 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/243 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 135/253 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 257 constraints, problems are : Problem set: 0 solved, 135 unsolved in 24758 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32657ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 32657ms
Starting structural reductions in LTL mode, iteration 1 : 107/186 places, 136/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32862 ms. Remains : 107/186 places, 136/241 transitions.
[2026-05-22 19:57:20] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:57:20] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:57:20] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-22 19:57:20] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:57:20] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:57:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3245372124385970383.gal : 2 ms
[2026-05-22 19:57:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13486945854390890124.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/CTLFireability3245372124385970383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13486945854390890124.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.4879e+10,0.087162,5276,2,536,5,5928,6,0,566,4978,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((p192==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((p192==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t63, t67, t77, t87, t97, t106, Interse...247
(forward)formula 0,0,0.453807,12124,1,0,211,43835,294,115,3246,33403,282
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 146 transition count 201
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 146 transition count 201
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 121 transition count 175
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 121 transition count 175
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 134 place count 121 transition count 171
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 147 place count 108 transition count 145
Iterating global reduction 1 with 13 rules applied. Total rules applied 160 place count 108 transition count 145
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 166 place count 108 transition count 139
Applied a total of 166 rules in 6 ms. Remains 108 /186 variables (removed 78) and now considering 139/241 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6769211807631684852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-322978758707321469.kers'
[2026-05-22 19:57:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6769211807631684852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-322978758707321469.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 108 cols 356 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-22 19:57:21] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-322978758707321469.kers
Total runtime 2 ms.
[2026-05-22 19:57:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-22 19:57:21] [INFO ] Invariant cache hit.
[2026-05-22 19:57:21] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-22 19:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/247 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 120 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9085 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/247 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 138/258 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 262 constraints, problems are : Problem set: 0 solved, 138 unsolved in 20129 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29239ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 29240ms
Starting structural reductions in LTL mode, iteration 1 : 108/186 places, 139/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29527 ms. Remains : 108/186 places, 139/241 transitions.
[2026-05-22 19:57:50] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:57:50] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:57:50] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-22 19:57:50] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:57:50] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7490392312367912270.gal : 1 ms
[2026-05-22 19:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13460257709012038282.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/CTLFireability7490392312367912270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13460257709012038282.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.71141e+10,0.083582,5268,2,555,5,5840,6,0,573,4869,0


Converting to forward existential form...Done !
original formula: EF(EX((p187==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p187==1))] != FALSE
(forward)formula 0,1,0.100101,5532,1,0,8,5840,8,1,928,4869,2
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 241/241 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 153 transition count 208
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 153 transition count 208
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 86 place count 133 transition count 187
Iterating global reduction 0 with 20 rules applied. Total rules applied 106 place count 133 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 133 transition count 183
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 118 place count 125 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 125 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 125 transition count 168
Applied a total of 129 rules in 13 ms. Remains 125 /186 variables (removed 61) and now considering 168/241 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12069497794289813834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6753433297228516033.kers'
[2026-05-22 19:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12069497794289813834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6753433297228516033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 125 cols 438 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-22 19:57:50] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6753433297228516033.kers
Total runtime 1 ms.
[2026-05-22 19:57:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-22 19:57:50] [INFO ] Invariant cache hit.
[2026-05-22 19:57:51] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-22 19:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/293 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 139 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13778 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/293 variables, 125/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 167/306 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 7/315 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 319 constraints, problems are : Problem set: 0 solved, 167 unsolved in 19239 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33033ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 33037ms
Starting structural reductions in LTL mode, iteration 1 : 125/186 places, 168/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33319 ms. Remains : 125/186 places, 168/241 transitions.
[2026-05-22 19:58:24] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:58:24] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-22 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:58:24] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability55439519072172933.gal : 2 ms
[2026-05-22 19:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18259254796482231512.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/CTLFireability55439519072172933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18259254796482231512.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40743e+11,0.10912,6796,2,979,5,12913,6,0,670,12793,0


Converting to forward existential form...Done !
original formula: A(A(AX(!(AG((p53==1)))) U ((p74==1) + ((EG(((p58==1)&&(p91==1))) * !((((p118==1)&&(p166==1))||(p198==1)))) * !(EG((p218==1)))))) U !(((((...460
=> equivalent forward existential formula: [((Init * !(EG(!(!((((((EX((p200==1)) * !(E(TRUE U !((p18==1))))) + !((E(!((p1==1)) U (!((p162==1)) * !((p1==1))...1643
Reverse transition relation is NOT exact ! Due to transitions t5, t17, t27, t28, t32, t38, t39, t43, t47, t52, t55, t60, t63, t65, t68, t72, t75, t79, t87,...295
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,29.6972,718928,1,0,2288,4.16836e+06,412,1329,4220,5.65704e+06,2418
FORMULA Champagne-PT-H04T0R-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 19:58:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:58:54] [INFO ] Flatten gal took : 5 ms
Total runtime 472414 ms.

BK_STOP 1779479934143

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H04T0R"
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 Champagne-PT-H04T0R, 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 r050-smll-177946901000002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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