About the Execution of ITS-Tools for FlexibleBarrier-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1180829.00 | 0.00 | 0.00 | TFFFFTTTTTTTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700530.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-20a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700530
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 321K May 29 14:32 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-20a-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2023-15
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-20a-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748977887953
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 19:11:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 19:11:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 19:11:31] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2025-06-03 19:11:31] [INFO ] Transformed 243 places.
[2025-06-03 19:11:31] [INFO ] Transformed 1064 transitions.
[2025-06-03 19:11:31] [INFO ] Found NUPN structural information;
[2025-06-03 19:11:31] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 535 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
Support contains 85 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 118 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
// Phase 1: matrix 682 rows 243 cols
[2025-06-03 19:11:31] [INFO ] Computed 22 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:11:32] [INFO ] Implicit Places using invariants in 685 ms returned []
[2025-06-03 19:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:11:32] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:11:33] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:11:33] [INFO ] Invariant cache hit.
[2025-06-03 19:11:33] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30078 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30132 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61367ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 61413ms
Starting structural reductions in LTL mode, iteration 1 : 243/243 places, 682/702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63542 ms. Remains : 243/243 places, 682/702 transitions.
Support contains 85 out of 243 places after structural reductions.
[2025-06-03 19:12:35] [INFO ] Flatten gal took : 158 ms
[2025-06-03 19:12:35] [INFO ] Flatten gal took : 95 ms
[2025-06-03 19:12:35] [INFO ] Input system was already deterministic with 682 transitions.
Support contains 81 out of 243 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2381 ms. (16 steps per ms) remains 1/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2025-06-03 19:12:36] [INFO ] Invariant cache hit.
[2025-06-03 19:12:36] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 193/243 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 193/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/925 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 925/925 variables, and 989 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 193/243 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 193/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/925 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/925 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 925/925 variables, and 990 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 11 ms.
[2025-06-03 19:12:37] [INFO ] Flatten gal took : 65 ms
[2025-06-03 19:12:38] [INFO ] Flatten gal took : 62 ms
[2025-06-03 19:12:38] [INFO ] Input system was already deterministic with 682 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 31 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 19:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:12:38] [INFO ] Implicit Places using invariants in 345 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 242/243 places, 682/682 transitions.
[2025-06-03 19:12:38] [INFO ] Flatten gal took : 45 ms
[2025-06-03 19:12:38] [INFO ] Flatten gal took : 49 ms
[2025-06-03 19:12:38] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:12:38] [INFO ] Flatten gal took : 43 ms
[2025-06-03 19:12:38] [INFO ] Flatten gal took : 43 ms
[2025-06-03 19:12:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5851279153382453234.gal : 41 ms
[2025-06-03 19:12:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4315245340262141732.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5851279153382453234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4315245340262141732.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:13:09] [INFO ] Flatten gal took : 39 ms
[2025-06-03 19:13:09] [INFO ] Applying decomposition
[2025-06-03 19:13:09] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2079800180165177545.txt' '-o' '/tmp/graph2079800180165177545.bin' '-w' '/tmp/graph2079800180165177545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2079800180165177545.bin' '-l' '-1' '-v' '-w' '/tmp/graph2079800180165177545.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:13:09] [INFO ] Decomposing Gal with order
[2025-06-03 19:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:13:09] [INFO ] Removed a total of 1063 redundant transitions.
[2025-06-03 19:13:09] [INFO ] Flatten gal took : 135 ms
[2025-06-03 19:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 19 ms.
[2025-06-03 19:13:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8102692925473561557.gal : 14 ms
[2025-06-03 19:13:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7874439078311004233.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8102692925473561557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7874439078311004233.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,3.83376e+21,0.133694,7048,153,19,5386,332,683,6195,44,500,0
Converting to forward existential form...Done !
original formula: EF(((AG(((((i1.u4.p11==0)||(i2.u8.p24==0))||(i1.u4.p241==0))&&(((i13.u63.p155==0)||(i19.u93.p228==0))||(i1.u4.p241==0)))) * AX((((i2.u8.p...499
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(E(TRUE U !(((((i1.u4.p11==0)||(i2.u8.p24==0))||(i1.u4.p241==0))&&(((i13.u63.p155==0)||(...886
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,0.241933,7688,1,0,5386,332,3391,6890,176,500,10526
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 19:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:13:10] [INFO ] Implicit Places using invariants in 248 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 242/243 places, 682/682 transitions.
[2025-06-03 19:13:10] [INFO ] Flatten gal took : 22 ms
[2025-06-03 19:13:10] [INFO ] Flatten gal took : 22 ms
[2025-06-03 19:13:10] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:13:10] [INFO ] Flatten gal took : 20 ms
[2025-06-03 19:13:10] [INFO ] Flatten gal took : 21 ms
[2025-06-03 19:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13214803884149955977.gal : 5 ms
[2025-06-03 19:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17580441312625758551.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13214803884149955977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17580441312625758551.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:13:40] [INFO ] Flatten gal took : 34 ms
[2025-06-03 19:13:40] [INFO ] Applying decomposition
[2025-06-03 19:13:40] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15074888468639456508.txt' '-o' '/tmp/graph15074888468639456508.bin' '-w' '/tmp/graph15074888468639456508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15074888468639456508.bin' '-l' '-1' '-v' '-w' '/tmp/graph15074888468639456508.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:13:40] [INFO ] Decomposing Gal with order
[2025-06-03 19:13:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:13:40] [INFO ] Removed a total of 1062 redundant transitions.
[2025-06-03 19:13:40] [INFO ] Flatten gal took : 77 ms
[2025-06-03 19:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-03 19:13:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11092439697900434423.gal : 10 ms
[2025-06-03 19:13:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14721817766976972840.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11092439697900434423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14721817766976972840.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83376e+21,0.386695,12000,220,19,18516,298,678,19240,44,398,0
Converting to forward existential form...Done !
original formula: EF(EG(AX((((i6.u28.p72==0)||(i18.u87.p215==0))||(i1.u3.p241==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((((i6.u28.p72==0)||(i18.u87.p215==0))||(i1.u3.p241==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,0.582765,12256,1,0,18516,298,2755,34778,149,398,16854
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 19:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:13:41] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-03 19:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:13:42] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:13:42] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:13:42] [INFO ] Invariant cache hit.
[2025-06-03 19:13:42] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30038 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30024 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60578ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in LTL mode , in 1 iterations and 61686 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:14:43] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:14:43] [INFO ] Flatten gal took : 15 ms
[2025-06-03 19:14:43] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:14:43] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:14:43] [INFO ] Flatten gal took : 15 ms
[2025-06-03 19:14:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10469793835162162366.gal : 4 ms
[2025-06-03 19:14:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17147645418342973920.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10469793835162162366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17147645418342973920.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:15:13] [INFO ] Flatten gal took : 19 ms
[2025-06-03 19:15:13] [INFO ] Applying decomposition
[2025-06-03 19:15:13] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph645071075356964712.txt' '-o' '/tmp/graph645071075356964712.bin' '-w' '/tmp/graph645071075356964712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph645071075356964712.bin' '-l' '-1' '-v' '-w' '/tmp/graph645071075356964712.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:15:13] [INFO ] Decomposing Gal with order
[2025-06-03 19:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:15:13] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:15:13] [INFO ] Flatten gal took : 73 ms
[2025-06-03 19:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 29 ms.
[2025-06-03 19:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8498039118134666015.gal : 8 ms
[2025-06-03 19:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6667970265803659888.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8498039118134666015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6667970265803659888.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,3.83376e+21,0.284893,9236,160,23,11298,422,763,12553,57,643,0
Converting to forward existential form...Done !
original formula: E(((!((((i14.u41.p167==1)&&(i15.u44.p180==1))&&(i1.u2.p241==1))) * !(((((i4.u11.p47==1)&&(i10.u29.p120==1))&&(i1.u2.p241==1)) + AF(((((i1...851
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!((((i14.u41.p167==1)&&(i15.u44.p180==1))&&(i1.u2.p241==1))) * !(((((i4.u11.p47==1)&&(i10.u29...916
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 153 edges and 243 vertex of which 21 / 243 are part of one of the 7 SCC in 5 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 216 transition count 640
Drop transitions (Redundant composition of simpler transitions.) removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 0 with 160 rules applied. Total rules applied 187 place count 216 transition count 480
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 195 place count 216 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 202 place count 209 transition count 473
Iterating global reduction 0 with 7 rules applied. Total rules applied 209 place count 209 transition count 473
Applied a total of 209 rules in 152 ms. Remains 209 /243 variables (removed 34) and now considering 473/682 (removed 209) transitions.
[2025-06-03 19:15:43] [INFO ] Flow matrix only has 442 transitions (discarded 31 similar events)
// Phase 1: matrix 442 rows 209 cols
[2025-06-03 19:15:43] [INFO ] Computed 22 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:15:44] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-03 19:15:44] [INFO ] Flow matrix only has 442 transitions (discarded 31 similar events)
[2025-06-03 19:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:15:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-06-03 19:15:44] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:15:44] [INFO ] Redundant transitions in 37 ms returned []
Running 472 sub problems to find dead transitions.
[2025-06-03 19:15:44] [INFO ] Flow matrix only has 442 transitions (discarded 31 similar events)
[2025-06-03 19:15:44] [INFO ] Invariant cache hit.
[2025-06-03 19:15:44] [INFO ] State equation strengthened by 283 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 441/650 variables, 209/231 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 282/513 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/651 variables, and 513 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 209/209 constraints, ReadFeed: 282/283 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (OVERLAPS) 441/650 variables, 209/231 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 282/513 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 472/985 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 985 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 209/209 constraints, ReadFeed: 282/283 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in SI_CTL mode, iteration 1 : 209/243 places, 473/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61146 ms. Remains : 209/243 places, 473/682 transitions.
[2025-06-03 19:16:44] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:16:45] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:16:45] [INFO ] Input system was already deterministic with 473 transitions.
[2025-06-03 19:16:45] [INFO ] Flatten gal took : 15 ms
[2025-06-03 19:16:45] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:16:45] [INFO ] Time to serialize gal into /tmp/CTLFireability640352499713280590.gal : 4 ms
[2025-06-03 19:16:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8727229706460338622.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability640352499713280590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8727229706460338622.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:17:15] [INFO ] Flatten gal took : 15 ms
[2025-06-03 19:17:15] [INFO ] Applying decomposition
[2025-06-03 19:17:15] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4379568740868772871.txt' '-o' '/tmp/graph4379568740868772871.bin' '-w' '/tmp/graph4379568740868772871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4379568740868772871.bin' '-l' '-1' '-v' '-w' '/tmp/graph4379568740868772871.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:17:15] [INFO ] Decomposing Gal with order
[2025-06-03 19:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:17:15] [INFO ] Removed a total of 637 redundant transitions.
[2025-06-03 19:17:15] [INFO ] Flatten gal took : 28 ms
[2025-06-03 19:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 11 ms.
[2025-06-03 19:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1387618727132452346.gal : 4 ms
[2025-06-03 19:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3123637726107469043.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1387618727132452346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3123637726107469043.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65121e+20,0.159375,8228,128,21,8271,407,664,12859,57,865,0
Converting to forward existential form...Done !
original formula: !(E(!(A(((E((((i0.u2.p12==1)&&(i7.u23.p95==1))&&(i2.i0.u5.p241==1)) U ((i10.u35.p143==1)&&(i2.i0.u5.p241==1))) + (((i2.i0.u5.p24==1)&&(i1...800
=> equivalent forward existential formula: ([(FwdU(FwdU(FwdU(Init,!(!((E(!(E(TRUE U (((i2.i1.u38.p156==1)&&(i15.u53.p215==1))&&((i2.i0.u5.p241==1)&&(i0.u0....1932
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,0.244065,8484,1,0,8271,407,2916,12859,242,865,7770
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 197 edges and 243 vertex of which 57 / 243 are part of one of the 19 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 186 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 208 transitions
Redundant transition composition rules discarded 208 transitions
Iterating global reduction 0 with 208 rules applied. Total rules applied 247 place count 186 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 248 place count 186 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 249 place count 185 transition count 263
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 250 place count 185 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 251 place count 184 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 252 place count 184 transition count 262
Applied a total of 252 rules in 96 ms. Remains 184 /243 variables (removed 59) and now considering 262/682 (removed 420) transitions.
[2025-06-03 19:17:15] [INFO ] Flow matrix only has 244 transitions (discarded 18 similar events)
// Phase 1: matrix 244 rows 184 cols
[2025-06-03 19:17:15] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:17:15] [INFO ] Implicit Places using invariants in 305 ms returned [182, 183]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 307 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 182/243 places, 262/682 transitions.
Graph (trivial) has 258 edges and 182 vertex of which 176 / 182 are part of one of the 21 SCC in 1 ms
Free SCC test removed 155 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 30
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 25 transition count 29
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 24 place count 6 transition count 9
Iterating global reduction 3 with 19 rules applied. Total rules applied 43 place count 6 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 5 transition count 6
Applied a total of 47 rules in 14 ms. Remains 5 /182 variables (removed 177) and now considering 6/262 (removed 256) transitions.
[2025-06-03 19:17:15] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 5 cols
[2025-06-03 19:17:15] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:17:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 19:17:16] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 19:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:17:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:17:16] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 5/243 places, 6/682 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 479 ms. Remains : 5/243 places, 6/682 transitions.
[2025-06-03 19:17:16] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:17:16] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:17:16] [INFO ] Input system was already deterministic with 6 transitions.
[2025-06-03 19:17:16] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:17:16] [INFO ] Flatten gal took : 1 ms
[2025-06-03 19:17:16] [INFO ] Time to serialize gal into /tmp/CTLFireability496173074111148378.gal : 1 ms
[2025-06-03 19:17:16] [INFO ] Time to serialize properties into /tmp/CTLFireability157051191482180203.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability496173074111148378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability157051191482180203.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
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.00386,3660,2,10,5,34,6,0,24,20,0
Converting to forward existential form...Done !
original formula: AG(EF((p192==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p192==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.005722,3916,1,0,6,72,14,0,97,41,5
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 182 edges and 243 vertex of which 42 / 243 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 198 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 253 transitions
Redundant transition composition rules discarded 253 transitions
Iterating global reduction 0 with 253 rules applied. Total rules applied 288 place count 198 transition count 306
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 294 place count 198 transition count 306
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 297 place count 195 transition count 303
Iterating global reduction 0 with 3 rules applied. Total rules applied 300 place count 195 transition count 303
Applied a total of 300 rules in 60 ms. Remains 195 /243 variables (removed 48) and now considering 303/682 (removed 379) transitions.
[2025-06-03 19:17:16] [INFO ] Flow matrix only has 289 transitions (discarded 14 similar events)
// Phase 1: matrix 289 rows 195 cols
[2025-06-03 19:17:16] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:17:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-03 19:17:16] [INFO ] Flow matrix only has 289 transitions (discarded 14 similar events)
[2025-06-03 19:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:17:16] [INFO ] State equation strengthened by 153 read => feed constraints.
[2025-06-03 19:17:16] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:17:16] [INFO ] Redundant transitions in 3 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-03 19:17:16] [INFO ] Flow matrix only has 289 transitions (discarded 14 similar events)
[2025-06-03 19:17:16] [INFO ] Invariant cache hit.
[2025-06-03 19:17:16] [INFO ] State equation strengthened by 153 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 288/483 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 152/369 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/484 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 370 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 288/483 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 152/369 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 302/671 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/484 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 672 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in SI_CTL mode, iteration 1 : 195/243 places, 303/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60595 ms. Remains : 195/243 places, 303/682 transitions.
[2025-06-03 19:18:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 19:18:16] [INFO ] Flatten gal took : 6 ms
[2025-06-03 19:18:16] [INFO ] Input system was already deterministic with 303 transitions.
[2025-06-03 19:18:16] [INFO ] Flatten gal took : 5 ms
[2025-06-03 19:18:16] [INFO ] Flatten gal took : 6 ms
[2025-06-03 19:18:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8801665450066307016.gal : 1 ms
[2025-06-03 19:18:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10737117180499814932.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8801665450066307016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10737117180499814932.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.01927e+19,8.19735,150532,2,5298,5,1.01586e+06,6,0,1067,413449,0
Converting to forward existential form...Done !
original formula: E(!(E(!((((p71==1)&&(p168==1))&&(p241==1))) U AG(((!(((p84==1)&&(p191==1))&&(p241==1)))||(((p159==1)&&(p60==1))&&((p107==1)&&(p241==1))))...183
=> equivalent forward existential formula: [(FwdU(Init,!(E(!((((p71==1)&&(p168==1))&&(p241==1))) U !(E(TRUE U !(((!(((p84==1)&&(p191==1))&&(p241==1)))||(((...241
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,16.6823,220692,1,0,9,1.48909e+06,24,1,5438,502257,9
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 179 edges and 243 vertex of which 42 / 243 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 199 transition count 560
Drop transitions (Redundant composition of simpler transitions.) removed 240 transitions
Redundant transition composition rules discarded 240 transitions
Iterating global reduction 0 with 240 rules applied. Total rules applied 273 place count 199 transition count 320
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 277 place count 199 transition count 320
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 281 place count 195 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 285 place count 195 transition count 316
Applied a total of 285 rules in 88 ms. Remains 195 /243 variables (removed 48) and now considering 316/682 (removed 366) transitions.
[2025-06-03 19:18:33] [INFO ] Flow matrix only has 291 transitions (discarded 25 similar events)
// Phase 1: matrix 291 rows 195 cols
[2025-06-03 19:18:33] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:18:33] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-03 19:18:33] [INFO ] Flow matrix only has 291 transitions (discarded 25 similar events)
[2025-06-03 19:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:18:33] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-03 19:18:34] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:18:34] [INFO ] Redundant transitions in 2 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-03 19:18:34] [INFO ] Flow matrix only has 291 transitions (discarded 25 similar events)
[2025-06-03 19:18:34] [INFO ] Invariant cache hit.
[2025-06-03 19:18:34] [INFO ] State equation strengthened by 152 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 290/485 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 151/368 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 1/486 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 369 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 290/485 variables, 195/217 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 151/368 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 315/683 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/486 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 315 unsolved
(s29 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 684 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 195/195 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in SI_CTL mode, iteration 1 : 195/243 places, 316/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60788 ms. Remains : 195/243 places, 316/682 transitions.
[2025-06-03 19:19:34] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:19:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 19:19:34] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-03 19:19:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 19:19:34] [INFO ] Flatten gal took : 11 ms
[2025-06-03 19:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3567997933929767293.gal : 3 ms
[2025-06-03 19:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17135213130453196009.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3567997933929767293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17135213130453196009.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.05276e+19,19.4959,385140,2,14051,5,2.25161e+06,6,0,1080,1.16466e+06,0
Converting to forward existential form...Done !
original formula: EF((A((((p145==1)&&(p109==1)) * A((p60==1) U (((p23==1)&&(p72==1))&&(p241==1)))) U (AG((((p131==1)&&(p216==1))&&(p241==1))) * !((((p144==...211
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!((!(E(TRUE U !((((p131==1)&&(p216==1))&&(p241==1))))) * !((((p144==1)&&(p215==1))&&(...621
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 248/0/68
(forward)formula 0,1,24.678,385140,1,0,17,2.25161e+06,34,6,5646,1.16466e+06,18
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 198 edges and 243 vertex of which 60 / 243 are part of one of the 20 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 277 edges and 200 vertex of which 195 / 200 are part of one of the 21 SCC in 1 ms
Free SCC test removed 174 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 26 transition count 469
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 1 with 478 rules applied. Total rules applied 483 place count 6 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 486 place count 6 transition count 8
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 487 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 488 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 488 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 4 transition count 6
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 491 place count 3 transition count 5
Iterating global reduction 4 with 1 rules applied. Total rules applied 492 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 493 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 493 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 495 place count 2 transition count 3
Applied a total of 495 rules in 12 ms. Remains 2 /243 variables (removed 241) and now considering 3/682 (removed 679) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-06-03 19:19:59] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:19:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 19:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:19:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:19:59] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 19:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/243 places, 3/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 2/243 places, 3/682 transitions.
[2025-06-03 19:19:59] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:19:59] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:19:59] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 19:19:59] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:19:59] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:19:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8393099315862655707.gal : 0 ms
[2025-06-03 19:19:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2240882666620576025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8393099315862655707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2240882666620576025.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 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2025-06-03 19:19:59] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:19:59] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-03 19:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:19:59] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:20:00] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:20:00] [INFO ] Invariant cache hit.
[2025-06-03 19:20:00] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30026 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30018 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Finished structural reductions in LTL mode , in 1 iterations and 61490 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:21:00] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:21:00] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:21:00] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:21:00] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:21:00] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:21:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3377373076343668565.gal : 3 ms
[2025-06-03 19:21:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10355471511214818670.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3377373076343668565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10355471511214818670.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:21:30] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:21:30] [INFO ] Applying decomposition
[2025-06-03 19:21:31] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16071004085928309968.txt' '-o' '/tmp/graph16071004085928309968.bin' '-w' '/tmp/graph16071004085928309968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16071004085928309968.bin' '-l' '-1' '-v' '-w' '/tmp/graph16071004085928309968.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:21:31] [INFO ] Decomposing Gal with order
[2025-06-03 19:21:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:21:31] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:21:31] [INFO ] Flatten gal took : 57 ms
[2025-06-03 19:21:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 14 ms.
[2025-06-03 19:21:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4290828301126994287.gal : 6 ms
[2025-06-03 19:21:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16242499231720587397.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4290828301126994287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16242499231720587397.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83376e+21,0.228287,10316,153,23,13619,372,761,15162,57,601,0
Converting to forward existential form...Done !
original formula: AG(AF(((AF(((i18.u58.p233==0)||(i2.i1.u6.p242==0))) + (((i6.u20.p84==1)&&(i16.u53.p215==1))&&((i1.u5.p241==1)&&(((i6.u20.p84==0)||(i12.u4...398
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!(((i18.u58.p233==0)||(i2.i1.u6.p242==0))))) + (((i6.u20.p84==1)&&(i16.u53.p215==...462
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,0.317176,10572,1,0,13619,372,3171,15162,213,601,9523
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 156 edges and 243 vertex of which 24 / 243 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 214 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 187 transitions
Redundant transition composition rules discarded 187 transitions
Iterating global reduction 0 with 187 rules applied. Total rules applied 214 place count 214 transition count 445
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 223 place count 214 transition count 445
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 231 place count 206 transition count 437
Iterating global reduction 0 with 8 rules applied. Total rules applied 239 place count 206 transition count 437
Applied a total of 239 rules in 58 ms. Remains 206 /243 variables (removed 37) and now considering 437/682 (removed 245) transitions.
[2025-06-03 19:21:31] [INFO ] Flow matrix only has 412 transitions (discarded 25 similar events)
// Phase 1: matrix 412 rows 206 cols
[2025-06-03 19:21:31] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:21:31] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-03 19:21:31] [INFO ] Flow matrix only has 412 transitions (discarded 25 similar events)
[2025-06-03 19:21:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:21:31] [INFO ] State equation strengthened by 258 read => feed constraints.
[2025-06-03 19:21:32] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:21:32] [INFO ] Redundant transitions in 36 ms returned []
Running 436 sub problems to find dead transitions.
[2025-06-03 19:21:32] [INFO ] Flow matrix only has 412 transitions (discarded 25 similar events)
[2025-06-03 19:21:32] [INFO ] Invariant cache hit.
[2025-06-03 19:21:32] [INFO ] State equation strengthened by 258 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 411/617 variables, 206/228 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 257/485 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 0.0)
(t3 0.0)
(t4 1.0)
(t6 0.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 1.0)
(t13 1.0)
(t14 0.0)
(t15 0.0)
(t16 1.0)
(t17 0.0)
(t18 1.0)
(t19 1.0)
(t20 1.0)
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 1.0)
(t26 1.0)
(t27 0.0)
(t28 1.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 1.0)
(t33 0.0)
(t34 1.0)
(t35 1.0)
(t36 0.0)
(t37 0.0)
(t38 1.0)
(t39 0.0)
(t40 1.0)
(t41 1.0)
(t42 1.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 0.0)
(t47 1.0)
(t48 1.0)
(t49 1.0)
(t50 0.0)
(t51 0.0)
(t52 1.0)
(t53 1.0)
(t54 0.0)
(t55 0.0)
(t56 1.0)
(t57 0.0)
(t58 1.0)
(t59 1.0)
(t60 1.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 1.0)
(t65 0.0)
(t66 1.0)
(t67 1.0)
(t68 0.0)
(t69 0.0)
(t70 1.0)
(t71 1.0)
(t72 0.0)
(t73 0.0)
(t74 1.0)
(t75 0.0)
(t76 1.0)
(t77 2.0)
(t78 2.0)
(t79 0.0)
(t80 0.0)
(t81 1.0)
(t82 0.0)
(t83 2.0)
(t84 2.0)
(t85 2.0)
(t86 0.0)
(t87 0.0)
(t88 1.0)
(t89 1.0)
(t90 0.0)
(t91 0.0)
(t92 1.0)
(t93 0.0)
(t94 1.0)
(t95 1.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 1.0)
(t100 1.0)
(t101 1.0)
(t102 0.0)
(t103 0.0)
(t104 timeout
2.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/618 variables, and 485 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 206/206 constraints, ReadFeed: 257/258 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 411/617 variables, 206/228 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 257/485 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 436/921 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/618 variables, and 921 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 206/206 constraints, ReadFeed: 257/258 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/243 places, 437/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60839 ms. Remains : 206/243 places, 437/682 transitions.
[2025-06-03 19:22:32] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:22:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:22:32] [INFO ] Input system was already deterministic with 437 transitions.
[2025-06-03 19:22:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:22:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:22:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3478595296240976543.gal : 3 ms
[2025-06-03 19:22:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13152687793670912323.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3478595296240976543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13152687793670912323.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:23:02] [INFO ] Flatten gal took : 9 ms
[2025-06-03 19:23:02] [INFO ] Applying decomposition
[2025-06-03 19:23:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12990236614121667298.txt' '-o' '/tmp/graph12990236614121667298.bin' '-w' '/tmp/graph12990236614121667298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12990236614121667298.bin' '-l' '-1' '-v' '-w' '/tmp/graph12990236614121667298.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:23:02] [INFO ] Decomposing Gal with order
[2025-06-03 19:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:23:02] [INFO ] Removed a total of 537 redundant transitions.
[2025-06-03 19:23:02] [INFO ] Flatten gal took : 23 ms
[2025-06-03 19:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 7 ms.
[2025-06-03 19:23:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8502213568425036523.gal : 4 ms
[2025-06-03 19:23:02] [INFO ] Time to serialize properties into /tmp/CTLFireability618964901595986540.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8502213568425036523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability618964901595986540.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20088e+20,0.137531,7848,108,22,7357,457,579,9990,62,932,0
Converting to forward existential form...Done !
original formula: !(E(((AG(((i3.i0.u9.p38==1)&&(i3.i0.u10.p242==1))) + ((i13.u42.p173==1)&&(i3.i0.u10.p242==1))) + A(((((((i11.u37.p156==1)&&(i16.u52.p215=...818
=> equivalent forward existential formula: [(FwdU(Init,((!(E(TRUE U !(((i3.i0.u9.p38==1)&&(i3.i0.u10.p242==1))))) + ((i13.u42.p173==1)&&(i3.i0.u10.p242==1)...1215
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,5.24796,133672,1,0,255096,640,2720,353710,265,3078,187094
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2025-06-03 19:23:07] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:23:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-03 19:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:23:08] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:23:09] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:23:09] [INFO ] Invariant cache hit.
[2025-06-03 19:23:09] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30033 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30019 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60482ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60486ms
Finished structural reductions in LTL mode , in 1 iterations and 61841 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:24:09] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:24:09] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:24:09] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:24:09] [INFO ] Flatten gal took : 18 ms
[2025-06-03 19:24:09] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:24:09] [INFO ] Time to serialize gal into /tmp/CTLFireability397187934920353633.gal : 3 ms
[2025-06-03 19:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10153921044301538464.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability397187934920353633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10153921044301538464.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:24:39] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:24:39] [INFO ] Applying decomposition
[2025-06-03 19:24:39] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2690371709811397418.txt' '-o' '/tmp/graph2690371709811397418.bin' '-w' '/tmp/graph2690371709811397418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2690371709811397418.bin' '-l' '-1' '-v' '-w' '/tmp/graph2690371709811397418.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:24:39] [INFO ] Decomposing Gal with order
[2025-06-03 19:24:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:24:39] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:24:39] [INFO ] Flatten gal took : 35 ms
[2025-06-03 19:24:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 8 ms.
[2025-06-03 19:24:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16231053840329380256.gal : 6 ms
[2025-06-03 19:24:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6188515211432029973.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16231053840329380256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6188515211432029973.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83376e+21,0.224734,9416,161,23,11378,379,757,12412,57,559,0
Converting to forward existential form...Done !
original formula: E(AG((i6.u17.p71==1)) U ((AF((A((i0.i2.u25.p101==1) U (((i4.u11.p48==1)&&(i1.u23.p95==1))&&(i1.u2.p241==1))) * (EX(((i10.u34.p139==1)&&(i...656
=> equivalent forward existential formula: (([(FwdU(Init,!(E(TRUE U !((i6.u17.p71==1))))) * !(EG(!((!((E(!((((i4.u11.p48==1)&&(i1.u23.p95==1))&&(i1.u2.p241...1053
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,0.374545,9544,1,0,11378,379,3476,12412,249,676,13362
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 19:24:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:24:40] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-03 19:24:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:24:40] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:24:41] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:24:41] [INFO ] Invariant cache hit.
[2025-06-03 19:24:41] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30038 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30017 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60371ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Finished structural reductions in LTL mode , in 1 iterations and 61427 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:25:41] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:25:41] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:25:41] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:25:41] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:25:41] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3988563744678864019.gal : 3 ms
[2025-06-03 19:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13997738993409654357.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3988563744678864019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13997738993409654357.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:26:11] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:26:11] [INFO ] Applying decomposition
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5220892061898551243.txt' '-o' '/tmp/graph5220892061898551243.bin' '-w' '/tmp/graph5220892061898551243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5220892061898551243.bin' '-l' '-1' '-v' '-w' '/tmp/graph5220892061898551243.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:26:12] [INFO ] Decomposing Gal with order
[2025-06-03 19:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:26:12] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 34 ms
[2025-06-03 19:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 23 ms.
[2025-06-03 19:26:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6349699685573717684.gal : 6 ms
[2025-06-03 19:26:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2754650079396198407.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6349699685573717684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2754650079396198407.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,3.83376e+21,0.383412,13004,125,23,20815,499,727,18465,57,1232,0
Converting to forward existential form...Done !
original formula: E(((AX(!(A((((i7.u23.p95==1)&&(i10.u32.p132==1))&&(i0.u2.p241==1)) U ((i14.u47.p189==1)&&(i5.i1.u15.p242==1))))) + (i17.u56.p226==1)) + (...542
=> equivalent forward existential formula: [((FwdU(Init,((!(EX(!(!(!((E(!(((i14.u47.p189==1)&&(i5.i1.u15.p242==1))) U (!((((i7.u23.p95==1)&&(i10.u32.p132==...763
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.425748,13132,1,0,20815,499,3032,18465,217,1232,6003
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 198 edges and 243 vertex of which 60 / 243 are part of one of the 20 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 277 edges and 200 vertex of which 198 / 200 are part of one of the 20 SCC in 0 ms
Free SCC test removed 178 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 22 transition count 470
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 464 transitions
Reduce isomorphic transitions removed 464 transitions.
Iterating post reduction 1 with 483 rules applied. Total rules applied 487 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 489 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 491 place count 2 transition count 3
Applied a total of 491 rules in 11 ms. Remains 2 /243 variables (removed 241) and now considering 3/682 (removed 679) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-06-03 19:26:12] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:26:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 19:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:26:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:26:12] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-03 19:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/243 places, 3/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 144 ms. Remains : 2/243 places, 3/682 transitions.
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:26:12] [INFO ] Input system was already deterministic with 3 transitions.
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 19:26:12] [INFO ] Flatten gal took : 0 ms
[2025-06-03 19:26:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10490637592970219139.gal : 0 ms
[2025-06-03 19:26:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11409765154478966540.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10490637592970219139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11409765154478966540.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 190 edges and 243 vertex of which 48 / 243 are part of one of the 16 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 193 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 244 transitions
Redundant transition composition rules discarded 244 transitions
Iterating global reduction 0 with 244 rules applied. Total rules applied 281 place count 193 transition count 283
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 283 place count 193 transition count 283
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 285 place count 191 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 287 place count 191 transition count 281
Applied a total of 287 rules in 37 ms. Remains 191 /243 variables (removed 52) and now considering 281/682 (removed 401) transitions.
[2025-06-03 19:26:12] [INFO ] Flow matrix only has 266 transitions (discarded 15 similar events)
// Phase 1: matrix 266 rows 191 cols
[2025-06-03 19:26:12] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:26:12] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-03 19:26:12] [INFO ] Flow matrix only has 266 transitions (discarded 15 similar events)
[2025-06-03 19:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:26:13] [INFO ] State equation strengthened by 133 read => feed constraints.
[2025-06-03 19:26:13] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:26:13] [INFO ] Redundant transitions in 3 ms returned []
Running 280 sub problems to find dead transitions.
[2025-06-03 19:26:13] [INFO ] Flow matrix only has 266 transitions (discarded 15 similar events)
[2025-06-03 19:26:13] [INFO ] Invariant cache hit.
[2025-06-03 19:26:13] [INFO ] State equation strengthened by 133 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 265/456 variables, 191/213 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 132/345 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 1/457 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/457 variables, and 346 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 191/191 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 265/456 variables, 191/213 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 132/345 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 280/625 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 1/457 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 626 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 191/191 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_CTL mode, iteration 1 : 191/243 places, 281/682 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60712 ms. Remains : 191/243 places, 281/682 transitions.
[2025-06-03 19:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 19:27:13] [INFO ] Flatten gal took : 8 ms
[2025-06-03 19:27:13] [INFO ] Input system was already deterministic with 281 transitions.
[2025-06-03 19:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 19:27:13] [INFO ] Flatten gal took : 7 ms
[2025-06-03 19:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability694121523106054545.gal : 2 ms
[2025-06-03 19:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12899447220728545769.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability694121523106054545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12899447220728545769.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.71301e+19,7.28353,155572,2,4007,5,1.16472e+06,6,0,1027,364715,0
Converting to forward existential form...Done !
original formula: AF((A((((p96==1)&&(p131==1))&&(p241==1)) U ((p172==1)&&(p242==1))) + EG((((p24==1)&&(p35==1))&&(p241==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((p172==1)&&(p242==1))) U (!((((p96==1)&&(p131==1))&&(p241==1))) * !(((p172==1)&&(p242==1))...244
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 180/0/101
Detected timeout of ITS tools.
[2025-06-03 19:27:43] [INFO ] Flatten gal took : 5 ms
[2025-06-03 19:27:43] [INFO ] Applying decomposition
[2025-06-03 19:27:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3201687875704290726.txt' '-o' '/tmp/graph3201687875704290726.bin' '-w' '/tmp/graph3201687875704290726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3201687875704290726.bin' '-l' '-1' '-v' '-w' '/tmp/graph3201687875704290726.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:27:43] [INFO ] Decomposing Gal with order
[2025-06-03 19:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:27:43] [INFO ] Removed a total of 157 redundant transitions.
[2025-06-03 19:27:43] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 3 ms.
[2025-06-03 19:27:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15198925632999741091.gal : 3 ms
[2025-06-03 19:27:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7317212019334822483.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15198925632999741091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7317212019334822483.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71301e+19,0.060064,5776,63,23,1718,271,372,2117,57,504,0
Converting to forward existential form...Done !
original formula: AF((A((((i7.u23.p96==1)&&(i10.u32.p131==1))&&(i10.u32.p241==1)) U ((i14.u44.p172==1)&&(i4.u14.p242==1))) + EG((((i1.u5.p24==1)&&(i2.u8.p3...184
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((i14.u44.p172==1)&&(i4.u14.p242==1))) U (!((((i7.u23.p96==1)&&(i10.u32.p131==1))&&(i10.u32...332
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,0.476427,18192,1,0,33965,306,1565,36383,249,716,26227
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2025-06-03 19:27:44] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:27:44] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-03 19:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:27:44] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:27:45] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:27:45] [INFO ] Invariant cache hit.
[2025-06-03 19:27:45] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30026 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30020 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Finished structural reductions in LTL mode , in 1 iterations and 61756 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:28:45] [INFO ] Flatten gal took : 11 ms
[2025-06-03 19:28:45] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:28:45] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:28:45] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:28:45] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17069844013106789038.gal : 3 ms
[2025-06-03 19:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16812371760997701620.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17069844013106789038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16812371760997701620.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:29:16] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:29:16] [INFO ] Applying decomposition
[2025-06-03 19:29:16] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15132025464275420655.txt' '-o' '/tmp/graph15132025464275420655.bin' '-w' '/tmp/graph15132025464275420655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15132025464275420655.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132025464275420655.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:29:16] [INFO ] Decomposing Gal with order
[2025-06-03 19:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:29:16] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:29:16] [INFO ] Flatten gal took : 30 ms
[2025-06-03 19:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 7 ms.
[2025-06-03 19:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12435664707531130689.gal : 4 ms
[2025-06-03 19:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13110240272334427243.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12435664707531130689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13110240272334427243.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83376e+21,0.230145,10184,161,23,13308,378,757,13776,57,558,0
Converting to forward existential form...Done !
original formula: E(!((((((i6.u17.p72==1)&&(i11.u32.p131==1))&&(i1.u2.p241==1)) + (EF((((i6.u17.p71==1)&&(i14.u47.p192==1))&&(i1.u2.p241==1))) * EX((((i5.u...438
=> equivalent forward existential formula: [(FwdU(Init,!((((((i6.u17.p72==1)&&(i11.u32.p131==1))&&(i1.u2.p241==1)) + (E(TRUE U (((i6.u17.p71==1)&&(i14.u47....502
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.313455,10184,1,0,13308,378,3257,13776,223,605,9814
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2025-06-03 19:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:16] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-03 19:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:29:17] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-03 19:29:17] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-06-03 19:29:17] [INFO ] Invariant cache hit.
[2025-06-03 19:29:17] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/925 variables, and 265 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30027 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/243 constraints, ReadFeed: 0/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 22/264 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (OVERLAPS) 682/925 variables, 243/508 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 481/989 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 681/1670 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 925/925 variables, and 1670 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30019 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 243/243 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in LTL mode , in 1 iterations and 61520 ms. Remains : 243/243 places, 682/682 transitions.
[2025-06-03 19:30:18] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:30:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:30:18] [INFO ] Input system was already deterministic with 682 transitions.
[2025-06-03 19:30:18] [INFO ] Flatten gal took : 19 ms
[2025-06-03 19:30:18] [INFO ] Flatten gal took : 20 ms
[2025-06-03 19:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4986649739853979193.gal : 5 ms
[2025-06-03 19:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6147311394442522693.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4986649739853979193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6147311394442522693.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:30:48] [INFO ] Flatten gal took : 12 ms
[2025-06-03 19:30:48] [INFO ] Applying decomposition
[2025-06-03 19:30:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3264788266389143802.txt' '-o' '/tmp/graph3264788266389143802.bin' '-w' '/tmp/graph3264788266389143802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3264788266389143802.bin' '-l' '-1' '-v' '-w' '/tmp/graph3264788266389143802.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:30:48] [INFO ] Decomposing Gal with order
[2025-06-03 19:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:30:48] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:30:48] [INFO ] Flatten gal took : 33 ms
[2025-06-03 19:30:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 7 ms.
[2025-06-03 19:30:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16858834734972554572.gal : 4 ms
[2025-06-03 19:30:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12186974550496401631.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16858834734972554572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12186974550496401631.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83376e+21,0.254133,10320,153,23,13865,373,761,15143,57,607,0
Converting to forward existential form...Done !
original formula: AF(AG(((AX((((i5.u17.p71==1)&&(i15.u50.p204==1))&&(i1.u5.p241==1))) + AG(A((((i4.u14.p59==1)&&(i12.u38.p156==1))&&(i1.u5.p241==1)) U ((i3...376
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((((i5.u17.p71==1)&&(i15.u50.p204==1))&&(i1.u5.p241==1))))) + !(E(TRUE U !(!((...554
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,0.702331,14544,1,0,20857,389,4155,28463,257,800,35339
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 19:30:49] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:30:49] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:30:49] [INFO ] Applying decomposition
[2025-06-03 19:30:49] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11969435137585708273.txt' '-o' '/tmp/graph11969435137585708273.bin' '-w' '/tmp/graph11969435137585708273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11969435137585708273.bin' '-l' '-1' '-v' '-w' '/tmp/graph11969435137585708273.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:30:49] [INFO ] Decomposing Gal with order
[2025-06-03 19:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:30:49] [INFO ] Removed a total of 1139 redundant transitions.
[2025-06-03 19:30:49] [INFO ] Flatten gal took : 31 ms
[2025-06-03 19:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 6 ms.
[2025-06-03 19:30:49] [INFO ] Time to serialize gal into /tmp/CTLFireability312226231030551034.gal : 6 ms
[2025-06-03 19:30:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2159338257939496945.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability312226231030551034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2159338257939496945.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,3.83376e+21,0.202538,9812,159,23,12481,379,763,13345,57,610,0
Converting to forward existential form...Done !
original formula: E(((!((((i12.u41.p167==1)&&(i13.u44.p180==1))&&(i1.u2.p241==1))) * !(((((i3.u11.p47==1)&&(i8.u29.p120==1))&&(i1.u2.p241==1)) + AF(((((i14...854
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!((((i12.u41.p167==1)&&(i13.u44.p180==1))&&(i1.u2.p241==1))) * !(((((i3.u11.p47==1)&&(i8.u29....919
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,19.3581,286804,1,0,411314,379,3189,970767,213,1032,277426
FORMULA FlexibleBarrier-PT-20a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1178164 ms.
BK_STOP 1748979068782
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102700530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;