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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K Mar 7 06:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 06:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 06:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 06:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 06:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 06:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 06:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 7 06:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 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 41K 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-06a-CTLCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779868524284

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-27 07:55:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 07:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 07:55:27] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-27 07:55:27] [INFO ] Transformed 75 places.
[2026-05-27 07:55:27] [INFO ] Transformed 154 transitions.
[2026-05-27 07:55:27] [INFO ] Found NUPN structural information;
[2026-05-27 07:55:27] [INFO ] Parsed PT model containing 75 places and 154 transitions and 599 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 67 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 128/128 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 75 transition count 122
Applied a total of 6 rules in 38 ms. Remains 75 /75 variables (removed 0) and now considering 122/128 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16471282394208405590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12763570739561701982.kers'
[2026-05-27 07:55:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16471282394208405590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12763570739561701982.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:55:27] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12763570739561701982.kers
Total runtime 2 ms.
[2026-05-27 07:55:27] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-27 07:55:27] [INFO ] Invariant cache hit.
[2026-05-27 07:55:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-27 07:55:27] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-27 07:55:27] [INFO ] Invariant cache hit.
[2026-05-27 07:55:27] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 219 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8346 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 121/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 340 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7477 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15981ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 16006ms
Starting structural reductions in LTL mode, iteration 1 : 75/75 places, 122/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16647 ms. Remains : 75/75 places, 122/128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:43] [INFO ] Invariant cache hit.
[2026-05-27 07:55:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-27 07:55:43] [INFO ] Invariant cache hit.
[2026-05-27 07:55:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-27 07:55:44] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 75/75 places, 122/122 transitions.
Support contains 67 out of 75 places after structural reductions.
[2026-05-27 07:55:44] [INFO ] Flatten gal took : 70 ms
[2026-05-27 07:55:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-27 07:55:44] [INFO ] Flatten gal took : 28 ms
[2026-05-27 07:55:44] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 61 out of 75 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 60 to 58
RANDOM walk for 40000 steps (8 resets) in 1709 ms. (23 steps per ms) remains 3/58 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
[2026-05-27 07:55:45] [INFO ] Invariant cache hit.
[2026-05-27 07:55:45] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp57 is UNSAT
After SMT solving in domain Real declared 26/197 variables, and 10 constraints, problems are : Problem set: 3 solved, 0 unsolved in 61 ms.
Refiners :[Domain max(s): 7/75 constraints, Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 0/75 constraints, ReadFeed: 0/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2026-05-27 07:55:45] [INFO ] Flatten gal took : 10 ms
[2026-05-27 07:55:45] [INFO ] Flatten gal took : 12 ms
[2026-05-27 07:55:45] [INFO ] Input system was already deterministic with 122 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:45] [INFO ] Invariant cache hit.
[2026-05-27 07:55:46] [INFO ] Implicit Places using invariants in 109 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 74/75 places, 122/122 transitions.
[2026-05-27 07:55:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 07:55:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 07:55:46] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:46] [INFO ] Flatten gal took : 13 ms
[2026-05-27 07:55:46] [INFO ] Flatten gal took : 12 ms
[2026-05-27 07:55:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality17232248917665697935.gal : 6 ms
[2026-05-27 07:55:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8569754198645022606.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/CTLCardinality17232248917665697935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8569754198645022606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((EX((p73==1)) + AF(((p25==0)||(p41==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(EX((p73==1)))),!(((p25==0)||(p41==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.225033,6752,1,0,7,15934,20,0,1927,5176,8
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:46] [INFO ] Invariant cache hit.
[2026-05-27 07:55:47] [INFO ] Implicit Places using invariants in 1085 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1093 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:47] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality600571633402414559.gal : 2 ms
[2026-05-27 07:55:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality12776461847410091526.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/CTLCardinality600571633402414559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12776461847410091526.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98598e+06,0.02425,4496,2,312,5,2193,6,0,416,1419,0


Converting to forward existential form...Done !
original formula: EF(EX((((p50!=0) * A(((p53==0)||(p64==1)) U (p1==0))) * EF((p39==1)))))
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,TRUE)) * ((p50!=0) * !((E(!((p1==0)) U (!(((p53==0)||(p64==1))) * !((p1==0)))) + EG(!((p1==...191
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 119/0/3
(forward)formula 0,1,0.096576,6716,1,0,13,15220,27,4,2061,5740,15
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:47] [INFO ] Invariant cache hit.
[2026-05-27 07:55:47] [INFO ] Implicit Places using invariants in 129 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 131 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:47] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:47] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11167174748106587107.gal : 3 ms
[2026-05-27 07:55:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9092324637497565621.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/CTLCardinality11167174748106587107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9092324637497565621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AG(!(A(EF(((p32==0)||(p9==1))) U ((p40==1)&&(p71==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(!((E(!(((p40==1)&&(p71==0))) U (!(E(TRUE U ((p32==0)||(p9==1)))) * !(((p40==1)&&(p71...210
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.1468,6536,1,0,9,13967,24,2,1927,4347,13
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:48] [INFO ] Invariant cache hit.
[2026-05-27 07:55:48] [INFO ] Implicit Places using invariants in 207 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 217 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:48] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 16 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6161186465187407797.gal : 3 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality381233333565716332.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/CTLCardinality6161186465187407797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality381233333565716332.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98598e+06,0.040932,4492,2,312,5,2193,6,0,416,1419,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(EF(((p14==0)||(p42==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(E(TRUE U ((p14==0)||(p42==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.128264,6176,1,0,7,12261,20,0,1919,3131,8
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 57 edges and 75 vertex of which 18 / 75 are part of one of the 6 SCC in 4 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 78 edges and 60 vertex of which 51 / 60 are part of one of the 7 SCC in 1 ms
Free SCC test removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 98
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 90 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 10 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 10 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 9 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 9 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 8 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 101 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 105 place count 6 transition count 8
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 106 place count 5 transition count 7
Iterating global reduction 5 with 1 rules applied. Total rules applied 107 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 108 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 110 place count 4 transition count 5
Applied a total of 110 rules in 49 ms. Remains 4 /75 variables (removed 71) and now considering 5/122 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13703831069071655635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8421990530389163070.kers'
[2026-05-27 07:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13703831069071655635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8421990530389163070.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-27 07:55:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8421990530389163070.kers
Total runtime 0 ms.
[2026-05-27 07:55:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-27 07:55:48] [INFO ] Invariant cache hit.
[2026-05-27 07:55:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2026-05-27 07:55:48] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-27 07:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/75 places, 5/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 251 ms. Remains : 4/75 places, 5/122 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 3 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:48] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14083572247645061242.gal : 0 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3603901276200686456.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/CTLCardinality14083572247645061242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3603901276200686456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.003311,3744,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((p17==1))) + (p39==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p39==1))) * !(EG(E(TRUE U (p17==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005125,4020,1,0,6,45,14,0,82,19,8
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (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-4920667051100960335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13456498346811511450.kers'
[2026-05-27 07:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4920667051100960335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13456498346811511450.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:55:48] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13456498346811511450.kers
Total runtime 1 ms.
[2026-05-27 07:55:48] [INFO ] Implicit Places using invariants in 118 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 74/75 places, 122/122 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 10 ms
[2026-05-27 07:55:48] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 10 ms
[2026-05-27 07:55:48] [INFO ] Flatten gal took : 10 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13319514675362000473.gal : 2 ms
[2026-05-27 07:55:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality7891410310143070322.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/CTLCardinality13319514675362000473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7891410310143070322.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF((EG(AG((p23==0))) + (((((p62==0)&&(p74==1)) + AF((p74==0))) * AF(((p61==0)&&(p20==1)))) * (((p11==0)||(p65==1))||((p35==0)||(p26==1))...267
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (EG(!(E(TRUE U !((p23==0))))) + (((((p62==0)&&(p74==1)) + !(EG(!((p74==0))))) * !(EG(!(((p6...382
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.235637,7984,1,0,8,23204,14,3,1990,10088,7
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:49] [INFO ] Invariant cache hit.
[2026-05-27 07:55:49] [INFO ] Implicit Places using invariants in 137 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 74/75 places, 122/122 transitions.
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 17 ms
[2026-05-27 07:55:49] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13960093217721276737.gal : 3 ms
[2026-05-27 07:55:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality8709091628024292580.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/CTLCardinality13960093217721276737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8709091628024292580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(!(E(((AX(((p60==0)||(p43==1))) + (p44==0)) + ((p37==1)||(p73==0))) U (p49!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((!(EX(!(((p60==0)||(p43==1))))) + (p44==0)) + ((p37==1)||(p73==0))) U (p49!=1))))] != F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.142066,7020,1,0,12,16720,17,6,1807,5768,11
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:49] [INFO ] Invariant cache hit.
[2026-05-27 07:55:49] [INFO ] Implicit Places using invariants in 174 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 8 ms
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 9 ms
[2026-05-27 07:55:49] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:49] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality13246807335275852315.gal : 2 ms
[2026-05-27 07:55:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1504164829916513069.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/CTLCardinality13246807335275852315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1504164829916513069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG((EG((AG((p0==1)) * (p1==0))) * ((p19==1) + AF(EG(((p39==0)&&(p16==1))))))) + (EF(AG(AX((p0==0)))) * A((AX(!(AF(((p21==0)||(p34==1))))...259
=> equivalent forward existential formula: ([FwdG(Init,(EG((!(E(TRUE U !((p0==1)))) * (p1==0))) * ((p19==1) + !(EG(!(EG(((p39==0)&&(p16==1)))))))))] != FAL...588
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.173706,7380,1,0,16,18392,45,5,2067,7496,24
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 59 edges and 75 vertex of which 18 / 75 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 80 edges and 60 vertex of which 52 / 60 are part of one of the 6 SCC in 1 ms
Free SCC test removed 46 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 14 transition count 98
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 96 place count 8 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 7 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 5 transition count 7
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 5 transition count 7
Applied a total of 104 rules in 8 ms. Remains 5 /75 variables (removed 70) and now considering 7/122 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2466949708745045366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11815294064951576400.kers'
[2026-05-27 07:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2466949708745045366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11815294064951576400.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 5 cols 12 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-27 07:55:50] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11815294064951576400.kers
Total runtime 0 ms.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-27 07:55:50] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/75 places, 7/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 295 ms. Remains : 5/75 places, 7/122 transitions.
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9837510727422571065.gal : 0 ms
[2026-05-27 07:55:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18055990608261828240.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/CTLCardinality9837510727422571065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18055990608261828240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5,0.003509,3752,2,10,5,38,5,0,28,24,0


Converting to forward existential form...Done !
original formula: AG(EF(((p42==0)||(p45==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p42==0)||(p45==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005509,4036,1,0,6,84,12,0,109,49,5
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 53 edges and 75 vertex of which 18 / 75 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.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 71 edges and 60 vertex of which 45 / 60 are part of one of the 7 SCC in 0 ms
Free SCC test removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 22 transition count 97
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 74 place count 18 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 16 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 15 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 92 place count 15 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 95 place count 15 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 98 place count 12 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 98 place count 12 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 102 place count 10 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 10 transition count 13
Applied a total of 103 rules in 13 ms. Remains 10 /75 variables (removed 65) and now considering 13/122 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12811047572659304331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5504664925427558304.kers'
[2026-05-27 07:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12811047572659304331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5504664925427558304.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 7 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-27 07:55:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5504664925427558304.kers
Total runtime 1 ms.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-27 07:55:50] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 4/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/22 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 197 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 4/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 12/22 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 32 constraints, problems are : Problem set: 0 solved, 8 unsolved in 180 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/75 places, 13/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 472 ms. Remains : 10/75 places, 13/122 transitions.
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality13460446481806934447.gal : 1 ms
[2026-05-27 07:55:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality15682967364462194158.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/CTLCardinality13460446481806934447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15682967364462194158.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,32,0.005882,3796,2,17,5,70,5,0,54,44,0


Converting to forward existential form...Done !
original formula: !(E(EF(((E((p19==0) U (p32==1)) * (p4==1)) * (p50==1))) U (p31==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((E((p19==0) U (p32==1)) * (p4==1)) * (p50==1)))) * (p31==1))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/3
(forward)formula 0,0,0.012312,4084,1,0,14,275,23,3,237,163,13
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-10 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 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (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-2770034206615202912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17580537621587599582.kers'
[2026-05-27 07:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2770034206615202912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17580537621587599582.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:55:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17580537621587599582.kers
Total runtime 1 ms.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants in 151 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:50] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:51] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5163890241736794503.gal : 2 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11249055679752609082.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/CTLCardinality5163890241736794503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11249055679752609082.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EF(EX(((p54!=0)&&(p28!=1)))) + (A(E((((p56==0)||(p44==1))&&((p52==0)||(p41==1))) U AF((p7==0))) U ((EX(((p0==0)||(p45==1))) * ((p56==...233
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((!((E(!(((EX(((p0==0)||(p45==1))) * ((p56==0)||(p6==1))) + !((((p5==0)||(p29==1))||(p51==...503
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.125854,6200,1,0,7,13573,14,0,1820,3140,6
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-11 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 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:51] [INFO ] Invariant cache hit.
[2026-05-27 07:55:51] [INFO ] Implicit Places using invariants in 110 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 74/75 places, 122/122 transitions.
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 11 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:51] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 7 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5073587961675415920.gal : 2 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4995090626981296155.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/CTLCardinality5073587961675415920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4995090626981296155.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98598e+06,0.08482,5424,2,330,5,8064,6,0,418,4789,0


Converting to forward existential form...Done !
original formula: E(EF(EX(((p29==0)||(p39==1)))) U A(EX(AG(((p74==1)&&(p63==1)))) U ((!(EX(((p68==0)||(p36==1)))) * !(EF((p65==1)))) * (AF(((p53==0)||(p49=...212
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U EX(((p29==0)||(p39==1))))) * !(EG(!(((!(EX(((p68==0)||(p36==1)))) * !(E(TRUE U (p65==1))))...596
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.194388,7088,1,0,12,15016,28,2,2045,5064,16
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 58 edges and 75 vertex of which 18 / 75 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 77 edges and 60 vertex of which 56 / 60 are part of one of the 8 SCC in 0 ms
Free SCC test removed 48 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 99
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 87 place count 9 transition count 19
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 96 place count 9 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 6 transition count 7
Applied a total of 102 rules in 12 ms. Remains 6 /75 variables (removed 69) and now considering 7/122 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11243651109515937403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1011840682638248033.kers'
[2026-05-27 07:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11243651109515937403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1011840682638248033.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-27 07:55:51] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1011840682638248033.kers
Total runtime 1 ms.
[2026-05-27 07:55:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-27 07:55:51] [INFO ] Invariant cache hit.
[2026-05-27 07:55:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-27 07:55:51] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-27 07:55:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 15 constraints, problems are : Problem set: 0 solved, 3 unsolved in 83 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 18 constraints, problems are : Problem set: 0 solved, 3 unsolved in 81 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 172ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/75 places, 7/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 254 ms. Remains : 6/75 places, 7/122 transitions.
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:51] [INFO ] Input system was already deterministic with 7 transitions.
RANDOM walk for 34 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 1 ms
[2026-05-27 07:55:51] [INFO ] Flatten gal took : 0 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14032041746610142392.gal : 0 ms
[2026-05-27 07:55:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3994977295971371300.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14032041746610142392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3994977295971371300.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (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-5333154666703992457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12696318042036680069.kers'
[2026-05-27 07:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5333154666703992457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12696318042036680069.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 73 cols 299 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-27 07:55:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12696318042036680069.kers
Total runtime 1 ms.
[2026-05-27 07:55:52] [INFO ] Implicit Places using invariants in 182 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:55:52] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4899529412424034738.gal : 1 ms
[2026-05-27 07:55:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1676860731696452943.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/CTLCardinality4899529412424034738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1676860731696452943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98598e+06,0.039645,4492,2,312,5,2193,6,0,416,1419,0


Converting to forward existential form...Done !
original formula: E((AF(((p28==1)||(p63==1))) + (!(AG(!(((p67==1)&&(p59==0))))) * (((AX(EG((p51==1))) + EF((p12==1))) + (A(((p56==1)||(p72==1)) U EX((p58==...222
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(((p28==1)||(p63==1))))) + (!(!(E(TRUE U !(!(((p67==1)&&(p59==0))))))) * (((!(EX(!(EG((p51==1...351
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.185277,7376,1,0,27,18109,44,14,2196,9003,32
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-27 07:55:52] [INFO ] Invariant cache hit.
[2026-05-27 07:55:52] [INFO ] Implicit Places using invariants in 177 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 73/75 places, 122/122 transitions.
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 5 ms
[2026-05-27 07:55:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality4252192437814504154.gal : 1 ms
[2026-05-27 07:55:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15276151221809436292.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/CTLCardinality4252192437814504154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15276151221809436292.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AG((p0==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p0==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.117176,5944,1,0,7,11922,15,2,1915,2269,6
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 6 ms
[2026-05-27 07:55:52] [INFO ] Flatten gal took : 6 ms
Total runtime 26041 ms.

BK_STOP 1779868552827

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-06a"
export BK_EXAMINATION="CTLCardinality"
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-06a, examination is CTLCardinality"
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-177955809000321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;