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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.1K Mar 7 06:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 06:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 06:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 06:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 7 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 06:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 06:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 214K 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 FlexibleBarrier-PT-16a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779906663084

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-27 18:31:05] [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-27 18:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 18:31:05] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2026-05-27 18:31:05] [INFO ] Transformed 195 places.
[2026-05-27 18:31:06] [INFO ] Transformed 724 transitions.
[2026-05-27 18:31:06] [INFO ] Found NUPN structural information;
[2026-05-27 18:31:06] [INFO ] Parsed PT model containing 195 places and 724 transitions and 3489 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Ensure Unique test removed 226 transitions
Reduce redundant transitions removed 226 transitions.
Support contains 62 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 498/498 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 195 transition count 482
Applied a total of 16 rules in 76 ms. Remains 195 /195 variables (removed 0) and now considering 482/498 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12348150683690906696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17811799684897196418.kers'
[2026-05-27 18:31:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12348150683690906696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17811799684897196418.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 482 rows 193 cols 1429 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-27 18:31:06] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17811799684897196418.kers
Total runtime 6 ms.
[2026-05-27 18:31:07] [INFO ] Implicit Places using invariants in 717 ms returned []
[2026-05-27 18:31:07] [INFO ] Invariant cache hit.
[2026-05-27 18:31:07] [INFO ] State equation strengthened by 321 read => feed constraints.
[2026-05-27 18:31:07] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2026-05-27 18:31:08] [INFO ] Invariant cache hit.
[2026-05-27 18:31:08] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30052 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30023 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60816ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60851ms
Starting structural reductions in LTL mode, iteration 1 : 195/195 places, 482/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62722 ms. Remains : 195/195 places, 482/498 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:32:08] [INFO ] Invariant cache hit.
[2026-05-27 18:32:09] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-27 18:32:09] [INFO ] Invariant cache hit.
[2026-05-27 18:32:09] [INFO ] State equation strengthened by 321 read => feed constraints.
[2026-05-27 18:32:09] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 195/195 places, 482/482 transitions.
Support contains 62 out of 195 places after structural reductions.
[2026-05-27 18:32:09] [INFO ] Flatten gal took : 85 ms
[2026-05-27 18:32:09] [INFO ] Flatten gal took : 48 ms
[2026-05-27 18:32:10] [INFO ] Input system was already deterministic with 482 transitions.
Support contains 61 out of 195 places (down from 62) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2280 ms. (17 steps per ms) remains 2/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2026-05-27 18:32:10] [INFO ] Invariant cache hit.
[2026-05-27 18:32:10] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp78 is UNSAT
After SMT solving in domain Real declared 86/677 variables, and 19 constraints, problems are : Problem set: 2 solved, 0 unsolved in 54 ms.
Refiners :[Domain max(s): 11/195 constraints, Positive P Invariants (semi-flows): 8/18 constraints, State Equation: 0/195 constraints, ReadFeed: 0/321 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-27 18:32:10] [INFO ] Flatten gal took : 27 ms
[2026-05-27 18:32:10] [INFO ] Flatten gal took : 31 ms
[2026-05-27 18:32:11] [INFO ] Input system was already deterministic with 482 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 12 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:32:11] [INFO ] Invariant cache hit.
[2026-05-27 18:32:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-27 18:32:11] [INFO ] Invariant cache hit.
[2026-05-27 18:32:11] [INFO ] State equation strengthened by 321 read => feed constraints.
[2026-05-27 18:32:11] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 667 ms. Remains : 195/195 places, 482/482 transitions.
[2026-05-27 18:32:11] [INFO ] Flatten gal took : 29 ms
[2026-05-27 18:32:11] [INFO ] Flatten gal took : 32 ms
[2026-05-27 18:32:11] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:32:11] [INFO ] Flatten gal took : 25 ms
[2026-05-27 18:32:11] [INFO ] Flatten gal took : 23 ms
[2026-05-27 18:32:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7163624129834080251.gal : 24 ms
[2026-05-27 18:32:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17760361546092036476.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7163624129834080251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17760361546092036476.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,13.8479,337556,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: (EG(!(A(EG(((((p11==1)&&(p108==1))&&((p193==1)&&(p93==1)))&&(p194==1))) U !(E((((p96==1)&&(p131==1))&&(p193==1)) U (p59==1)))))) + E(!((A...551
=> equivalent forward existential formula: ([FwdG(Init,!(!((E(!(!(E((((p96==1)&&(p131==1))&&(p193==1)) U (p59==1)))) U (!(EG(((((p11==1)&&(p108==1))&&((p19...789
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/435/247
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-27 18:32:42] [INFO ] Flatten gal took : 15 ms
[2026-05-27 18:32:42] [INFO ] Applying decomposition
[2026-05-27 18:32:42] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph994796334453383887.txt' '-o' '/tmp/graph994796334453383887.bin' '-w' '/tmp/graph994796334453383887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph994796334453383887.bin' '-l' '-1' '-v' '-w' '/tmp/graph994796334453383887.weights' '-q' '0' '-e' '0.001'
[2026-05-27 18:32:42] [INFO ] Decomposing Gal with order
[2026-05-27 18:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 18:32:42] [INFO ] Removed a total of 719 redundant transitions.
[2026-05-27 18:32:42] [INFO ] Flatten gal took : 120 ms
[2026-05-27 18:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 23 ms.
[2026-05-27 18:32:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10870881072852459454.gal : 11 ms
[2026-05-27 18:32:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16509546179798085705.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/CTLFireability10870881072852459454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16509546179798085705.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.146103,8072,129,23,8574,349,572,9698,57,593,0


Converting to forward existential form...Done !
original formula: (EG(!(A(EG(((((i3.u2.p11==1)&&(i8.u26.p108==1))&&((i3.u11.p193==1)&&(i7.u23.p93==1)))&&(i0.i0.u0.p194==1))) U !(E((((i7.u23.p96==1)&&(i9....832
=> equivalent forward existential formula: ([FwdG(Init,!(!((E(!(!(E((((i7.u23.p96==1)&&(i9.u32.p131==1))&&(i3.u11.p193==1)) U (i4.u14.p59==1)))) U (!(EG(((...1126
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,0.420512,14300,1,0,19982,397,2949,38411,257,855,30773
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 9 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:32:42] [INFO ] Invariant cache hit.
[2026-05-27 18:32:43] [INFO ] Implicit Places using invariants in 333 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 11 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 358 ms. Remains : 194/195 places, 482/482 transitions.
[2026-05-27 18:32:43] [INFO ] Flatten gal took : 24 ms
[2026-05-27 18:32:43] [INFO ] Flatten gal took : 27 ms
[2026-05-27 18:32:43] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:32:43] [INFO ] Flatten gal took : 33 ms
[2026-05-27 18:32:43] [INFO ] Flatten gal took : 20 ms
[2026-05-27 18:32:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4009600953686417962.gal : 8 ms
[2026-05-27 18:32:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5735856613423767081.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/CTLFireability4009600953686417962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5735856613423767081.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,8.0921,201252,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AG((EX((((EX((((p11==1)&&(p108==1))&&(p193==1))) * (((p12==0)||(p155==0))||(p193==0))) + (((p168==1)&&(p191==1))&&(p193==1))) + ((p18==1)...449
=> equivalent forward existential formula: (((([(FwdU((FwdU(Init,TRUE) * !(EX((((EX((((p11==1)&&(p108==1))&&(p193==1))) * (((p12==0)||(p155==0))||(p193==0)...1745
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-27 18:33:13] [INFO ] Flatten gal took : 21 ms
[2026-05-27 18:33:13] [INFO ] Applying decomposition
[2026-05-27 18:33:13] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18405312015834171870.txt' '-o' '/tmp/graph18405312015834171870.bin' '-w' '/tmp/graph18405312015834171870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18405312015834171870.bin' '-l' '-1' '-v' '-w' '/tmp/graph18405312015834171870.weights' '-q' '0' '-e' '0.001'
[2026-05-27 18:33:13] [INFO ] Decomposing Gal with order
[2026-05-27 18:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 18:33:13] [INFO ] Removed a total of 658 redundant transitions.
[2026-05-27 18:33:13] [INFO ] Flatten gal took : 62 ms
[2026-05-27 18:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 12 ms.
[2026-05-27 18:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10280557524691051177.gal : 7 ms
[2026-05-27 18:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12331263160326570341.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/CTLFireability10280557524691051177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12331263160326570341.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.135125,6232,160,19,2890,260,521,3345,44,420,0


Converting to forward existential form...Done !
original formula: AG((EX((((EX((((i0.u4.p11==1)&&(i8.u43.p108==1))&&(i10.u48.p193==1))) * (((i0.u4.p12==0)||(i10.u63.p155==0))||(i10.u48.p193==0))) + (((i1...675
=> equivalent forward existential formula: (((([(FwdU((FwdU(Init,TRUE) * !(EX((((EX((((i0.u4.p11==1)&&(i8.u43.p108==1))&&(i10.u48.p193==1))) * (((i0.u4.p12...2501
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,0.279086,9604,1,0,10752,260,2500,17819,171,462,18392
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 126 edges and 195 vertex of which 18 / 195 are part of one of the 6 SCC in 4 ms
Free SCC test removed 12 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 174 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 136 place count 174 transition count 329
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 143 place count 174 transition count 329
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 149 place count 168 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 155 place count 168 transition count 323
Applied a total of 155 rules in 119 ms. Remains 168 /195 variables (removed 27) and now considering 323/482 (removed 159) transitions.
[2026-05-27 18:33:14] [INFO ] Flow matrix only has 307 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12020070767900912400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7613555960712406346.kers'
[2026-05-27 18:33:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12020070767900912400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7613555960712406346.kers]
Normalized transition count is 306 out of 307 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 306 rows 166 cols 789 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-27 18:33:14] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7613555960712406346.kers
Total runtime 2 ms.
[2026-05-27 18:33:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-27 18:33:14] [INFO ] Flow matrix only has 307 transitions (discarded 16 similar events)
[2026-05-27 18:33:14] [INFO ] Invariant cache hit.
[2026-05-27 18:33:14] [INFO ] State equation strengthened by 180 read => feed constraints.
[2026-05-27 18:33:14] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2026-05-27 18:33:14] [INFO ] Redundant transitions in 34 ms returned []
Running 322 sub problems to find dead transitions.
[2026-05-27 18:33:14] [INFO ] Flow matrix only has 307 transitions (discarded 16 similar events)
[2026-05-27 18:33:14] [INFO ] Invariant cache hit.
[2026-05-27 18:33:14] [INFO ] State equation strengthened by 180 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 306/474 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/475 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 366 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 306/474 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 322/687 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/475 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 688 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/195 places, 323/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60827 ms. Remains : 168/195 places, 323/482 transitions.
[2026-05-27 18:34:15] [INFO ] Flatten gal took : 12 ms
[2026-05-27 18:34:15] [INFO ] Flatten gal took : 11 ms
[2026-05-27 18:34:15] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-27 18:34:15] [INFO ] Flatten gal took : 12 ms
[2026-05-27 18:34:15] [INFO ] Flatten gal took : 12 ms
[2026-05-27 18:34:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14355450143933979843.gal : 4 ms
[2026-05-27 18:34:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17517335985337506888.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/CTLFireability14355450143933979843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17517335985337506888.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50373e+16,10.9749,247548,2,13864,5,1.50746e+06,6,0,987,619636,0


Converting to forward existential form...Done !
original formula: E(!((EF(AG((((p156==1)&&(p191==1))&&((p193==1)&&(p59==1))))) + (A((((p48==1)&&(p83==1))&&(p193==1)) U AF((((p59==1)&&(p132==1))&&(p193==1...434
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!((E(TRUE U !(E(TRUE U !((((p156==1)&&(p191==1))&&((p193==1)&&(p59==1))))))) + (!((E(!(!(EG(!(...1201
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 320/0/3
Hit Full ! (commute/partial/dont) 239/0/84
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-27 18:34:45] [INFO ] Flatten gal took : 6 ms
[2026-05-27 18:34:45] [INFO ] Applying decomposition
[2026-05-27 18:34:45] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10023529287180268238.txt' '-o' '/tmp/graph10023529287180268238.bin' '-w' '/tmp/graph10023529287180268238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10023529287180268238.bin' '-l' '-1' '-v' '-w' '/tmp/graph10023529287180268238.weights' '-q' '0' '-e' '0.001'
[2026-05-27 18:34:45] [INFO ] Decomposing Gal with order
[2026-05-27 18:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 18:34:45] [INFO ] Removed a total of 341 redundant transitions.
[2026-05-27 18:34:45] [INFO ] Flatten gal took : 19 ms
[2026-05-27 18:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 8 ms.
[2026-05-27 18:34:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8451414458379744948.gal : 4 ms
[2026-05-27 18:34:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17304425402364780131.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/CTLFireability8451414458379744948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17304425402364780131.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50373e+16,0.082468,6176,102,22,4081,272,471,5168,51,562,0


Converting to forward existential form...Done !
original formula: E(!((EF(AG((((i13.u39.p156==1)&&(i15.u48.p191==1))&&((i6.u17.p193==1)&&(i4.u14.p59==1))))) + (A((((i3.u11.p48==1)&&(i6.u21.p83==1))&&(i6....652
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!((E(TRUE U !(E(TRUE U !((((i13.u39.p156==1)&&(i15.u48.p191==1))&&((i6.u17.p193==1)&&(i4.u14.p...1701
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,2.57953,59268,1,0,111739,410,2657,152340,252,967,83454
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 150 edges and 195 vertex of which 36 / 195 are part of one of the 12 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 157 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 0 with 158 rules applied. Total rules applied 187 place count 157 transition count 231
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 189 place count 157 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 191 place count 155 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 193 place count 155 transition count 229
Applied a total of 193 rules in 50 ms. Remains 155 /195 variables (removed 40) and now considering 229/482 (removed 253) transitions.
[2026-05-27 18:34:47] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12744195903341677717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8405444761427772993.kers'
[2026-05-27 18:34:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12744195903341677717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8405444761427772993.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 153 cols 473 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-27 18:34:47] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8405444761427772993.kers
Total runtime 3 ms.
[2026-05-27 18:34:48] [INFO ] Implicit Places using invariants in 140 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/195 places, 229/482 transitions.
Graph (trivial) has 192 edges and 154 vertex of which 68 / 154 are part of one of the 16 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 102 transition count 133
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 82 transition count 133
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 41 place count 82 transition count 117
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 73 place count 66 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 105
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 109 place count 54 transition count 93
Applied a total of 109 rules in 45 ms. Remains 54 /154 variables (removed 100) and now considering 93/229 (removed 136) transitions.
[2026-05-27 18:34:48] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13698462860402828993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7916978873406106167.kers'
[2026-05-27 18:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13698462860402828993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7916978873406106167.kers]
Normalized transition count is 77 out of 78 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 53 cols 193 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-27 18:34:48] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7916978873406106167.kers
Total runtime 1 ms.
[2026-05-27 18:34:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-27 18:34:48] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
[2026-05-27 18:34:48] [INFO ] Invariant cache hit.
[2026-05-27 18:34:48] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-27 18:34:48] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/195 places, 93/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 419 ms. Remains : 54/195 places, 93/482 transitions.
[2026-05-27 18:34:48] [INFO ] Flatten gal took : 6 ms
[2026-05-27 18:34:48] [INFO ] Flatten gal took : 4 ms
[2026-05-27 18:34:48] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-27 18:34:48] [INFO ] Flatten gal took : 4 ms
[2026-05-27 18:34:48] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:34:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8595684072603301053.gal : 4 ms
[2026-05-27 18:34:48] [INFO ] Time to serialize properties into /tmp/CTLFireability981656976368588449.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/CTLFireability8595684072603301053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability981656976368588449.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,9.8345e+06,0.041055,4600,2,324,5,3235,6,0,293,2137,0


Converting to forward existential form...Done !
original formula: EF(!(E((((p47==1)&&(p168==1))&&(p193==1)) U !(AG((((p84==1)&&(p179==1))&&(p193==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((((p47==1)&&(p168==1))&&(p193==1)) U !(!(E(TRUE U !((((p84==1)&&(p179==1))&&(p193==1))))...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 60/53/33
(forward)formula 0,0,0.10723,5664,1,0,7,9523,22,0,1503,2746,8
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 158 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 147 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 0 with 120 rules applied. Total rules applied 153 place count 147 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 147 transition count 209
Applied a total of 154 rules in 57 ms. Remains 147 /195 variables (removed 48) and now considering 209/482 (removed 273) transitions.
[2026-05-27 18:34:48] [INFO ] Flow matrix only has 194 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6262018543024790967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14303858098167429544.kers'
[2026-05-27 18:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6262018543024790967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14303858098167429544.kers]
Normalized transition count is 193 out of 194 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 193 rows 145 cols 401 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-27 18:34:48] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14303858098167429544.kers
Total runtime 2 ms.
[2026-05-27 18:34:48] [INFO ] Implicit Places using invariants in 144 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/195 places, 209/482 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 146 transition count 193
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 130 transition count 193
Applied a total of 32 rules in 12 ms. Remains 130 /146 variables (removed 16) and now considering 193/209 (removed 16) transitions.
[2026-05-27 18:34:48] [INFO ] Flow matrix only has 178 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10170367809645481268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9484441541259228549.kers'
[2026-05-27 18:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10170367809645481268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9484441541259228549.kers]
Normalized transition count is 177 out of 178 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 177 rows 129 cols 369 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-27 18:34:48] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9484441541259228549.kers
Total runtime 1 ms.
[2026-05-27 18:34:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-27 18:34:48] [INFO ] Flow matrix only has 178 transitions (discarded 15 similar events)
[2026-05-27 18:34:48] [INFO ] Invariant cache hit.
[2026-05-27 18:34:48] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-27 18:34:49] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 130/195 places, 193/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 555 ms. Remains : 130/195 places, 193/482 transitions.
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 5 ms
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 3 ms
[2026-05-27 18:34:49] [INFO ] Input system was already deterministic with 193 transitions.
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 779 steps (0 resets) in 32 ms. (23 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 9 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13382751130470652155.gal : 3 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9157457642902183113.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13382751130470652155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9157457642902183113.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 160 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 147 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 0 with 120 rules applied. Total rules applied 153 place count 147 transition count 209
Applied a total of 153 rules in 27 ms. Remains 147 /195 variables (removed 48) and now considering 209/482 (removed 273) transitions.
[2026-05-27 18:34:49] [INFO ] Flow matrix only has 194 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16468204501530496099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3054193395419599925.kers'
[2026-05-27 18:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16468204501530496099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3054193395419599925.kers]
Normalized transition count is 193 out of 194 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 193 rows 145 cols 401 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-27 18:34:49] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3054193395419599925.kers
Total runtime 1 ms.
[2026-05-27 18:34:49] [INFO ] Implicit Places using invariants in 165 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 146/195 places, 209/482 transitions.
Graph (trivial) has 191 edges and 146 vertex of which 80 / 146 are part of one of the 16 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 82 transition count 97
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 66 transition count 97
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 33 place count 66 transition count 82
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 63 place count 51 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 51 transition count 66
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 111 place count 35 transition count 50
Applied a total of 111 rules in 12 ms. Remains 35 /146 variables (removed 111) and now considering 50/209 (removed 159) transitions.
[2026-05-27 18:34:49] [INFO ] Flow matrix only has 35 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3408848188136444914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-44697855346564813.kers'
[2026-05-27 18:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3408848188136444914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-44697855346564813.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 34 cols 83 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-27 18:34:49] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-44697855346564813.kers
Total runtime 2 ms.
[2026-05-27 18:34:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-27 18:34:49] [INFO ] Flow matrix only has 35 transitions (discarded 15 similar events)
[2026-05-27 18:34:49] [INFO ] Invariant cache hit.
[2026-05-27 18:34:49] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-27 18:34:49] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 35/195 places, 50/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 310 ms. Remains : 35/195 places, 50/482 transitions.
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:34:49] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 158 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2450799478260634822.gal : 1 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3904311305740526193.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2450799478260634822.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3904311305740526193.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (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-17462509315348494083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16006177687803358151.kers'
[2026-05-27 18:34:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17462509315348494083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16006177687803358151.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 482 rows 193 cols 1429 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-27 18:34:49] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16006177687803358151.kers
Total runtime 2 ms.
[2026-05-27 18:34:49] [INFO ] Implicit Places using invariants in 204 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 194/195 places, 482/482 transitions.
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 10 ms
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:34:49] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 12 ms
[2026-05-27 18:34:49] [INFO ] Flatten gal took : 12 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13606836220219180136.gal : 4 ms
[2026-05-27 18:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10818555618593672806.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/CTLFireability13606836220219180136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10818555618593672806.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,8.29907,202020,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: EF((AG(AX(EX((((p48==1)&&(p107==1))&&(p193==1))))) * ((((p36==1)&&(p143==1))&&(p193==1)) + (((AG((((p108==0)||(p119==0))||(p193==0))) * A...299
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(EX((((p48==1)&&(p107==1))&&(p193==1)))))))))) * (((p36==1)&&(p143==1))...488
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,25.0379,497716,1,0,19,3.2437e+06,35,2,7223,949436,19
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:35:14] [INFO ] Invariant cache hit.
[2026-05-27 18:35:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-27 18:35:15] [INFO ] Invariant cache hit.
[2026-05-27 18:35:15] [INFO ] State equation strengthened by 321 read => feed constraints.
[2026-05-27 18:35:15] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2026-05-27 18:35:15] [INFO ] Invariant cache hit.
[2026-05-27 18:35:15] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30024 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30028 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in LTL mode , in 1 iterations and 61116 ms. Remains : 195/195 places, 482/482 transitions.
[2026-05-27 18:36:16] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:36:16] [INFO ] Flatten gal took : 18 ms
[2026-05-27 18:36:16] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:36:16] [INFO ] Flatten gal took : 14 ms
[2026-05-27 18:36:16] [INFO ] Flatten gal took : 14 ms
[2026-05-27 18:36:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1378905586336693443.gal : 4 ms
[2026-05-27 18:36:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14188120472331390620.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/CTLFireability1378905586336693443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14188120472331390620.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,14.6185,338636,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: AG(E(((!(A(AG((((p60==1)&&(p167==1))&&(p193==1))) U !((((p180==1)&&(p191==1))&&(p193==1))))) + (p157!=1)) + EG(!(((p21==1)&&(p194==1)))))...185
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((!(!((E(!(!((((p180==1)&&(p191==1))&&(p193==1)))) U (!(!(E(TRUE U !((((p60==1)&&(p167==...362
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/449/247
(forward)formula 0,0,28.6661,464320,1,0,13,3.13971e+06,39,3,7861,939244,17
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 155 edges and 195 vertex of which 42 / 195 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 176 place count 152 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 152 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 178 place count 151 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 151 transition count 215
Applied a total of 179 rules in 34 ms. Remains 151 /195 variables (removed 44) and now considering 215/482 (removed 267) transitions.
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 202 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6908491962453975840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4635172702884202458.kers'
[2026-05-27 18:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6908491962453975840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4635172702884202458.kers]
Normalized transition count is 201 out of 202 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 201 rows 149 cols 421 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 18:36:45] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4635172702884202458.kers
Total runtime 1 ms.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants in 136 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/195 places, 215/482 transitions.
Graph (trivial) has 192 edges and 150 vertex of which 74 / 150 are part of one of the 16 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 92 transition count 111
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 74 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 37 place count 74 transition count 95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 69 place count 58 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 58 transition count 81
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 111 place count 44 transition count 67
Applied a total of 111 rules in 9 ms. Remains 44 /150 variables (removed 106) and now considering 67/215 (removed 148) transitions.
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16017105786621226107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6760286430170663709.kers'
[2026-05-27 18:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16017105786621226107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6760286430170663709.kers]
Normalized transition count is 51 out of 52 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 51 rows 43 cols 121 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-27 18:36:45] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6760286430170663709.kers
Total runtime 0 ms.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
[2026-05-27 18:36:45] [INFO ] Invariant cache hit.
[2026-05-27 18:36:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/195 places, 67/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 288 ms. Remains : 44/195 places, 67/482 transitions.
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:36:45] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2482816587638624190.gal : 1 ms
[2026-05-27 18:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2391311372537839259.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/CTLFireability2482816587638624190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2391311372537839259.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,802817,0.013142,4184,2,189,5,1115,6,0,227,610,0


Converting to forward existential form...Done !
original formula: EF(AG((((p108==1)&&(p143==1))&&(p193==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p108==1)&&(p143==1))&&(p193==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.03064,4768,1,0,6,4521,15,0,1046,971,5
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 150 edges and 195 vertex of which 36 / 195 are part of one of the 12 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 157 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 0 with 158 rules applied. Total rules applied 187 place count 157 transition count 231
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 189 place count 157 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 191 place count 155 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 193 place count 155 transition count 229
Applied a total of 193 rules in 30 ms. Remains 155 /195 variables (removed 40) and now considering 229/482 (removed 253) transitions.
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8008981463518835989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6387472451164212334.kers'
[2026-05-27 18:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8008981463518835989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6387472451164212334.kers]
Normalized transition count is 217 out of 218 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 217 rows 153 cols 473 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-27 18:36:45] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6387472451164212334.kers
Total runtime 1 ms.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants in 126 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/195 places, 229/482 transitions.
Graph (trivial) has 192 edges and 154 vertex of which 68 / 154 are part of one of the 16 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 102 transition count 133
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 82 transition count 133
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 41 place count 82 transition count 117
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 73 place count 66 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 105
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 109 place count 54 transition count 93
Applied a total of 109 rules in 11 ms. Remains 54 /154 variables (removed 100) and now considering 93/229 (removed 136) transitions.
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9356476299120788171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1729449188602612400.kers'
[2026-05-27 18:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9356476299120788171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1729449188602612400.kers]
Normalized transition count is 77 out of 78 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 53 cols 193 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-27 18:36:45] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1729449188602612400.kers
Total runtime 1 ms.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-27 18:36:45] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
[2026-05-27 18:36:45] [INFO ] Invariant cache hit.
[2026-05-27 18:36:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/195 places, 93/482 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 333 ms. Remains : 54/195 places, 93/482 transitions.
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 4 ms
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:36:45] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:36:45] [INFO ] Flatten gal took : 2 ms
[2026-05-27 18:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1707588921753199447.gal : 1 ms
[2026-05-27 18:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16451086360971935117.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/CTLFireability1707588921753199447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16451086360971935117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.8345e+06,0.043906,4692,2,432,5,3461,6,0,293,2364,0


Converting to forward existential form...Done !
original formula: AG(EF(((((p83==1)&&(p156==1))&&((p193==1)&&(p36==1)))&&(p107==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((p83==1)&&(p156==1))&&((p193==1)&&(p36==1)))&&(p107==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.149006,6780,1,0,6,17458,14,0,1389,4283,5
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 155 edges and 195 vertex of which 45 / 195 are part of one of the 15 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 220 edges and 162 vertex of which 150 / 162 are part of one of the 18 SCC in 0 ms
Free SCC test removed 132 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 0 with 5 rules applied. Total rules applied 6 place count 30 transition count 358
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 332 transitions
Reduce isomorphic transitions removed 332 transitions.
Graph (trivial) has 17 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 350 rules applied. Total rules applied 356 place count 13 transition count 25
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 359 place count 12 transition count 23
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 361 place count 10 transition count 19
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 10 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 4 rules applied. Total rules applied 367 place count 10 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 370 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 371 place count 7 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 377 place count 7 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 379 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 381 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 381 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 383 place count 4 transition count 5
Applied a total of 383 rules in 18 ms. Remains 4 /195 variables (removed 191) and now considering 5/482 (removed 477) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9698162707604072654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5302132298048977050.kers'
[2026-05-27 18:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9698162707604072654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5302132298048977050.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 18:36:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5302132298048977050.kers
Total runtime 0 ms.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-27 18:36:45] [INFO ] Invariant cache hit.
[2026-05-27 18:36:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-27 18:36:45] [INFO ] Redundant transitions in 1 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 18:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/195 places, 5/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 4/195 places, 5/482 transitions.
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 1 ms
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:36:46] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8629758677756116871.gal : 1 ms
[2026-05-27 18:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3829608678619418484.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/CTLFireability8629758677756116871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3829608678619418484.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,4,0.003089,3740,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: EG(AG((AG((p166==1)) + AF((p20==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(E(TRUE U !((p166==1)))) + !(EG(!((p20==0)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006158,4292,1,0,8,54,27,2,89,46,11
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (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-14972658527745127272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14495383694302629919.kers'
[2026-05-27 18:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14972658527745127272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14495383694302629919.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 482 rows 193 cols 1429 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-27 18:36:46] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14495383694302629919.kers
Total runtime 4 ms.
[2026-05-27 18:36:46] [INFO ] Implicit Places using invariants in 331 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 332 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 194/195 places, 482/482 transitions.
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 11 ms
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:36:46] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 18 ms
[2026-05-27 18:36:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3725473986401052719.gal : 4 ms
[2026-05-27 18:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14117644511760912343.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/CTLFireability3725473986401052719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14117644511760912343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,8.37259,201812,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: EF(!(A(AF(((p94!=1) * E((((p95==1)&&(p144==1))&&(p193==1)) U (((p59==1)&&(p156==1))&&(p193==1))))) U AF((EX((((p95==1)&&(p156==1))&&(p193...177
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!((EX((((p95==1)&&(p156==1))&&(p193==1))) + (p70!=1))))))) * !(!(EG(!(((p94!...408
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/435/247
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,28.7192,560580,1,0,22,3.65162e+06,38,11,7854,1.31242e+06,24
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 159 edges and 195 vertex of which 48 / 195 are part of one of the 16 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 221 edges and 160 vertex of which 156 / 160 are part of one of the 16 SCC in 1 ms
Free SCC test removed 140 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 20 transition count 343
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 357 place count 4 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 4 transition count 6
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 359 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 361 place count 3 transition count 3
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 363 place count 2 transition count 3
Applied a total of 363 rules in 7 ms. Remains 2 /195 variables (removed 193) and now considering 3/482 (removed 479) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14701112768441563084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7519732536850773700.kers'
[2026-05-27 18:37:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14701112768441563084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7519732536850773700.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-27 18:37:15] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7519732536850773700.kers
Total runtime 0 ms.
[2026-05-27 18:37:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-27 18:37:15] [INFO ] Invariant cache hit.
[2026-05-27 18:37:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-27 18:37:15] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-27 18:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/195 places, 3/482 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 111 ms. Remains : 2/195 places, 3/482 transitions.
[2026-05-27 18:37:15] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:37:15] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:37:15] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-27 18:37:15] [INFO ] Flatten gal took : 0 ms
[2026-05-27 18:37:15] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 18:37:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3649086261863739270.gal : 0 ms
[2026-05-27 18:37:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4988463917643693845.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3649086261863739270.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4988463917643693845.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (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-7076045197428500647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3291337990381273251.kers'
[2026-05-27 18:37:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7076045197428500647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3291337990381273251.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 482 rows 193 cols 1429 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-27 18:37:15] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3291337990381273251.kers
Total runtime 2 ms.
[2026-05-27 18:37:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-27 18:37:15] [INFO ] Invariant cache hit.
[2026-05-27 18:37:15] [INFO ] State equation strengthened by 321 read => feed constraints.
[2026-05-27 18:37:16] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 481 sub problems to find dead transitions.
[2026-05-27 18:37:16] [INFO ] Invariant cache hit.
[2026-05-27 18:37:16] [INFO ] State equation strengthened by 321 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 677/677 variables, and 729 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30023 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 481 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 18/212 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 5 (OVERLAPS) 482/677 variables, 195/408 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 321/729 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 481/1210 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/677 variables, and 1210 constraints, problems are : Problem set: 0 solved, 481 unsolved in 30021 ms.
Refiners :[Domain max(s): 195/195 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 481/481 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Finished structural reductions in LTL mode , in 1 iterations and 61010 ms. Remains : 195/195 places, 482/482 transitions.
[2026-05-27 18:38:16] [INFO ] Flatten gal took : 11 ms
[2026-05-27 18:38:16] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:38:16] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:38:16] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:38:16] [INFO ] Flatten gal took : 13 ms
[2026-05-27 18:38:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11245928233552075775.gal : 5 ms
[2026-05-27 18:38:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11266116978304281422.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/CTLFireability11245928233552075775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11266116978304281422.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,15.6893,337504,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EF((((EG(A(!(((p182==1)&&(p194==1))) U ((((p36==1)&&(p95==1))&&(p193==1))||(((p95==1)&&(p144==1))&&(p193==1))))) * AG(((((p120==1)&&(p131...359
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((p132==1)&&(p193==1))) * (EG(!((E(!(((((p36==1)&&(p95==1))&&(p193==1))||(((p95==1)&&(p14...624
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-27 18:38:46] [INFO ] Flatten gal took : 8 ms
[2026-05-27 18:38:46] [INFO ] Applying decomposition
[2026-05-27 18:38:46] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12026117216769960607.txt' '-o' '/tmp/graph12026117216769960607.bin' '-w' '/tmp/graph12026117216769960607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12026117216769960607.bin' '-l' '-1' '-v' '-w' '/tmp/graph12026117216769960607.weights' '-q' '0' '-e' '0.001'
[2026-05-27 18:38:46] [INFO ] Decomposing Gal with order
[2026-05-27 18:38:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 18:38:46] [INFO ] Removed a total of 719 redundant transitions.
[2026-05-27 18:38:46] [INFO ] Flatten gal took : 26 ms
[2026-05-27 18:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 11 ms.
[2026-05-27 18:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9303923340960147668.gal : 4 ms
[2026-05-27 18:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11583382849066973965.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/CTLFireability9303923340960147668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11583382849066973965.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.13556,7832,129,23,7783,348,576,9189,57,586,0


Converting to forward existential form...Done !
original formula: EF((((EG(A(!(((i14.u45.p182==1)&&(i2.i0.u0.p194==1))) U ((((i1.u8.p36==1)&&(i7.u23.p95==1))&&(i3.u11.p193==1))||(((i7.u23.p95==1)&&(i10.u...534
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((i3.u32.p132==1)&&(i3.u11.p193==1))) * (EG(!((E(!(((((i1.u8.p36==1)&&(i7.u23.p95==1))&&(...883
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,0.205971,8088,1,0,7783,351,2534,9189,245,673,7795
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:38:47] [INFO ] Invariant cache hit.
[2026-05-27 18:38:47] [INFO ] Implicit Places using invariants in 265 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 5 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 194/195 places, 482/482 transitions.
[2026-05-27 18:38:47] [INFO ] Flatten gal took : 9 ms
[2026-05-27 18:38:47] [INFO ] Flatten gal took : 10 ms
[2026-05-27 18:38:47] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:38:47] [INFO ] Flatten gal took : 10 ms
[2026-05-27 18:38:47] [INFO ] Flatten gal took : 11 ms
[2026-05-27 18:38:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10318205924784402746.gal : 3 ms
[2026-05-27 18:38:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16213451136637080602.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/CTLFireability10318205924784402746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16213451136637080602.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,7.85249,201320,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AF(AX((EF(AG((((p83==1)&&(p108==1))&&(p193==1)))) * EG(EX((((p180==1)&&(p191==1))&&(p193==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((E(TRUE U !(E(TRUE U !((((p83==1)&&(p108==1))&&(p193==1)))))) * EG(EX((((p180==1)&&(p191==1)...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,28.1104,574608,1,0,10,3.44723e+06,25,1,7845,1.27896e+06,14
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-14 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 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2026-05-27 18:39:15] [INFO ] Invariant cache hit.
[2026-05-27 18:39:15] [INFO ] Implicit Places using invariants in 207 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 194/195 places, 482/482 transitions.
[2026-05-27 18:39:15] [INFO ] Flatten gal took : 6 ms
[2026-05-27 18:39:15] [INFO ] Flatten gal took : 6 ms
[2026-05-27 18:39:15] [INFO ] Input system was already deterministic with 482 transitions.
[2026-05-27 18:39:15] [INFO ] Flatten gal took : 7 ms
[2026-05-27 18:39:16] [INFO ] Flatten gal took : 8 ms
[2026-05-27 18:39:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14556539597579725163.gal : 3 ms
[2026-05-27 18:39:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1705152751215770869.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/CTLFireability14556539597579725163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1705152751215770869.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,8.10376,202268,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: !(A(EF(((!((((p84==1)&&(p95==1))&&(p193==1))) + !(EX((((p72==1)&&(p119==1))&&(p193==1))))) + (AG((((p143==1)&&(p180==1))&&(p193==1))) * A...222
=> equivalent forward existential formula: ([(EY(EY((FwdU(Init,!(!(EX(!(!(EX(!(FALSE)))))))) * !(E(TRUE U ((!((((p84==1)&&(p95==1))&&(p193==1))) + !(EX((((...472
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/247
Detected timeout of ITS tools.
[2026-05-27 18:39:46] [INFO ] Flatten gal took : 7 ms
[2026-05-27 18:39:46] [INFO ] Applying decomposition
[2026-05-27 18:39:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11468714422975979625.txt' '-o' '/tmp/graph11468714422975979625.bin' '-w' '/tmp/graph11468714422975979625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11468714422975979625.bin' '-l' '-1' '-v' '-w' '/tmp/graph11468714422975979625.weights' '-q' '0' '-e' '0.001'
[2026-05-27 18:39:46] [INFO ] Decomposing Gal with order
[2026-05-27 18:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 18:39:46] [INFO ] Removed a total of 660 redundant transitions.
[2026-05-27 18:39:46] [INFO ] Flatten gal took : 26 ms
[2026-05-27 18:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-27 18:39:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10771119119231052899.gal : 5 ms
[2026-05-27 18:39:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9295358720925886416.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/CTLFireability10771119119231052899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9295358720925886416.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84884e+17,0.122964,7512,156,16,7102,227,524,8181,37,347,0


Converting to forward existential form...Done !
original formula: !(A(EF(((!((((i7.u34.p84==1)&&(i8.u39.p95==1))&&(i2.u4.p193==1))) + !(EX((((i6.u29.p72==1)&&(i10.u49.p119==1))&&(i2.u4.p193==1))))) + (AG...310
=> equivalent forward existential formula: ([(EY(EY((FwdU(Init,!(!(EX(!(!(EX(!(FALSE)))))))) * !(E(TRUE U ((!((((i7.u34.p84==1)&&(i8.u39.p95==1))&&(i2.u4.p...598
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,0.289179,11096,1,0,13445,227,2715,24813,145,395,23328
FORMULA FlexibleBarrier-PT-16a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 18:39:46] [INFO ] Flatten gal took : 8 ms
[2026-05-27 18:39:46] [INFO ] Flatten gal took : 8 ms
Total runtime 521010 ms.

BK_STOP 1779907186620

--------------------
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="FlexibleBarrier-PT-16a"
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 FlexibleBarrier-PT-16a, 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-177955809100402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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