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.r130-smll-177955809100474.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 FMS-PT-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.1K Mar 7 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 10:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 17K 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 FMS-PT-00005-CTLFireability-2024-00
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-01
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-02
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-03
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-04
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-05
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-06
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-07
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-08
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-09
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-10
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-11
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-12
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-13
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-14
FORMULA_NAME FMS-PT-00005-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779940851037

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-28 04:00:53] [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-28 04:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:00:53] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-28 04:00:53] [INFO ] Transformed 22 places.
[2026-05-28 04:00:53] [INFO ] Transformed 20 transitions.
[2026-05-28 04:00:53] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 16 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6392714910828856552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15705656505176730639.kers'
[2026-05-28 04:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6392714910828856552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15705656505176730639.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:00:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15705656505176730639.kers
Total runtime 2 ms.
[2026-05-28 04:00:54] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-28 04:00:54] [INFO ] Invariant cache hit.
[2026-05-28 04:00:54] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1454ms
Finished structural reductions in LTL mode , in 1 iterations and 1950 ms. Remains : 22/22 places, 20/20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:00:55] [INFO ] Invariant cache hit.
[2026-05-28 04:00:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-28 04:00:56] [INFO ] Invariant cache hit.
[2026-05-28 04:00:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2026-05-28 04:00:56] [INFO ] Flatten gal took : 33 ms
[2026-05-28 04:00:56] [INFO ] Flatten gal took : 11 ms
[2026-05-28 04:00:56] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40008 steps (8 resets) in 858 ms. (46 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
[2026-05-28 04:00:56] [INFO ] Invariant cache hit.
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 3/42 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/5 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26ms 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-28 04:00:56] [INFO ] Flatten gal took : 5 ms
[2026-05-28 04:00:56] [INFO ] Flatten gal took : 5 ms
[2026-05-28 04:00:56] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19 transition count 17
Applied a total of 6 rules in 21 ms. Remains 19 /22 variables (removed 3) and now considering 17/20 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16512256064687472570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7289463593080160001.kers'
[2026-05-28 04:00:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16512256064687472570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7289463593080160001.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 17 rows 16 cols 36 entries
Finished phase 1 with 12 SingleSign rule and 1 generalized
[2026-05-28 04:00:56] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7289463593080160001.kers
Total runtime 0 ms.
[2026-05-28 04:00:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-28 04:00:57] [INFO ] Invariant cache hit.
[2026-05-28 04:00:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2026-05-28 04:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-28 04:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 17/36 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 25 constraints, problems are : Problem set: 0 solved, 14 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 17/36 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 14 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 802ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/22 places, 17/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 944 ms. Remains : 19/22 places, 17/20 transitions.
[2026-05-28 04:00:57] [INFO ] Flatten gal took : 8 ms
[2026-05-28 04:00:57] [INFO ] Flatten gal took : 9 ms
[2026-05-28 04:00:57] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-28 04:00:57] [INFO ] Flatten gal took : 4 ms
[2026-05-28 04:00:57] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:00:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14710111335678824047.gal : 2 ms
[2026-05-28 04:00:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13915601136456559667.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/CTLFireability14710111335678824047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13915601136456559667.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,537831,0.034884,4004,2,179,5,1548,6,0,96,1269,0


Converting to forward existential form...Done !
original formula: A(A((P12s<1) U A(E(A(((P1wM1>=1)&&(M1>=1)) U (P1>=1)) U (((P12M3>=1)&&(P1wP2>=1))&&(P2wP1>=1))) U AG(EF((P1s>=1))))) U AG((!(AG((P1>=1)))...211
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(!(E(TRUE U !((P1>=1))))) + ((!(E(TRUE U !((P2d>=1)))) * (P3>=1)) * ((P1wM1>=1)&...1245
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.068843,4740,1,0,9,4254,27,1,494,2433,12
FORMULA FMS-PT-00005-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 17 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 10 place count 17 transition count 16
Applied a total of 10 rules in 14 ms. Remains 17 /22 variables (removed 5) and now considering 16/20 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8168924016748924975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9928290632770798666.kers'
[2026-05-28 04:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8168924016748924975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9928290632770798666.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 34 entries
Finished phase 1 with 11 SingleSign rule and 1 generalized
[2026-05-28 04:00:58] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9928290632770798666.kers
Total runtime 1 ms.
[2026-05-28 04:00:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-28 04:00:58] [INFO ] Invariant cache hit.
[2026-05-28 04:00:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-28 04:00:58] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-28 04:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 22 constraints, problems are : Problem set: 0 solved, 13 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 16/33 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 577ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/22 places, 16/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 688 ms. Remains : 17/22 places, 16/20 transitions.
[2026-05-28 04:00:58] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:00:58] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:00:58] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-28 04:00:58] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:00:58] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:00:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6093730055353948411.gal : 1 ms
[2026-05-28 04:00:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17210766455410610345.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/CTLFireability6093730055353948411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17210766455410610345.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,656586,0.007117,4008,2,90,5,932,6,0,87,783,0


Converting to forward existential form...Done !
original formula: AG((A(!(A((P12<1) U EG(((P2wM2>=1)&&(M2>=1))))) U ((E(((P1d>=1)||((P1wP2>=1)&&(P2wP1>=1))) U (((P2wM2>=1)&&(M2>=1))&&(P12>=1))) + ((P1s>=...297
=> equivalent forward existential formula: (([((((FwdU(FwdU(Init,TRUE),!(((E(((P1d>=1)||((P1wP2>=1)&&(P2wP1>=1))) U (((P2wM2>=1)&&(M2>=1))&&(P12>=1))) + ((...839
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/0/2
Hit Full ! (commute/partial/dont) 11/0/5
Using saturation style SCC detection
(forward)formula 0,1,0.061962,5992,1,0,55,10338,65,33,538,11341,44
FORMULA FMS-PT-00005-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12451611571539768877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7055637671660270629.kers'
[2026-05-28 04:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12451611571539768877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7055637671660270629.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:00:58] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7055637671660270629.kers
Total runtime 1 ms.
[2026-05-28 04:00:58] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-28 04:00:58] [INFO ] Invariant cache hit.
[2026-05-28 04:00:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 818ms
Finished structural reductions in LTL mode , in 1 iterations and 909 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:00:59] [INFO ] Flatten gal took : 5 ms
[2026-05-28 04:00:59] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:00:59] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:00:59] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:00:59] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9371663469197901924.gal : 1 ms
[2026-05-28 04:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17253289326409849597.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/CTLFireability9371663469197901924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17253289326409849597.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.89502e+06,0.016584,4296,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: AF(((P2d<1) * ((AG((P12<1)) + ((P1wM1>=1)&&(M1>=1))) + ((AX((P1d>=1)) * (P12wM3>=1)) * (M3>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((P2d<1) * ((!(E(TRUE U !((P12<1)))) + ((P1wM1>=1)&&(M1>=1))) + ((!(EX(!((P1d>=1)))) * (P12wM3>=1))...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.544707,20868,1,0,159,101571,27,147,575,134099,157
FORMULA FMS-PT-00005-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 15 transition count 16
Reduce places removed 2 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 2 with 6 rules applied. Total rules applied 16 place count 13 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 11 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 18 place count 11 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 25 place count 7 transition count 9
Applied a total of 25 rules in 22 ms. Remains 7 /22 variables (removed 15) and now considering 9/20 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14634081784245499545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9967876920031817435.kers'
[2026-05-28 04:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14634081784245499545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9967876920031817435.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 18 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-28 04:01:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9967876920031817435.kers
Total runtime 1 ms.
[2026-05-28 04:01:00] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-28 04:01:00] [INFO ] Invariant cache hit.
[2026-05-28 04:01:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-28 04:01:00] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-28 04:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 248ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/22 places, 9/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 361 ms. Remains : 7/22 places, 9/20 transitions.
[2026-05-28 04:01:00] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:00] [INFO ] Flatten gal took : 18 ms
[2026-05-28 04:01:00] [INFO ] Input system was already deterministic with 9 transitions.
[2026-05-28 04:01:00] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:00] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11634408261416928452.gal : 1 ms
[2026-05-28 04:01:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4696139041322876356.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/CTLFireability11634408261416928452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4696139041322876356.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,1176,0.005377,3860,2,33,5,377,5,0,38,329,0


Converting to forward existential form...Done !
original formula: EF((AG(AF((P2>=1))) * (P1d<1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (P1d<1)) * !(E(TRUE U !(!(EG(!((P2>=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.009605,4132,1,0,6,666,21,0,191,597,8
FORMULA FMS-PT-00005-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10885925087061024520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-627982655494340417.kers'
[2026-05-28 04:01:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10885925087061024520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-627982655494340417.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:01:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-627982655494340417.kers
Total runtime 1 ms.
[2026-05-28 04:01:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-28 04:01:00] [INFO ] Invariant cache hit.
[2026-05-28 04:01:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 987ms
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:01] [INFO ] Flatten gal took : 5 ms
[2026-05-28 04:01:01] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:01] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:01] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:01] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9349571389217313198.gal : 2 ms
[2026-05-28 04:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3791091682678764599.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/CTLFireability9349571389217313198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3791091682678764599.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.89502e+06,0.015607,4288,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: EF(((AX((((P12s>=1)&&((P12wM3<1)||(M3<1)))&&(P1d<1))) * !(A((P2d<1) U ((P1wM1>=1)&&(M1>=1))))) * AG((P2M2<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EX(!((((P12s>=1)&&((P12wM3<1)||(M3<1)))&&(P1d<1))))) * !(!((E(!(((P1wM1>=1)&&(M1>=1))) U...270
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.046229,5092,1,0,6,7538,15,0,547,4165,5
FORMULA FMS-PT-00005-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 16 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 11 place count 16 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 5 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2847986713699424802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12145970270861309171.kers'
[2026-05-28 04:01:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2847986713699424802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12145970270861309171.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 26 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-28 04:01:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12145970270861309171.kers
Total runtime 1 ms.
[2026-05-28 04:01:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-28 04:01:01] [INFO ] Invariant cache hit.
[2026-05-28 04:01:02] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-28 04:01:02] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-28 04:01:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 9 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 402ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/22 places, 12/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 475 ms. Remains : 12/22 places, 12/20 transitions.
[2026-05-28 04:01:02] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:02] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:02] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-28 04:01:02] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:02] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5491097961211575823.gal : 1 ms
[2026-05-28 04:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1199376003801705045.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/CTLFireability5491097961211575823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1199376003801705045.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,40131,0.009766,3972,2,64,5,780,6,0,63,799,0


Converting to forward existential form...Done !
original formula: (!(E((P2s>=1) U !(AF((P2M2>=1))))) + !(E(((!(AF((P1d>=1))) + EG((P2d>=1))) + EG((P2s>=1))) U AG((((M2>=1)&&(P3M2>=1))||(P3s>=1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E((P2s>=1) U !(!(EG(!((P2M2>=1))))))))),((!(!(EG(!((P1d>=1))))) + EG((P2d>=1))) + EG((P2s>=1)...219
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.017641,4236,1,0,6,1086,15,0,311,799,5
FORMULA FMS-PT-00005-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5007188592424285043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4332860502694531205.kers'
[2026-05-28 04:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5007188592424285043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4332860502694531205.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:01:02] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4332860502694531205.kers
Total runtime 0 ms.
[2026-05-28 04:01:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-28 04:01:02] [INFO ] Invariant cache hit.
[2026-05-28 04:01:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:01:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 959ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 960ms
Finished structural reductions in LTL mode , in 1 iterations and 1047 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:03] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13630058571950331887.gal : 0 ms
[2026-05-28 04:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13827885302278758387.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/CTLFireability13630058571950331887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13827885302278758387.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,2.89502e+06,0.014902,4300,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: !(E((A((EX(((P2wM2>=1)&&(M2>=1))) * (P1d<1)) U A(EF((P2s>=1)) U E(((P1wP2>=1)&&(P2wP1>=1)) U (P3s>=1)))) + ((((P12>=1)||(P3>=1)) * E((P1M...226
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!(!((E(!(E(((P1wP2>=1)&&(P2wP1>=1)) U (P3s>=1))) U (!(E(TRUE U (P2s>=1))) * !(E(((P1wP2>=1)&&(...754
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.06106,5832,1,0,6,11782,22,0,573,8326,8
FORMULA FMS-PT-00005-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 15 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 13 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 9 transition count 10
Applied a total of 23 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12454407701570850167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5685567792521629487.kers'
[2026-05-28 04:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12454407701570850167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5685567792521629487.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-28 04:01:03] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5685567792521629487.kers
Total runtime 0 ms.
[2026-05-28 04:01:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-28 04:01:03] [INFO ] Invariant cache hit.
[2026-05-28 04:01:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-28 04:01:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-28 04:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 224 ms. Remains : 9/22 places, 10/20 transitions.
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:03] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:03] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4122472506050537196.gal : 0 ms
[2026-05-28 04:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3218787357260623979.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/CTLFireability4122472506050537196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3218787357260623979.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,7056,0.005921,3860,2,40,5,413,6,0,49,353,0


Converting to forward existential form...Done !
original formula: EF((AG((P3>=1)) * (AF((P1<1)) + AF((P2s<1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((P3>=1))))) * !(EG(!((P1<1)))))] != FALSE + [((FwdU(Init,TRUE) * !(E(TRUE U !...199
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.01489,4512,1,0,10,841,33,2,249,775,11
FORMULA FMS-PT-00005-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4222321134054732906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15634460048731471782.kers'
[2026-05-28 04:01:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4222321134054732906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15634460048731471782.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:01:03] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15634460048731471782.kers
Total runtime 0 ms.
[2026-05-28 04:01:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-28 04:01:03] [INFO ] Invariant cache hit.
[2026-05-28 04:01:03] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 793ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 794ms
Finished structural reductions in LTL mode , in 1 iterations and 892 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:04] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:04] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:04] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:04] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:04] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14512268269781615021.gal : 1 ms
[2026-05-28 04:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8084578979774472450.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/CTLFireability14512268269781615021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8084578979774472450.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.89502e+06,0.014,4292,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: AF((EF(AG(AF((P1d>=1)))) * (!(A(AX((P2>=1)) U EX((P2d>=1)))) + !(A(((P2M2>=1)||((P1wP2>=1)&&(P2wP1>=1))) U AX((P2M2>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(E(TRUE U !(!(EG(!((P1d>=1)))))))) * (!(!((E(!(EX((P2d>=1))) U (!(!(EX(!((P2>=1))))) * !...344
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.110146,7756,1,0,22,23911,38,13,647,19717,33
FORMULA FMS-PT-00005-CTLFireability-2024-08 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 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:01:04] [INFO ] Invariant cache hit.
[2026-05-28 04:01:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-28 04:01:04] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14713302483373974418.gal : 1 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3432403930937416715.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/CTLFireability14713302483373974418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3432403930937416715.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.89502e+06,0.014379,4288,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: AG(((AX(EX((P12<1))) + (P2s>=1)) + EX(AG((P1d<1)))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !(EX(!(E(TRUE U !((P1d<1))))))) * !((P2s>=1)))) * !(EX((P12<1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.057025,5752,1,0,13,11606,18,4,572,8502,9
FORMULA FMS-PT-00005-CTLFireability-2024-09 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 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12593037316946401140.gal : 1 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10604766061605758655.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/CTLFireability12593037316946401140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10604766061605758655.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,2.89502e+06,0.023184,4300,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: (EF((P2d>=1)) * (AG(((EG((P12<1)) + (P2M2<1)) + ((P1M1<1)||((P1d<1)&&(P2d<1))))) + EX(((((AG((P12M3>=1)) + (((P3>=1)||(P1d>=1))&&((P12>=1...316
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (P2d>=1))))] = FALSE * [(((FwdU((Init * !(EX(((((!(E(TRUE U !((P12M3>=1)))) + (((P3>=1)||(P...558
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 13/5/7
(forward)formula 0,0,0.28983,9684,1,0,32,36133,47,15,658,35216,26
FORMULA FMS-PT-00005-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-28 04:01:05] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3344652923156675964.gal : 1 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3820930033051417364.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/CTLFireability3344652923156675964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3820930033051417364.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.89502e+06,0.013833,4288,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: EG((((EG(EX((P2>=1))) * AF((P1s<1))) * (EF((P2<1)) * EF(((P2<1)&&(P12M3<1))))) * (((P1M1<1)&&((P1wM1<1)||(M1<1)))&&((M2<1)||(P3M2<1)))))
=> equivalent forward existential formula: [FwdG(Init,(((EG(EX((P2>=1))) * !(EG(!((P1s<1))))) * (E(TRUE U (P2<1)) * E(TRUE U ((P2<1)&&(P12M3<1))))) * (((P1...215
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.08972,6972,1,0,66,19401,36,52,619,17445,66
FORMULA FMS-PT-00005-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:05] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:05] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability111368137448579888.gal : 1 ms
[2026-05-28 04:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5245510494514803932.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/CTLFireability111368137448579888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5245510494514803932.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,2.89502e+06,0.023467,4296,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: AX((((P1wM1<1)||(M1<1)) * ((P1d>=1) + A(A(((P1wM1>=1)&&(M1>=1)) U (P1>=1)) U ((P3>=1)&&(P1s>=1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(((P1wM1<1)||(M1<1))))] = FALSE * (([(FwdU((FwdU((EY(Init) * !((P1d>=1))),!(((P3>=1)&&(P1s>=1))))...424
Hit Full ! (commute/partial/dont) 16/0/4
(forward)formula 0,0,0.137121,6544,1,0,9,13817,22,3,585,14981,10
FORMULA FMS-PT-00005-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 8 transition count 9
Applied a total of 24 rules in 4 ms. Remains 8 /22 variables (removed 14) and now considering 9/20 (removed 11) transitions.
[2026-05-28 04:01:05] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12800227051017606207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18071681197365263376.kers'
[2026-05-28 04:01:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12800227051017606207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18071681197365263376.kers]
Normalized transition count is 7 out of 8 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 14 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-28 04:01:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18071681197365263376.kers
Total runtime 1 ms.
[2026-05-28 04:01:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-28 04:01:05] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-28 04:01:05] [INFO ] Invariant cache hit.
[2026-05-28 04:01:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-28 04:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-28 04:01:06] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-28 04:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/22 places, 9/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 284 ms. Remains : 8/22 places, 9/20 transitions.
[2026-05-28 04:01:06] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:06] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:06] [INFO ] Input system was already deterministic with 9 transitions.
[2026-05-28 04:01:06] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:06] [INFO ] Flatten gal took : 0 ms
[2026-05-28 04:01:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8742424783286713326.gal : 0 ms
[2026-05-28 04:01:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12100161762212843227.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/CTLFireability8742424783286713326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12100161762212843227.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,546,0.008455,3904,2,44,5,555,6,0,42,541,0


Converting to forward existential form...Done !
original formula: EG(((P2wM2<1)||(M2<1)))
=> equivalent forward existential formula: [FwdG(Init,((P2wM2<1)||(M2<1)))] != FALSE
Hit Full ! (commute/partial/dont) 5/0/4
(forward)formula 0,1,0.013082,4168,1,0,7,606,19,1,221,541,8
FORMULA FMS-PT-00005-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7232776805719172612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6809633817034174164.kers'
[2026-05-28 04:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7232776805719172612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6809633817034174164.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 04:01:06] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6809633817034174164.kers
Total runtime 0 ms.
[2026-05-28 04:01:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-28 04:01:06] [INFO ] Invariant cache hit.
[2026-05-28 04:01:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 04:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 756ms
Finished structural reductions in LTL mode , in 1 iterations and 825 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:07] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15125636923799282708.gal : 0 ms
[2026-05-28 04:01:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6441049413515508375.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/CTLFireability15125636923799282708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6441049413515508375.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.89502e+06,0.018423,4280,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: EX(EF((P3s>=1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (P3s>=1))] != FALSE
(forward)formula 0,1,0.02861,4552,1,0,8,2939,9,1,280,2624,4
FORMULA FMS-PT-00005-CTLFireability-2024-14 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 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 04:01:07] [INFO ] Invariant cache hit.
[2026-05-28 04:01:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-28 04:01:07] [INFO ] Invariant cache hit.
[2026-05-28 04:01:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 22/22 places, 20/20 transitions.
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 2 ms
[2026-05-28 04:01:07] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6100472058659385919.gal : 1 ms
[2026-05-28 04:01:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15894056794951392354.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/CTLFireability6100472058659385919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15894056794951392354.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.89502e+06,0.013913,4292,2,303,5,2591,6,0,111,2240,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(((P2M2>=1)||((P2wM2>=1)&&(M2>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(((P2M2>=1)||((P2wM2>=1)&&(M2>=1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.047286,5324,1,0,8,9161,15,1,553,5629,6
FORMULA FMS-PT-00005-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
[2026-05-28 04:01:07] [INFO ] Flatten gal took : 1 ms
Total runtime 13760 ms.

BK_STOP 1779940867339

--------------------
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="FMS-PT-00005"
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 FMS-PT-00005, 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 r130-smll-177955809100474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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