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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.5K Mar 7 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 05:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 05:33 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 17 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 7 05:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 17 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:03 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 128K 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-12a-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-12a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779888336157

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-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-27 13:25:38] [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 13:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 13:25:38] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2026-05-27 13:25:38] [INFO ] Transformed 147 places.
[2026-05-27 13:25:38] [INFO ] Transformed 448 transitions.
[2026-05-27 13:25:38] [INFO ] Found NUPN structural information;
[2026-05-27 13:25:38] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
Support contains 53 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 39 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3829127921361776909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16615574365315195265.kers'
[2026-05-27 13:25:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3829127921361776909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16615574365315195265.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 314 rows 145 cols 881 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 13:25:38] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16615574365315195265.kers
Total runtime 5 ms.
[2026-05-27 13:25:39] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-27 13:25:39] [INFO ] Invariant cache hit.
[2026-05-27 13:25:39] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:25:40] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2026-05-27 13:25:40] [INFO ] Invariant cache hit.
[2026-05-27 13:25:40] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30041 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30022 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 147/147 places, 314/326 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61757 ms. Remains : 147/147 places, 314/326 transitions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:26:40] [INFO ] Invariant cache hit.
[2026-05-27 13:26:40] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-27 13:26:40] [INFO ] Invariant cache hit.
[2026-05-27 13:26:40] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:26:41] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 147/147 places, 314/314 transitions.
Support contains 53 out of 147 places after structural reductions.
[2026-05-27 13:26:41] [INFO ] Flatten gal took : 70 ms
[2026-05-27 13:26:41] [INFO ] Flatten gal took : 33 ms
[2026-05-27 13:26:41] [INFO ] Input system was already deterministic with 314 transitions.
Support contains 52 out of 147 places (down from 53) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 64
RANDOM walk for 40000 steps (8 resets) in 2035 ms. (19 steps per ms) remains 2/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
[2026-05-27 13:26:42] [INFO ] Invariant cache hit.
[2026-05-27 13:26:42] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Real declared 50/461 variables, and 13 constraints, problems are : Problem set: 2 solved, 0 unsolved in 42 ms.
Refiners :[Domain max(s): 8/147 constraints, Positive P Invariants (semi-flows): 5/14 constraints, State Equation: 0/147 constraints, ReadFeed: 0/193 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52ms 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 13:26:42] [INFO ] Flatten gal took : 22 ms
[2026-05-27 13:26:42] [INFO ] Flatten gal took : 24 ms
[2026-05-27 13:26:42] [INFO ] Input system was already deterministic with 314 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:26:42] [INFO ] Invariant cache hit.
[2026-05-27 13:26:42] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-27 13:26:42] [INFO ] Invariant cache hit.
[2026-05-27 13:26:43] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:26:43] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:26:43] [INFO ] Flatten gal took : 19 ms
[2026-05-27 13:26:43] [INFO ] Flatten gal took : 19 ms
[2026-05-27 13:26:43] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:26:43] [INFO ] Flatten gal took : 17 ms
[2026-05-27 13:26:43] [INFO ] Flatten gal took : 16 ms
[2026-05-27 13:26:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1528049494920621972.gal : 11 ms
[2026-05-27 13:26:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1844113047394763949.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/CTLFireability1528049494920621972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1844113047394763949.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,8.9161e+12,2.73703,69584,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: E(((AX((p61==1)) * ((!(((p59==1)&&(p72==1))&&(p145==1)))||((p29==1)&&(p146==1)))) * (((((p36==1)&&(p107==1))&&(p145==1)) + (!(E((((p71==1...514
=> equivalent forward existential formula: [(FwdU(Init,((!(EX(!((p61==1)))) * ((!(((p59==1)&&(p72==1))&&(p145==1)))||((p29==1)&&(p146==1)))) * (((((p36==1)...685
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 175/235/139
Hit Full ! (commute/partial/dont) 175/0/139
Hit Full ! (commute/partial/dont) 175/235/139
(forward)formula 0,1,6.25162,123996,1,0,26,838559,68,10,6037,342066,33
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:26:49] [INFO ] Invariant cache hit.
[2026-05-27 13:26:49] [INFO ] Implicit Places using invariants in 178 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 9 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:26:49] [INFO ] Flatten gal took : 14 ms
[2026-05-27 13:26:49] [INFO ] Flatten gal took : 14 ms
[2026-05-27 13:26:49] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:26:49] [INFO ] Flatten gal took : 20 ms
[2026-05-27 13:26:49] [INFO ] Flatten gal took : 19 ms
[2026-05-27 13:26:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4950990338630308413.gal : 9 ms
[2026-05-27 13:26:49] [INFO ] Time to serialize properties into /tmp/CTLFireability213393993244733288.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/CTLFireability4950990338630308413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability213393993244733288.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,8.9161e+12,1.02631,29448,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: E(EF((((p83==1)&&(p132==1))&&(p145==1))) U AX((!(AG((((p23==1)&&(p96==1))&&(p145==1)))) * AG(((((((p23==1)&&(p96==1))&&(p145==1))||(((p24...223
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((p83==1)&&(p132==1))&&(p145==1)))) * !(EX(!((!(!(E(TRUE U !((((p23==1)&&(p96==1))&&(p145=...305
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.31833,51912,1,0,6,312329,17,0,4540,87635,5
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 106 place count 116 transition count 164
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 107 place count 116 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 108 place count 115 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 115 transition count 163
Applied a total of 109 rules in 70 ms. Remains 115 /147 variables (removed 32) and now considering 163/314 (removed 151) transitions.
[2026-05-27 13:26:52] [INFO ] Flow matrix only has 154 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9650683145168106141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-565730540526845608.kers'
[2026-05-27 13:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9650683145168106141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-565730540526845608.kers]
Normalized transition count is 153 out of 154 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 153 rows 113 cols 321 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-27 13:26:52] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-565730540526845608.kers
Total runtime 1 ms.
[2026-05-27 13:26:52] [INFO ] Implicit Places using invariants in 117 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 114/147 places, 163/314 transitions.
Graph (trivial) has 144 edges and 114 vertex of which 54 / 114 are part of one of the 12 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 72 transition count 87
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 58 transition count 87
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 58 transition count 75
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 46 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 46 transition count 65
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 36 transition count 55
Applied a total of 83 rules in 24 ms. Remains 36 /114 variables (removed 78) and now considering 55/163 (removed 108) transitions.
[2026-05-27 13:26:52] [INFO ] Flow matrix only has 44 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-6476495776577188660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6821830462504346432.kers'
[2026-05-27 13:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6476495776577188660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6821830462504346432.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 35 cols 101 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-27 13:26:52] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6821830462504346432.kers
Total runtime 2 ms.
[2026-05-27 13:26:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-27 13:26:52] [INFO ] Flow matrix only has 44 transitions (discarded 11 similar events)
[2026-05-27 13:26:52] [INFO ] Invariant cache hit.
[2026-05-27 13:26:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-27 13:26:52] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/147 places, 55/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 310 ms. Remains : 36/147 places, 55/314 transitions.
[2026-05-27 13:26:52] [INFO ] Flatten gal took : 3 ms
[2026-05-27 13:26:52] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:26:52] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-27 13:26:52] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:26:52] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:26:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9121894671443232818.gal : 1 ms
[2026-05-27 13:26:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8679165221052283634.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/CTLFireability9121894671443232818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8679165221052283634.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,50177,0.010201,4096,2,137,5,779,6,0,187,468,0


Converting to forward existential form...Done !
original formula: EF(AG((((p71==1)&&(p108==1))&&(p145==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p71==1)&&(p108==1))&&(p145==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.020978,4424,1,0,6,2581,15,0,859,741,5
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (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-6837619694047959166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11057150242367935491.kers'
[2026-05-27 13:26:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6837619694047959166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11057150242367935491.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 314 rows 145 cols 881 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 13:26:52] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11057150242367935491.kers
Total runtime 2 ms.
[2026-05-27 13:26:52] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-27 13:26:52] [INFO ] Invariant cache hit.
[2026-05-27 13:26:52] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:26:53] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:26:53] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:26:53] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:26:53] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:26:53] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:26:53] [INFO ] Flatten gal took : 10 ms
[2026-05-27 13:26:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6555959544806873043.gal : 3 ms
[2026-05-27 13:26:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3421432850212252125.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/CTLFireability6555959544806873043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3421432850212252125.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,8.9161e+12,2.87109,69768,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: (EF(AG(AX(((p127==1)&&(p146==1))))) + EG(!(E(EF(((((p71==1)&&(p132==1))&&(p145==1))||(((p108==1)&&(p119==1))&&(p145==1)))) U EF((p104==1)...160
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((p127==1)&&(p146==1)))))))))] != FALSE + [FwdG(Init,!(E(E(TRUE U ((((p...260
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,5.27623,91404,1,0,9,575733,23,0,5028,219239,15
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:26:58] [INFO ] Invariant cache hit.
[2026-05-27 13:26:58] [INFO ] Implicit Places using invariants in 157 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:26:58] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:26:58] [INFO ] Flatten gal took : 16 ms
[2026-05-27 13:26:58] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:26:58] [INFO ] Flatten gal took : 10 ms
[2026-05-27 13:26:58] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8094829889840458667.gal : 3 ms
[2026-05-27 13:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5731370840257041252.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/CTLFireability8094829889840458667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5731370840257041252.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,8.9161e+12,0.908086,29480,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AG((((EF(!(E(EF((p83==1)) U (((p72==1)&&(p107==1))&&(p145==1))))) + EX((((p60==1)&&(p107==1))&&(p145==1)))) + (EF((p142==0)) + (((p84==1)...276
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((E(TRUE U !(E(E(TRUE U (p83==1)) U (((p72==1)&&(p107==1))&&(p145==1))))) + EX((((p60==1...788
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.89544,66436,1,0,17,410040,34,5,4883,126305,21
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:27:01] [INFO ] Invariant cache hit.
[2026-05-27 13:27:01] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-27 13:27:01] [INFO ] Invariant cache hit.
[2026-05-27 13:27:02] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:27:02] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:27:02] [INFO ] Flatten gal took : 14 ms
[2026-05-27 13:27:02] [INFO ] Flatten gal took : 25 ms
[2026-05-27 13:27:02] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:27:02] [INFO ] Flatten gal took : 13 ms
[2026-05-27 13:27:02] [INFO ] Flatten gal took : 13 ms
[2026-05-27 13:27:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9760705130942492867.gal : 4 ms
[2026-05-27 13:27:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8729526178264064264.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/CTLFireability9760705130942492867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8729526178264064264.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,8.9161e+12,2.93535,69540,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: A((((A(EG((p15!=1)) U ((((((p36==1)&&(p119==1))&&(p145==1))||(p109==1)) * AX((((p48==1)&&(p143==1))&&(p145==1)))) + !(AG((((p12==1)&&(p11...345
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(EX(((p92==1)||(((p23==1)&&(p84==1))&&(p145==1)))))) U (!(((p49==1) + ((p144!=1) * !(E...1402
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,6.12908,114068,1,0,27,767154,39,16,5254,303951,27
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 101 edges and 147 vertex of which 18 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 126 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 0 with 76 rules applied. Total rules applied 95 place count 126 transition count 207
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 126 transition count 207
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 123 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 123 transition count 204
Applied a total of 104 rules in 62 ms. Remains 123 /147 variables (removed 24) and now considering 204/314 (removed 110) transitions.
[2026-05-27 13:27:08] [INFO ] Flow matrix only has 195 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12039645168582847837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15217284269793900119.kers'
[2026-05-27 13:27:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12039645168582847837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15217284269793900119.kers]
Normalized transition count is 194 out of 195 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 194 rows 121 cols 459 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-27 13:27:08] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15217284269793900119.kers
Total runtime 4 ms.
[2026-05-27 13:27:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-27 13:27:08] [INFO ] Flow matrix only has 195 transitions (discarded 9 similar events)
[2026-05-27 13:27:08] [INFO ] Invariant cache hit.
[2026-05-27 13:27:09] [INFO ] State equation strengthened by 104 read => feed constraints.
[2026-05-27 13:27:09] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2026-05-27 13:27:09] [INFO ] Redundant transitions in 12 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-27 13:27:09] [INFO ] Flow matrix only has 195 transitions (discarded 9 similar events)
[2026-05-27 13:27:09] [INFO ] Invariant cache hit.
[2026-05-27 13:27:09] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 194/317 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 103/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 1/318 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 241 constraints, problems are : Problem set: 0 solved, 203 unsolved in 21557 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 123/123 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 194/317 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 103/240 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 203/443 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/318 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 444 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23336 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 123/123 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44947ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 44949ms
Starting structural reductions in SI_CTL mode, iteration 1 : 123/147 places, 204/314 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45419 ms. Remains : 123/147 places, 204/314 transitions.
[2026-05-27 13:27:54] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:27:54] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:27:54] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-27 13:27:54] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:27:54] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:27:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11998017260201551930.gal : 2 ms
[2026-05-27 13:27:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17778983220377976878.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/CTLFireability11998017260201551930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17778983220377976878.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.4148e+11,0.938643,25164,2,1561,5,121012,6,0,688,74188,0


Converting to forward existential form...Done !
original formula: AG((((EF((((((p72==1)&&(p107==1))&&(p145==1))||(p17==0))||(p146==0))) + (p59==0)) + ((p96==0)||(p145==0))) + ((!(A((((p12==1)&&(p47==1))&...256
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !(((!(!((E(!((p133==1)) U (!((((p12==1)&&(p47==1))&&(p145==1))) * !((p133==1)))) + EG(!((...372
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.19471,25164,1,0,6,121012,14,0,3235,74188,5
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (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-12544320885942838014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14800795374056332367.kers'
[2026-05-27 13:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12544320885942838014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14800795374056332367.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 314 rows 145 cols 881 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 13:27:55] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14800795374056332367.kers
Total runtime 3 ms.
[2026-05-27 13:27:55] [INFO ] Implicit Places using invariants in 163 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:27:55] [INFO ] Flatten gal took : 7 ms
[2026-05-27 13:27:55] [INFO ] Flatten gal took : 7 ms
[2026-05-27 13:27:55] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:27:55] [INFO ] Flatten gal took : 7 ms
[2026-05-27 13:27:55] [INFO ] Flatten gal took : 8 ms
[2026-05-27 13:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4924543937822812494.gal : 2 ms
[2026-05-27 13:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5458663964097655434.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/CTLFireability4924543937822812494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5458663964097655434.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,8.9161e+12,1.09573,29544,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: EX(EF((((A((p5!=1) U (((((p107==1)&&(p120==1))&&((p145==1)&&(p63==1)))||(p46==1))||(((p11==1)&&(p72==1))&&(p145==1)))) * AX(AG((p104==1))...197
=> equivalent forward existential formula: [((((FwdU(EY(Init),TRUE) * (p145==1)) * ((p24==1)&&(p131==1))) * !((E(!((((((p107==1)&&(p120==1))&&((p145==1)&&(...488
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.45904,50956,1,0,6,310744,15,0,4518,87635,5
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-07 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 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:27:58] [INFO ] Invariant cache hit.
[2026-05-27 13:27:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-27 13:27:58] [INFO ] Invariant cache hit.
[2026-05-27 13:27:58] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:27:58] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2026-05-27 13:27:58] [INFO ] Invariant cache hit.
[2026-05-27 13:27:58] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 501 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30019 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/461 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 193/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 313/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 814 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30023 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 147/147 constraints, ReadFeed: 193/193 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60561 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:28:58] [INFO ] Flatten gal took : 12 ms
[2026-05-27 13:28:58] [INFO ] Flatten gal took : 13 ms
[2026-05-27 13:28:58] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:28:58] [INFO ] Flatten gal took : 15 ms
[2026-05-27 13:28:58] [INFO ] Flatten gal took : 11 ms
[2026-05-27 13:28:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11078133562772284922.gal : 4 ms
[2026-05-27 13:28:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16863337716785243404.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/CTLFireability11078133562772284922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16863337716785243404.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,8.9161e+12,2.95161,70584,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: EF(EG(A(AX((((p96==1)&&(p143==1))&&(p145==1))) U ((!((p134==1)&&(p146==1)))&&(p109==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(((!((p134==1)&&(p146==1)))&&(p109==1))) U (!(!(EX(!((((p96==1)&&(p143==1))&&(p145==...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 249/0/65
(forward)formula 0,1,4.23327,70584,1,0,10,374861,26,5,5097,219239,16
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:29:03] [INFO ] Invariant cache hit.
[2026-05-27 13:29:03] [INFO ] Implicit Places using invariants in 213 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:29:03] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:03] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:29:03] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:29:03] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:29:03] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:29:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17270738673944101480.gal : 3 ms
[2026-05-27 13:29:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11464262731985181797.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/CTLFireability17270738673944101480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11464262731985181797.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,8.9161e+12,1.85519,49884,2,6456,5,333491,6,0,898,133893,0


Converting to forward existential form...Done !
original formula: AG((AG(((p50==0)||(p146==0))) + EG(EX((p44==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(EX((p44==1))))),TRUE) * !(((p50==0)||(p146==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,6.81666,153608,1,0,13,1.04557e+06,20,4,4863,315294,11
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:29:10] [INFO ] Invariant cache hit.
[2026-05-27 13:29:10] [INFO ] Implicit Places using invariants in 130 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:29:10] [INFO ] Flatten gal took : 4 ms
[2026-05-27 13:29:10] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:10] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:29:10] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:29:10] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13158710641958012736.gal : 2 ms
[2026-05-27 13:29:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1835125845873370889.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/CTLFireability13158710641958012736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1835125845873370889.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,8.9161e+12,1.00251,29516,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: EX(EF(EX(AX((((p83==1)&&(p108==1))&&(p145==1))))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(EX(!((((p83==1)&&(p108==1))&&(p145==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.2356,51388,1,0,6,320177,11,0,4283,87635,4
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 115 edges and 147 vertex of which 30 / 147 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 116 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 106 place count 116 transition count 164
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 107 place count 116 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 108 place count 115 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 115 transition count 163
Applied a total of 109 rules in 24 ms. Remains 115 /147 variables (removed 32) and now considering 163/314 (removed 151) transitions.
[2026-05-27 13:29:12] [INFO ] Flow matrix only has 154 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5885084307552597788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13736959623173972364.kers'
[2026-05-27 13:29:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5885084307552597788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13736959623173972364.kers]
Normalized transition count is 153 out of 154 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 153 rows 113 cols 321 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-27 13:29:12] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13736959623173972364.kers
Total runtime 1 ms.
[2026-05-27 13:29:12] [INFO ] Implicit Places using invariants in 112 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 114/147 places, 163/314 transitions.
Graph (trivial) has 144 edges and 114 vertex of which 54 / 114 are part of one of the 12 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 72 transition count 87
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 58 transition count 87
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 58 transition count 75
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 46 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 46 transition count 65
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 36 transition count 55
Applied a total of 83 rules in 9 ms. Remains 36 /114 variables (removed 78) and now considering 55/163 (removed 108) transitions.
[2026-05-27 13:29:12] [INFO ] Flow matrix only has 44 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-4690560691193184221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10236464267184565374.kers'
[2026-05-27 13:29:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4690560691193184221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10236464267184565374.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 43 rows 35 cols 101 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-27 13:29:12] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10236464267184565374.kers
Total runtime 1 ms.
[2026-05-27 13:29:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-27 13:29:12] [INFO ] Flow matrix only has 44 transitions (discarded 11 similar events)
[2026-05-27 13:29:12] [INFO ] Invariant cache hit.
[2026-05-27 13:29:12] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-27 13:29:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/147 places, 55/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 250 ms. Remains : 36/147 places, 55/314 transitions.
[2026-05-27 13:29:12] [INFO ] Flatten gal took : 1 ms
[2026-05-27 13:29:12] [INFO ] Flatten gal took : 1 ms
[2026-05-27 13:29:12] [INFO ] Input system was already deterministic with 55 transitions.
[2026-05-27 13:29:12] [INFO ] Flatten gal took : 1 ms
[2026-05-27 13:29:12] [INFO ] Flatten gal took : 1 ms
[2026-05-27 13:29:12] [INFO ] Time to serialize gal into /tmp/CTLFireability15639243624860210071.gal : 1 ms
[2026-05-27 13:29:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17381624121637856844.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/CTLFireability15639243624860210071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17381624121637856844.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,50177,0.009932,4100,2,136,5,714,6,0,187,469,0


Converting to forward existential form...Done !
original formula: EG(AG((((p84==0)||(p131==0))||(p145==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((p84==0)||(p131==0))||(p145==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.022445,4496,1,0,7,2625,21,0,919,896,8
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (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-9998940182391334641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12963647968891710151.kers'
[2026-05-27 13:29:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9998940182391334641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12963647968891710151.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 314 rows 145 cols 881 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 13:29:12] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12963647968891710151.kers
Total runtime 2 ms.
[2026-05-27 13:29:13] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-27 13:29:13] [INFO ] Invariant cache hit.
[2026-05-27 13:29:13] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:29:13] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:29:13] [INFO ] Flatten gal took : 7 ms
[2026-05-27 13:29:13] [INFO ] Flatten gal took : 9 ms
[2026-05-27 13:29:13] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:29:13] [INFO ] Flatten gal took : 9 ms
[2026-05-27 13:29:13] [INFO ] Flatten gal took : 9 ms
[2026-05-27 13:29:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14995473397634880972.gal : 3 ms
[2026-05-27 13:29:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9042558995227327406.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/CTLFireability14995473397634880972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9042558995227327406.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,8.9161e+12,3.58709,69496,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: AG(!(E((((!((AX((p95==1)) + AX((p108==1)))) + ((((p136==1)&&(p146==1))||(((p48==1)&&(p95==1))&&(p145==1))) * AX((((p11==1)&&(p120==1))&&(...385
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,TRUE),(((!((!(EX(!((p95==1)))) + !(EX(!((p108==1)))))) + ((((p136==1)&&(p146==1))||(((p48...468
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,5.54423,73140,1,0,10,490380,17,2,4647,219239,7
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Graph (trivial) has 112 edges and 147 vertex of which 27 / 147 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 119 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 0 with 87 rules applied. Total rules applied 108 place count 119 transition count 171
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 110 place count 119 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 117 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 117 transition count 169
Applied a total of 114 rules in 39 ms. Remains 117 /147 variables (removed 30) and now considering 169/314 (removed 145) transitions.
[2026-05-27 13:29:19] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2946173492424211422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14472824729494174000.kers'
[2026-05-27 13:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2946173492424211422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14472824729494174000.kers]
Normalized transition count is 160 out of 161 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 160 rows 115 cols 343 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-27 13:29:19] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14472824729494174000.kers
Total runtime 3 ms.
[2026-05-27 13:29:19] [INFO ] Implicit Places using invariants in 191 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 116/147 places, 169/314 transitions.
Graph (trivial) has 144 edges and 116 vertex of which 51 / 116 are part of one of the 12 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 77 transition count 97
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 62 transition count 97
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 62 transition count 85
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 55 place count 50 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 50 transition count 76
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 82 place count 41 transition count 67
Applied a total of 82 rules in 14 ms. Remains 41 /116 variables (removed 75) and now considering 67/169 (removed 102) transitions.
[2026-05-27 13:29:19] [INFO ] Flow matrix only has 56 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-6050058604759021675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6087651141554980512.kers'
[2026-05-27 13:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6050058604759021675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6087651141554980512.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 40 cols 133 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-27 13:29:19] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6087651141554980512.kers
Total runtime 1 ms.
[2026-05-27 13:29:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-27 13:29:19] [INFO ] Flow matrix only has 56 transitions (discarded 11 similar events)
[2026-05-27 13:29:19] [INFO ] Invariant cache hit.
[2026-05-27 13:29:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-27 13:29:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/147 places, 67/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 405 ms. Remains : 41/147 places, 67/314 transitions.
[2026-05-27 13:29:19] [INFO ] Flatten gal took : 1 ms
[2026-05-27 13:29:19] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:29:19] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-27 13:29:19] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:29:19] [INFO ] Flatten gal took : 2 ms
[2026-05-27 13:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17742017020573862132.gal : 1 ms
[2026-05-27 13:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11433547865954663225.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/CTLFireability17742017020573862132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11433547865954663225.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,175617,0.022843,4220,2,194,5,1296,6,0,219,885,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(((p72==0) + AF((((p96==0)||(p107==0))||(p145==0)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((p72==0) + !(EG(!((((p96==0)||(p107==0))||(p145==0))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.065726,5036,1,0,11,5711,28,3,1084,2431,10
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-13 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 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (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-6317629687175899694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3785366645980561453.kers'
[2026-05-27 13:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6317629687175899694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3785366645980561453.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 314 rows 145 cols 881 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 13:29:19] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3785366645980561453.kers
Total runtime 3 ms.
[2026-05-27 13:29:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-27 13:29:19] [INFO ] Invariant cache hit.
[2026-05-27 13:29:20] [INFO ] State equation strengthened by 193 read => feed constraints.
[2026-05-27 13:29:20] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 147/147 places, 314/314 transitions.
[2026-05-27 13:29:20] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:20] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:20] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:29:20] [INFO ] Flatten gal took : 6 ms
[2026-05-27 13:29:20] [INFO ] Flatten gal took : 7 ms
[2026-05-27 13:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1660690440768256539.gal : 2 ms
[2026-05-27 13:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability299974343033473279.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/CTLFireability1660690440768256539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability299974343033473279.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,8.9161e+12,2.85207,70572,2,4613,5,358941,6,0,900,219239,0


Converting to forward existential form...Done !
original formula: EX(EG((((p12==1)&&(p23==1)) * ((p145==1) * (EG((((p28==1)&&(p146==1))&&(p113==1))) + EF(((p54==1)&&(p145==1))))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((p12==1)&&(p23==1)) * ((p145==1) * (EG((((p28==1)&&(p146==1))&&(p113==1))) + E(TRUE U ((p54==1)...182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.9602,87820,1,0,10,543331,29,4,5025,219239,13
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-27 13:29:25] [INFO ] Invariant cache hit.
[2026-05-27 13:29:25] [INFO ] Implicit Places using invariants in 154 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 146/147 places, 314/314 transitions.
[2026-05-27 13:29:25] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:25] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:25] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-27 13:29:25] [INFO ] Flatten gal took : 9 ms
[2026-05-27 13:29:25] [INFO ] Flatten gal took : 8 ms
[2026-05-27 13:29:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11347211497181277663.gal : 3 ms
[2026-05-27 13:29:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8877234054089678937.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/CTLFireability11347211497181277663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8877234054089678937.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,8.9161e+12,1.23334,29572,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(AF((((p24==0)||(p131==0))||(p145==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(EG(!((((p24==0)||(p131==0))||(p145==0))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.38139,69388,1,0,10,436259,19,2,4621,150058,9
FORMULA FlexibleBarrier-PT-12a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-27 13:29:28] [INFO ] Flatten gal took : 5 ms
[2026-05-27 13:29:28] [INFO ] Flatten gal took : 5 ms
Total runtime 230621 ms.

BK_STOP 1779888568944

--------------------
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-12a"
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-12a, 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-177955809100370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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